/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 21:59:47,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 21:59:47,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 21:59:47,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 21:59:47,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 21:59:47,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 21:59:47,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 21:59:47,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 21:59:47,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 21:59:47,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 21:59:47,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 21:59:47,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 21:59:47,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 21:59:47,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 21:59:47,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 21:59:47,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 21:59:47,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 21:59:47,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 21:59:47,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 21:59:47,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 21:59:47,679 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 21:59:47,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 21:59:47,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 21:59:47,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 21:59:47,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 21:59:47,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 21:59:47,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 21:59:47,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 21:59:47,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 21:59:47,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 21:59:47,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 21:59:47,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 21:59:47,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 21:59:47,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 21:59:47,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 21:59:47,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 21:59:47,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 21:59:47,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 21:59:47,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 21:59:47,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 21:59:47,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 21:59:47,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 21:59:47,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-19 21:59:47,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 21:59:47,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 21:59:47,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 21:59:47,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 21:59:47,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 21:59:47,708 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 21:59:47,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 21:59:47,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 21:59:47,708 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 21:59:47,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 21:59:47,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 21:59:47,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 21:59:47,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 21:59:47,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 21:59:47,710 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 21:59:47,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 21:59:47,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-19 21:59:47,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 21:59:47,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 21:59:47,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 21:59:47,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 21:59:47,899 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 21:59:47,900 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-19 21:59:47,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6f89e89/ee15fce093ca4809b209e66f03140db1/FLAG9ca456621 [2022-03-19 21:59:48,230 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 21:59:48,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-03-19 21:59:48,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6f89e89/ee15fce093ca4809b209e66f03140db1/FLAG9ca456621 [2022-03-19 21:59:48,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e6f89e89/ee15fce093ca4809b209e66f03140db1 [2022-03-19 21:59:48,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 21:59:48,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 21:59:48,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 21:59:48,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 21:59:48,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 21:59:48,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc22253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48, skipping insertion in model container [2022-03-19 21:59:48,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 21:59:48,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 21:59:48,846 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-19 21:59:48,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 21:59:48,868 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 21:59:48,875 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-19 21:59:48,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 21:59:48,888 INFO L208 MainTranslator]: Completed translation [2022-03-19 21:59:48,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48 WrapperNode [2022-03-19 21:59:48,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 21:59:48,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 21:59:48,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 21:59:48,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 21:59:48,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 21:59:48,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 21:59:48,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 21:59:48,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 21:59:48,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (1/1) ... [2022-03-19 21:59:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 21:59:48,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:48,943 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-19 21:59:48,958 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-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-03-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 21:59:48,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-03-19 21:59:48,969 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 21:59:48,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 21:59:48,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 21:59:48,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 21:59:48,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 21:59:49,031 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 21:59:49,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 21:59:51,227 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 21:59:51,241 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 21:59:51,241 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 21:59:51,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 09:59:51 BoogieIcfgContainer [2022-03-19 21:59:51,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 21:59:51,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 21:59:51,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 21:59:51,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 21:59:51,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 09:59:48" (1/3) ... [2022-03-19 21:59:51,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d36c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 09:59:51, skipping insertion in model container [2022-03-19 21:59:51,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 09:59:48" (2/3) ... [2022-03-19 21:59:51,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d36c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 09:59:51, skipping insertion in model container [2022-03-19 21:59:51,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 09:59:51" (3/3) ... [2022-03-19 21:59:51,248 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c [2022-03-19 21:59:51,251 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 21:59:51,252 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 21:59:51,281 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 21:59:51,286 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=PETRI_NET, 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-19 21:59:51,286 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 21:59:51,296 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-19 21:59:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-19 21:59:51,300 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:51,300 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:51,301 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:51,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times [2022-03-19 21:59:51,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:51,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350405908] [2022-03-19 21:59:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 21:59:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,471 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-19 21:59:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:51,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350405908] [2022-03-19 21:59:51,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350405908] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:51,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:51,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 21:59:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555635956] [2022-03-19 21:59:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:51,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 21:59:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 21:59:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 21:59:51,503 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-19 21:59:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:51,605 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-03-19 21:59:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-19 21:59:51,607 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-19 21:59:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:51,611 INFO L225 Difference]: With dead ends: 52 [2022-03-19 21:59:51,611 INFO L226 Difference]: Without dead ends: 27 [2022-03-19 21:59:51,613 INFO L912 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-19 21:59:51,615 INFO L913 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:51,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-19 21:59:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-19 21:59:51,635 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-19 21:59:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-03-19 21:59:51,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-03-19 21:59:51,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:51,636 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-03-19 21:59:51,637 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-19 21:59:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-03-19 21:59:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-19 21:59:51,637 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:51,637 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:51,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 21:59:51,638 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times [2022-03-19 21:59:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:51,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800167625] [2022-03-19 21:59:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 21:59:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:51,767 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-19 21:59:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800167625] [2022-03-19 21:59:51,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800167625] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:51,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:51,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 21:59:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474470266] [2022-03-19 21:59:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:51,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 21:59:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:51,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 21:59:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-03-19 21:59:51,771 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-19 21:59:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:51,922 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-03-19 21:59:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 21:59:51,924 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-19 21:59:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:51,928 INFO L225 Difference]: With dead ends: 35 [2022-03-19 21:59:51,929 INFO L226 Difference]: Without dead ends: 27 [2022-03-19 21:59:51,931 INFO L912 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-19 21:59:51,931 INFO L913 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-19 21:59:51,932 INFO L914 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-19 21:59:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-19 21:59:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-19 21:59:51,937 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-19 21:59:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-03-19 21:59:51,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-03-19 21:59:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:51,938 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-03-19 21:59:51,938 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-19 21:59:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-03-19 21:59:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-19 21:59:51,938 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:51,938 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:51,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 21:59:51,939 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:51,939 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times [2022-03-19 21:59:51,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:51,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268062656] [2022-03-19 21:59:51,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:51,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:52,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:52,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 21:59:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:52,171 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-19 21:59:52,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:52,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268062656] [2022-03-19 21:59:52,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268062656] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:52,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:52,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 21:59:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631138610] [2022-03-19 21:59:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:52,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 21:59:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:52,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 21:59:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-19 21:59:52,177 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-19 21:59:54,310 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-19 21:59:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:54,566 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-03-19 21:59:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 21:59:54,566 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-19 21:59:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:54,567 INFO L225 Difference]: With dead ends: 40 [2022-03-19 21:59:54,567 INFO L226 Difference]: Without dead ends: 31 [2022-03-19 21:59:54,567 INFO L912 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-19 21:59:54,568 INFO L913 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.2s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:54,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-03-19 21:59:54,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-19 21:59:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-03-19 21:59:54,573 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-19 21:59:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-03-19 21:59:54,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-03-19 21:59:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:54,574 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-03-19 21:59:54,574 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-19 21:59:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-03-19 21:59:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-19 21:59:54,575 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:54,575 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:54,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 21:59:54,575 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:54,576 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times [2022-03-19 21:59:54,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:54,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384696646] [2022-03-19 21:59:54,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 21:59:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,659 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-19 21:59:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:54,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384696646] [2022-03-19 21:59:54,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384696646] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 21:59:54,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 21:59:54,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 21:59:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348089155] [2022-03-19 21:59:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 21:59:54,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 21:59:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 21:59:54,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 21:59:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-19 21:59:54,661 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-19 21:59:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 21:59:54,813 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-03-19 21:59:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 21:59:54,814 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-19 21:59:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 21:59:54,816 INFO L225 Difference]: With dead ends: 50 [2022-03-19 21:59:54,816 INFO L226 Difference]: Without dead ends: 37 [2022-03-19 21:59:54,816 INFO L912 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-19 21:59:54,817 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-19 21:59:54,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 21:59:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-19 21:59:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-19 21:59:54,822 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-19 21:59:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-03-19 21:59:54,823 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-03-19 21:59:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 21:59:54,825 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-03-19 21:59:54,825 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-19 21:59:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-03-19 21:59:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-19 21:59:54,827 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 21:59:54,827 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 21:59:54,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 21:59:54,827 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 21:59:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 21:59:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash 291267457, now seen corresponding path program 1 times [2022-03-19 21:59:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 21:59:54,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641798414] [2022-03-19 21:59:54,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 21:59:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 21:59:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 21:59:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:54,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 21:59:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:55,089 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-19 21:59:55,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 21:59:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641798414] [2022-03-19 21:59:55,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641798414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 21:59:55,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803840642] [2022-03-19 21:59:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 21:59:55,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 21:59:55,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 21:59:55,092 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-19 21:59:55,133 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-19 21:59:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 21:59:55,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-19 21:59:55,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 21:59:55,300 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-19 21:59:55,423 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 72 treesize of output 65 [2022-03-19 22:00:01,806 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (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-19 22:00:08,210 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (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-19 22:00:14,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= 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))))) is different from false [2022-03-19 22:00:38,209 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= 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))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)))) is different from false [2022-03-19 22:00:44,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (< .cse7 4294967295) (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-19 22:00:51,102 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (< .cse1 4294967295) (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))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-03-19 22:00:57,867 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (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))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))))) is different from false [2022-03-19 22:01:08,744 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-03-19 22:01:08,744 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 153 treesize of output 1 [2022-03-19 22:01:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-19 22:01:08,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:01:09,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803840642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:09,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-19 22:01:09,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-03-19 22:01:09,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12932363] [2022-03-19 22:01:09,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-03-19 22:01:09,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-19 22:01:09,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:01:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-19 22:01:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=179, Unknown=7, NotChecked=224, Total=462 [2022-03-19 22:01:09,185 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-19 22:01:11,352 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-19 22:01:13,615 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (<= (+ 2 (* (div c_~SIZE~0 4294967296) 4294967296)) 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-19 22:01:15,749 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (<= 0 c_linear_search_~j~0) (< .cse0 4294967295) (< 1 .cse0) (<= 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))))) is different from false [2022-03-19 22:01:17,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= 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))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-03-19 22:01:20,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= 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) (< .cse7 4294967295) (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_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-03-19 22:01:22,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= 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))) (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-19 22:01:24,290 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (not |c_linear_search_#t~short5|))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= 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))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) .cse1) (or (and (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (<= c_linear_search_~j~0 1)) .cse1))) is different from false [2022-03-19 22:01:26,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= 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) (< .cse7 4294967295) (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-19 22:01:28,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (<= c_linear_search_~j~0 1) (< .cse1 4294967295) (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))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-03-19 22:01:30,702 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (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-19 22:01:32,845 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< .cse0 4294967295) (< 1 .cse0) (= |c_old(#memory_int)| |c_#memory_int|) (= 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))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-03-19 22:01:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:01:32,870 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-03-19 22:01:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-19 22:01:32,871 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-03-19 22:01:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:01:32,872 INFO L225 Difference]: With dead ends: 52 [2022-03-19 22:01:32,872 INFO L226 Difference]: Without dead ends: 40 [2022-03-19 22:01:32,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=106, Invalid=365, Unknown=17, NotChecked=918, Total=1406 [2022-03-19 22:01:32,873 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:01:32,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 1 Unknown, 119 Unchecked, 2.1s Time] [2022-03-19 22:01:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-19 22:01:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-03-19 22:01:32,878 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-19 22:01:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-03-19 22:01:32,879 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-03-19 22:01:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:01:32,879 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-03-19 22:01:32,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-03-19 22:01:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-03-19 22:01:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-19 22:01:32,880 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:01:32,880 INFO L499 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-19 22:01:32,908 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-19 22:01:33,091 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-19 22:01:33,092 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:01:33,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:01:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -101759553, now seen corresponding path program 1 times [2022-03-19 22:01:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:01:33,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248627704] [2022-03-19 22:01:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:01:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:01:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-03-19 22:01:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-19 22:01:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:01:33,229 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-19 22:01:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:01:33,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248627704] [2022-03-19 22:01:33,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248627704] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:01:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988092855] [2022-03-19 22:01:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:01:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:01:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:01:33,232 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-19 22:01:33,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process