/usr/bin/java -ea -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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:00:19,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:00:19,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:00:20,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:00:20,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:00:20,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:00:20,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:00:20,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:00:20,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:00:20,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:00:20,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:00:20,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:00:20,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:00:20,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:00:20,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:00:20,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:00:20,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:00:20,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:00:20,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:00:20,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:00:20,072 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:00:20,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:00:20,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:00:20,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:00:20,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:00:20,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:00:20,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:00:20,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:00:20,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:00:20,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:00:20,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:00:20,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:00:20,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:00:20,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:00:20,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:00:20,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:00:20,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:00:20,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:00:20,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:00:20,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:00:20,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:00:20,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:00:20,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:00:20,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:00:20,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:00:20,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:00:20,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:00:20,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:00:20,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:00:20,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:00:20,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:00:20,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:00:20,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:00:20,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:00:20,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:00:20,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:00:20,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:00:20,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:00:20,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:20,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:00:20,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:00:20,102 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:00:20,102 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:00:20,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:00:20,102 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:00:20,102 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-04-28 09:00:20,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:00:20,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:00:20,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:00:20,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:00:20,376 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:00:20,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-04-28 09:00:20,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1afaac2c8/59c84a9e5a2e42df8bb62483773d155f/FLAG233adf67b [2022-04-28 09:00:20,798 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:00:20,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-04-28 09:00:20,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1afaac2c8/59c84a9e5a2e42df8bb62483773d155f/FLAG233adf67b [2022-04-28 09:00:21,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1afaac2c8/59c84a9e5a2e42df8bb62483773d155f [2022-04-28 09:00:21,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:00:21,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:00:21,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:21,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:00:21,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:00:21,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eeb86c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21, skipping insertion in model container [2022-04-28 09:00:21,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:00:21,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:00:21,402 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-04-28 09:00:21,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:21,430 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:00:21,446 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-04-28 09:00:21,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:00:21,470 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:00:21,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21 WrapperNode [2022-04-28 09:00:21,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:00:21,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:00:21,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:00:21,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:00:21,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:00:21,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:00:21,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:00:21,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:00:21,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (1/1) ... [2022-04-28 09:00:21,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:00:21,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:21,553 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-04-28 09:00:21,559 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-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:00:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 09:00:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:00:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:00:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:00:21,656 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:00:21,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:00:21,866 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:00:21,873 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:00:21,873 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:00:21,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:21 BoogieIcfgContainer [2022-04-28 09:00:21,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:00:21,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:00:21,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:00:21,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:00:21,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:00:21" (1/3) ... [2022-04-28 09:00:21,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab83f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:21, skipping insertion in model container [2022-04-28 09:00:21,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:00:21" (2/3) ... [2022-04-28 09:00:21,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab83f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:00:21, skipping insertion in model container [2022-04-28 09:00:21,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:00:21" (3/3) ... [2022-04-28 09:00:21,884 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c [2022-04-28 09:00:21,899 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:00:21,900 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:00:21,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:00:21,949 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61e1a78f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fdb24b7 [2022-04-28 09:00:21,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:00:21,963 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-04-28 09:00:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:00:21,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:21,971 INFO L195 NwaCegarLoop]: 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-04-28 09:00:21,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times [2022-04-28 09:00:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:21,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1263777915] [2022-04-28 09:00:22,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 2 times [2022-04-28 09:00:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:22,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571198070] [2022-04-28 09:00:22,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID [2022-04-28 09:00:22,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 09:00:22,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID [2022-04-28 09:00:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:00:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID [2022-04-28 09:00:22,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 09:00:22,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID [2022-04-28 09:00:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 09:00:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:22,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID [2022-04-28 09:00:22,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-04-28 09:00:22,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID [2022-04-28 09:00:22,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 09:00:22,389 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID [2022-04-28 09:00:22,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:22,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID [2022-04-28 09:00:22,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 09:00:22,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID [2022-04-28 09:00:22,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID [2022-04-28 09:00:22,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {37#true} is VALID [2022-04-28 09:00:22,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {37#true} is VALID [2022-04-28 09:00:22,397 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {51#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 09:00:22,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID [2022-04-28 09:00:22,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 09:00:22,398 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID [2022-04-28 09:00:22,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {37#true} is VALID [2022-04-28 09:00:22,398 INFO L272 TraceCheckUtils]: 12: Hoare triple {37#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {37#true} is VALID [2022-04-28 09:00:22,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID [2022-04-28 09:00:22,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume !true; {38#false} is VALID [2022-04-28 09:00:22,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID [2022-04-28 09:00:22,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 09:00:22,402 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID [2022-04-28 09:00:22,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {38#false} is VALID [2022-04-28 09:00:22,402 INFO L272 TraceCheckUtils]: 19: Hoare triple {38#false} call __VERIFIER_assert(#t~ret9); {38#false} is VALID [2022-04-28 09:00:22,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-28 09:00:22,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-28 09:00:22,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-28 09:00:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:22,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:22,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571198070] [2022-04-28 09:00:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571198070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:22,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:22,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:22,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:22,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1263777915] [2022-04-28 09:00:22,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1263777915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:22,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:22,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:00:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515619677] [2022-04-28 09:00:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:22,418 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-04-28 09:00:22,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:22,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-28 09:00:22,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:00:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:00:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:00:22,512 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-04-28 09:00:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,772 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-28 09:00:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:00:22,773 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-04-28 09:00:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:22,775 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-28 09:00:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-28 09:00:22,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-28 09:00:22,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,873 INFO L225 Difference]: With dead ends: 52 [2022-04-28 09:00:22,874 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:00:22,876 INFO L412 NwaCegarLoop]: 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-04-28 09:00:22,880 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-04-28 09:00:22,881 INFO L414 NwaCegarLoop]: 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-04-28 09:00:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:00:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 09:00:22,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:22,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second 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-04-28 09:00:22,911 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second 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-04-28 09:00:22,911 INFO L87 Difference]: Start difference. First operand 27 states. Second 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-04-28 09:00:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,914 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 09:00:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 09:00:22,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:22,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:22,916 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 27 states. [2022-04-28 09:00:22,916 INFO L87 Difference]: Start difference. First 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) Second operand 27 states. [2022-04-28 09:00:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:22,919 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 09:00:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 09:00:22,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:22,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:22,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:22,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:22,921 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-04-28 09:00:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 09:00:22,924 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 09:00:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:22,925 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 09:00:22,925 INFO L496 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-04-28 09:00:22,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 09:00:22,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 09:00:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:00:22,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:22,962 INFO L195 NwaCegarLoop]: 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-04-28 09:00:22,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:00:22,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times [2022-04-28 09:00:22,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:22,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337100359] [2022-04-28 09:00:22,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 2 times [2022-04-28 09:00:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:22,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364697148] [2022-04-28 09:00:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {269#true} is VALID [2022-04-28 09:00:23,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-28 09:00:23,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID [2022-04-28 09:00:23,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:00:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {269#true} is VALID [2022-04-28 09:00:23,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-28 09:00:23,083 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID [2022-04-28 09:00:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 09:00:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {269#true} is VALID [2022-04-28 09:00:23,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID [2022-04-28 09:00:23,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {269#true} is VALID [2022-04-28 09:00:23,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID [2022-04-28 09:00:23,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 09:00:23,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 09:00:23,129 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {269#true} #68#return; {284#(= |main_#t~ret9| 1)} is VALID [2022-04-28 09:00:23,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:23,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {269#true} is VALID [2022-04-28 09:00:23,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-28 09:00:23,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID [2022-04-28 09:00:23,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret10 := main(); {269#true} is VALID [2022-04-28 09:00:23,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {269#true} is VALID [2022-04-28 09:00:23,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {269#true} is VALID [2022-04-28 09:00:23,133 INFO L272 TraceCheckUtils]: 7: Hoare triple {269#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {288#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 09:00:23,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {269#true} is VALID [2022-04-28 09:00:23,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-28 09:00:23,134 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID [2022-04-28 09:00:23,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {269#true} is VALID [2022-04-28 09:00:23,135 INFO L272 TraceCheckUtils]: 12: Hoare triple {269#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {269#true} is VALID [2022-04-28 09:00:23,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {269#true} is VALID [2022-04-28 09:00:23,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID [2022-04-28 09:00:23,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {269#true} is VALID [2022-04-28 09:00:23,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID [2022-04-28 09:00:23,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {269#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 09:00:23,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-28 09:00:23,138 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {269#true} #68#return; {284#(= |main_#t~ret9| 1)} is VALID [2022-04-28 09:00:23,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {284#(= |main_#t~ret9| 1)} is VALID [2022-04-28 09:00:23,140 INFO L272 TraceCheckUtils]: 21: Hoare triple {284#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {285#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-28 09:00:23,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {286#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-28 09:00:23,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {270#false} is VALID [2022-04-28 09:00:23,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-28 09:00:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:23,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364697148] [2022-04-28 09:00:23,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364697148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:23,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:23,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:23,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:23,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337100359] [2022-04-28 09:00:23,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337100359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:23,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:23,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379696670] [2022-04-28 09:00:23,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:23,145 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-04-28 09:00:23,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:23,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-28 09:00:23,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:00:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:00:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:00:23,172 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-04-28 09:00:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,579 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-28 09:00:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:00:23,579 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-04-28 09:00:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 09:00:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-28 09:00:23,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-28 09:00:23,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,631 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:00:23,632 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:00:23,632 INFO L412 NwaCegarLoop]: 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-04-28 09:00:23,633 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:00:23,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 09:00:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:00:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 09:00:23,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:23,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second 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-04-28 09:00:23,640 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second 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-04-28 09:00:23,640 INFO L87 Difference]: Start difference. First operand 27 states. Second 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-04-28 09:00:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,642 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 09:00:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 09:00:23,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:23,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:23,643 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 27 states. [2022-04-28 09:00:23,644 INFO L87 Difference]: Start difference. First 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) Second operand 27 states. [2022-04-28 09:00:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:23,646 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 09:00:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 09:00:23,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:23,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:23,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:23,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:23,647 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-04-28 09:00:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 09:00:23,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-28 09:00:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:23,649 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 09:00:23,649 INFO L496 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-04-28 09:00:23,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 09:00:23,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 09:00:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 09:00:23,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:23,687 INFO L195 NwaCegarLoop]: 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-04-28 09:00:23,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:00:23,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times [2022-04-28 09:00:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1694526642] [2022-04-28 09:00:23,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:00:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 2 times [2022-04-28 09:00:23,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:23,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687089966] [2022-04-28 09:00:23,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:23,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {479#true} is VALID [2022-04-28 09:00:23,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-28 09:00:23,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID [2022-04-28 09:00:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:00:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {479#true} is VALID [2022-04-28 09:00:23,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-28 09:00:23,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 09:00:23,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 09:00:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:23,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:23,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-28 09:00:23,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:23,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:23,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:23,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:23,922 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {480#false} is VALID [2022-04-28 09:00:23,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:23,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {479#true} is VALID [2022-04-28 09:00:23,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-28 09:00:23,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID [2022-04-28 09:00:23,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret10 := main(); {479#true} is VALID [2022-04-28 09:00:23,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {479#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {479#true} is VALID [2022-04-28 09:00:23,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {479#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 09:00:23,926 INFO L272 TraceCheckUtils]: 7: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {496#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 09:00:23,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {479#true} is VALID [2022-04-28 09:00:23,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#true} assume true; {479#true} is VALID [2022-04-28 09:00:23,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {479#true} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 09:00:23,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-28 09:00:23,930 INFO L272 TraceCheckUtils]: 12: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {479#true} is VALID [2022-04-28 09:00:23,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:23,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-28 09:00:23,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:23,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:23,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:23,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-28 09:00:23,937 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {480#false} is VALID [2022-04-28 09:00:23,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {480#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {480#false} is VALID [2022-04-28 09:00:23,937 INFO L272 TraceCheckUtils]: 21: Hoare triple {480#false} call __VERIFIER_assert(#t~ret9); {480#false} is VALID [2022-04-28 09:00:23,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {480#false} ~cond := #in~cond; {480#false} is VALID [2022-04-28 09:00:23,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {480#false} assume 0 == ~cond; {480#false} is VALID [2022-04-28 09:00:23,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {480#false} assume !false; {480#false} is VALID [2022-04-28 09:00:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:23,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687089966] [2022-04-28 09:00:23,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687089966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:23,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:23,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:23,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:23,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1694526642] [2022-04-28 09:00:23,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1694526642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:23,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:23,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:00:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480347867] [2022-04-28 09:00:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:23,940 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-04-28 09:00:23,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:23,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-28 09:00:23,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:23,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:00:23,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:00:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:00:23,969 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-04-28 09:00:28,423 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-04-28 09:00:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,021 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-28 09:00:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:00:29,022 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-04-28 09:00:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-28 09:00:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-28 09:00:29,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-28 09:00:29,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:29,103 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:00:29,103 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 09:00:29,104 INFO L412 NwaCegarLoop]: 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-04-28 09:00:29,104 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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-04-28 09:00:29,105 INFO L414 NwaCegarLoop]: 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-04-28 09:00:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 09:00:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-28 09:00:29,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:29,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second 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-04-28 09:00:29,153 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second 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-04-28 09:00:29,154 INFO L87 Difference]: Start difference. First operand 31 states. Second 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-04-28 09:00:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,156 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 09:00:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-28 09:00:29,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:29,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:29,156 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 31 states. [2022-04-28 09:00:29,157 INFO L87 Difference]: Start difference. First 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) Second operand 31 states. [2022-04-28 09:00:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,158 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 09:00:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-28 09:00:29,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:29,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:29,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:29,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:29,159 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-04-28 09:00:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-28 09:00:29,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-04-28 09:00:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:29,161 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-28 09:00:29,161 INFO L496 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-04-28 09:00:29,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-28 09:00:29,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-28 09:00:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:00:29,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:29,233 INFO L195 NwaCegarLoop]: 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-04-28 09:00:29,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 09:00:29,233 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times [2022-04-28 09:00:29,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:29,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817459116] [2022-04-28 09:00:29,249 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:29,249 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 2 times [2022-04-28 09:00:29,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:29,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200290788] [2022-04-28 09:00:29,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:29,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:29,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {740#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {721#true} is VALID [2022-04-28 09:00:29,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID [2022-04-28 09:00:29,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #72#return; {721#true} is VALID [2022-04-28 09:00:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:00:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:29,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {741#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {721#true} is VALID [2022-04-28 09:00:29,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID [2022-04-28 09:00:29,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #66#return; {721#true} is VALID [2022-04-28 09:00:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 09:00:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:29,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {721#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:29,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:29,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:29,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {743#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:29,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {743#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {722#false} is VALID [2022-04-28 09:00:29,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {722#false} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {722#false} is VALID [2022-04-28 09:00:29,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#false} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {722#false} is VALID [2022-04-28 09:00:29,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {722#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {722#false} is VALID [2022-04-28 09:00:29,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {722#false} is VALID [2022-04-28 09:00:29,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#false} assume true; {722#false} is VALID [2022-04-28 09:00:29,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {722#false} {721#true} #68#return; {722#false} is VALID [2022-04-28 09:00:29,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {740#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:29,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {721#true} is VALID [2022-04-28 09:00:29,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {721#true} assume true; {721#true} is VALID [2022-04-28 09:00:29,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {721#true} {721#true} #72#return; {721#true} is VALID [2022-04-28 09:00:29,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {721#true} call #t~ret10 := main(); {721#true} is VALID [2022-04-28 09:00:29,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {721#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {721#true} is VALID [2022-04-28 09:00:29,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {721#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {721#true} is VALID [2022-04-28 09:00:29,409 INFO L272 TraceCheckUtils]: 7: Hoare triple {721#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {741#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 09:00:29,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {721#true} is VALID [2022-04-28 09:00:29,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#true} assume true; {721#true} is VALID [2022-04-28 09:00:29,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {721#true} {721#true} #66#return; {721#true} is VALID [2022-04-28 09:00:29,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {721#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {721#true} is VALID [2022-04-28 09:00:29,410 INFO L272 TraceCheckUtils]: 12: Hoare triple {721#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {721#true} is VALID [2022-04-28 09:00:29,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {721#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:29,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:29,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:29,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {742#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {743#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:00:29,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {743#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume 20 == ~j~0 % 4294967296;~j~0 := -1; {722#false} is VALID [2022-04-28 09:00:29,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {722#false} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {722#false} is VALID [2022-04-28 09:00:29,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {722#false} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {722#false} is VALID [2022-04-28 09:00:29,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {722#false} is VALID [2022-04-28 09:00:29,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {722#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {722#false} is VALID [2022-04-28 09:00:29,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {722#false} assume true; {722#false} is VALID [2022-04-28 09:00:29,415 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {722#false} {721#true} #68#return; {722#false} is VALID [2022-04-28 09:00:29,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {722#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {722#false} is VALID [2022-04-28 09:00:29,415 INFO L272 TraceCheckUtils]: 25: Hoare triple {722#false} call __VERIFIER_assert(#t~ret9); {722#false} is VALID [2022-04-28 09:00:29,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {722#false} ~cond := #in~cond; {722#false} is VALID [2022-04-28 09:00:29,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {722#false} assume 0 == ~cond; {722#false} is VALID [2022-04-28 09:00:29,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {722#false} assume !false; {722#false} is VALID [2022-04-28 09:00:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:29,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:29,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200290788] [2022-04-28 09:00:29,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200290788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:29,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:29,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:29,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:00:29,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817459116] [2022-04-28 09:00:29,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817459116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:00:29,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:00:29,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:00:29,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101528897] [2022-04-28 09:00:29,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:00:29,418 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-04-28 09:00:29,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:00:29,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-04-28 09:00:29,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:29,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:00:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:00:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:00:29,451 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-04-28 09:00:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,862 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-28 09:00:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:00:29,863 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-04-28 09:00:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:00:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 09:00:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. 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-04-28 09:00:29,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-28 09:00:29,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-28 09:00:29,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:29,935 INFO L225 Difference]: With dead ends: 50 [2022-04-28 09:00:29,935 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 09:00:29,935 INFO L412 NwaCegarLoop]: 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-04-28 09:00:29,936 INFO L413 NwaCegarLoop]: 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-04-28 09:00:29,937 INFO L414 NwaCegarLoop]: 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-04-28 09:00:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 09:00:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-04-28 09:00:29,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:00:29,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second 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-04-28 09:00:29,987 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second 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-04-28 09:00:29,988 INFO L87 Difference]: Start difference. First operand 37 states. Second 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-04-28 09:00:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,991 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 09:00:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 09:00:29,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:29,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:29,992 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 37 states. [2022-04-28 09:00:29,992 INFO L87 Difference]: Start difference. First 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) Second operand 37 states. [2022-04-28 09:00:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:00:29,994 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 09:00:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 09:00:29,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:00:29,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:00:29,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:00:29,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:00:29,995 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-04-28 09:00:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-28 09:00:29,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-04-28 09:00:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:00:29,997 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-28 09:00:29,997 INFO L496 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-04-28 09:00:29,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-28 09:00:30,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:00:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-28 09:00:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:00:30,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:00:30,054 INFO L195 NwaCegarLoop]: 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-04-28 09:00:30,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 09:00:30,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:00:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:00:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash 291267457, now seen corresponding path program 1 times [2022-04-28 09:00:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:00:30,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656081570] [2022-04-28 09:00:30,059 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:00:30,060 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:00:30,060 INFO L85 PathProgramCache]: Analyzing trace with hash 291267457, now seen corresponding path program 2 times [2022-04-28 09:00:30,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:00:30,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432065826] [2022-04-28 09:00:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:00:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:00:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:00:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {1010#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} assume true; {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {989#true} #72#return; {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:00:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {1012#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {989#true} is VALID [2022-04-28 09:00:30,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#true} assume true; {989#true} is VALID [2022-04-28 09:00:30,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {989#true} {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #66#return; {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 09:00:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:00:30,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1013#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:30,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1013#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-28 09:00:30,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} assume !(20 == ~j~0 % 4294967296); {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-28 09:00:30,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1016#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-28 09:00:30,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {1016#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-28 09:00:30,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-28 09:00:30,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:30,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:30,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #68#return; {990#false} is VALID [2022-04-28 09:00:30,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {989#true} call ULTIMATE.init(); {1010#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:00:30,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} assume true; {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1011#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {989#true} #72#return; {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} call #t~ret10 := main(); {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-28 09:00:30,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {994#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * (~SIZE~0 % 4294967296)); {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,586 INFO L272 TraceCheckUtils]: 7: Hoare triple {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0 % 4294967296, 4, 4 * (~SIZE~0 % 4294967296)); {1012#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-28 09:00:30,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {1012#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {989#true} is VALID [2022-04-28 09:00:30,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#true} assume true; {989#true} is VALID [2022-04-28 09:00:30,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {989#true} {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #66#return; {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * ((if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296), 4); {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,588 INFO L272 TraceCheckUtils]: 12: Hoare triple {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {989#true} is VALID [2022-04-28 09:00:30,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {989#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {1013#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-28 09:00:30,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {1013#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-28 09:00:30,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {1014#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} assume !!#t~short5;havoc #t~mem4;havoc #t~short5;#t~post6 := ~j~0;~j~0 := 1 + #t~post6;havoc #t~post6; {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-28 09:00:30,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} assume !(20 == ~j~0 % 4294967296); {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-28 09:00:30,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1015#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {1016#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-28 09:00:30,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (~j~0 % 4294967296), 4);#t~short5 := #t~mem4 != ~q; {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-28 09:00:30,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-28 09:00:30,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {1017#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:30,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 09:00:30,602 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {995#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} #68#return; {990#false} is VALID [2022-04-28 09:00:30,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {990#false} is VALID [2022-04-28 09:00:30,602 INFO L272 TraceCheckUtils]: 25: Hoare triple {990#false} call __VERIFIER_assert(#t~ret9); {990#false} is VALID [2022-04-28 09:00:30,602 INFO L290 TraceCheckUtils]: 26: Hoare triple {990#false} ~cond := #in~cond; {990#false} is VALID [2022-04-28 09:00:30,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#false} assume 0 == ~cond; {990#false} is VALID [2022-04-28 09:00:30,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#false} assume !false; {990#false} is VALID [2022-04-28 09:00:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:00:30,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:00:30,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432065826] [2022-04-28 09:00:30,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432065826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:00:30,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758026010] [2022-04-28 09:00:30,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:00:30,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:00:30,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:00:30,606 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-04-28 09:00:30,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process