/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-e106359-m
[2022-04-15 12:01:47,141 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 12:01:47,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 12:01:47,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 12:01:47,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 12:01:47,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 12:01:47,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 12:01:47,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 12:01:47,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 12:01:47,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 12:01:47,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 12:01:47,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 12:01:47,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 12:01:47,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 12:01:47,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 12:01:47,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 12:01:47,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 12:01:47,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 12:01:47,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 12:01:47,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 12:01:47,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 12:01:47,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 12:01:47,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 12:01:47,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 12:01:47,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 12:01:47,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 12:01:47,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 12:01:47,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 12:01:47,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 12:01:47,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 12:01:47,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 12:01:47,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 12:01:47,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 12:01:47,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 12:01:47,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 12:01:47,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 12:01:47,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 12:01:47,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 12:01:47,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 12:01:47,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 12:01:47,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 12:01:47,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 12:01:47,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-15 12:01:47,252 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 12:01:47,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 12:01:47,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 12:01:47,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 12:01:47,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 12:01:47,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 12:01:47,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 12:01:47,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 12:01:47,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 12:01:47,255 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 12:01:47,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 12:01:47,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 12:01:47,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 12:01:47,256 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 12:01:47,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 12:01:47,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 12:01:47,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 12:01:47,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 12:01:47,257 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 12:01:47,257 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 12:01:47,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 12:01:47,257 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-15 12:01:47,257 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-15 12:01:47,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 12:01:47,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 12:01:47,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 12:01:47,533 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 12:01:47,534 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 12:01:47,535 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-15 12:01:47,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67d8b9c3/fd3ce4a860324ed0b208057ad20d1a33/FLAG74040233c
[2022-04-15 12:01:47,994 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 12:01:47,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c
[2022-04-15 12:01:48,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67d8b9c3/fd3ce4a860324ed0b208057ad20d1a33/FLAG74040233c
[2022-04-15 12:01:48,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e67d8b9c3/fd3ce4a860324ed0b208057ad20d1a33
[2022-04-15 12:01:48,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 12:01:48,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 12:01:48,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 12:01:48,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 12:01:48,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 12:01:48,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d9c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48, skipping insertion in model container
[2022-04-15 12:01:48,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 12:01:48,049 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 12:01:48,259 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-15 12:01:48,296 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 12:01:48,306 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 12:01:48,318 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-15 12:01:48,337 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 12:01:48,350 INFO L208 MainTranslator]: Completed translation
[2022-04-15 12:01:48,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48 WrapperNode
[2022-04-15 12:01:48,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 12:01:48,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 12:01:48,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 12:01:48,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 12:01:48,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 12:01:48,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 12:01:48,407 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 12:01:48,407 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 12:01:48,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ...
[2022-04-15 12:01:48,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 12:01:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 12:01:48,436 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-15 12:01:48,463 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-15 12:01:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 12:01:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 12:01:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 12:01:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 12:01:48,480 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search
[2022-04-15 12:01:48,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 12:01:48,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2022-04-15 12:01:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 12:01:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 12:01:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 12:01:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 12:01:48,481 INFO L130 BoogieDeclarations]: Found specification of procedure calloc
[2022-04-15 12:01:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 12:01:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-15 12:01:48,482 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search
[2022-04-15 12:01:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 12:01:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 12:01:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-04-15 12:01:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2022-04-15 12:01:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 12:01:48,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 12:01:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 12:01:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 12:01:48,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 12:01:48,567 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 12:01:48,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 12:01:48,826 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 12:01:48,834 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 12:01:48,834 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 12:01:48,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:48 BoogieIcfgContainer
[2022-04-15 12:01:48,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 12:01:48,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 12:01:48,837 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 12:01:48,842 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 12:01:48,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:48" (1/3) ...
[2022-04-15 12:01:48,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d75e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:48, skipping insertion in model container
[2022-04-15 12:01:48,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (2/3) ...
[2022-04-15 12:01:48,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d75e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:48, skipping insertion in model container
[2022-04-15 12:01:48,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:48" (3/3) ...
[2022-04-15 12:01:48,846 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c
[2022-04-15 12:01:48,851 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 12:01:48,852 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 12:01:48,894 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 12:01:48,903 INFO L340 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
[2022-04-15 12:01:48,904 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 12:01:48,921 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-15 12:01:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-15 12:01:48,927 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 12:01:48,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 12:01:48,928 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 12:01:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 12:01:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times
[2022-04-15 12:01:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:48,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [914372179]
[2022-04-15 12:01:48,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 12:01:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 2 times
[2022-04-15 12:01:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 12:01:48,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516001374]
[2022-04-15 12:01:48,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 12:01:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 12:01:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 12:01:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:49,264 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-15 12:01:49,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-15 12:01:49,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID
[2022-04-15 12:01:49,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-15 12:01:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:49,288 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-15 12:01:49,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-15 12:01:49,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID
[2022-04-15 12:01:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-15 12:01:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:49,320 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-15 12:01:49,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume !true; {38#false} is VALID
[2022-04-15 12:01:49,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID
[2022-04-15 12:01:49,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#false} assume true; {38#false} is VALID
[2022-04-15 12:01:49,324 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID
[2022-04-15 12:01:49,325 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-15 12:01:49,325 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-15 12:01:49,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-15 12:01:49,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID
[2022-04-15 12:01:49,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID
[2022-04-15 12:01:49,326 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-15 12:01:49,326 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-15 12:01:49,331 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-15 12:01:49,331 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-15 12:01:49,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-15 12:01:49,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID
[2022-04-15 12:01:49,332 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-15 12:01:49,332 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-15 12:01:49,332 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-15 12:01:49,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume !true; {38#false} is VALID
[2022-04-15 12:01:49,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID
[2022-04-15 12:01:49,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID
[2022-04-15 12:01:49,333 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID
[2022-04-15 12:01:49,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {38#false} is VALID
[2022-04-15 12:01:49,334 INFO L272 TraceCheckUtils]: 19: Hoare triple {38#false} call __VERIFIER_assert(#t~ret9); {38#false} is VALID
[2022-04-15 12:01:49,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID
[2022-04-15 12:01:49,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID
[2022-04-15 12:01:49,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume !false; {38#false} is VALID
[2022-04-15 12:01:49,335 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-15 12:01:49,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 12:01:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516001374]
[2022-04-15 12:01:49,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516001374] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:49,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:49,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 12:01:49,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 12:01:49,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [914372179]
[2022-04-15 12:01:49,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [914372179] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:49,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:49,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-15 12:01:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587532436]
[2022-04-15 12:01:49,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 12:01:49,347 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-15 12:01:49,350 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 12:01:49,353 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-15 12:01:49,394 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-15 12:01:49,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-15 12:01:49,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:49,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-15 12:01:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-15 12:01:49,421 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-15 12:01:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:49,690 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions.
[2022-04-15 12:01:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 12:01:49,691 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-15 12:01:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 12:01:49,692 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-15 12:01:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions.
[2022-04-15 12:01:49,702 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-15 12:01:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions.
[2022-04-15 12:01:49,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions.
[2022-04-15 12:01:49,782 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-15 12:01:49,791 INFO L225 Difference]: With dead ends: 52
[2022-04-15 12:01:49,791 INFO L226 Difference]: Without dead ends: 27
[2022-04-15 12:01:49,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-15 12:01:49,823 INFO L913 BasicCegarLoop]: 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-15 12:01:49,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 12:01:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-15 12:01:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-15 12:01:49,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 12:01:49,863 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-15 12:01:49,869 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-15 12:01:49,870 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-15 12:01:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:49,875 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions.
[2022-04-15 12:01:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2022-04-15 12:01:49,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:49,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:49,876 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-15 12:01:49,878 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-15 12:01:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:49,881 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions.
[2022-04-15 12:01:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2022-04-15 12:01:49,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:49,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:49,882 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 12:01:49,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 12:01:49,884 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-15 12:01:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions.
[2022-04-15 12:01:49,893 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23
[2022-04-15 12:01:49,893 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 12:01:49,893 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions.
[2022-04-15 12:01:49,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 12:01:49,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions.
[2022-04-15 12:01:49,934 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-15 12:01:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2022-04-15 12:01:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-15 12:01:49,935 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 12:01:49,935 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 12:01:49,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-15 12:01:49,936 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 12:01:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 12:01:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times
[2022-04-15 12:01:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:49,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479699338]
[2022-04-15 12:01:49,937 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 12:01:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 2 times
[2022-04-15 12:01:49,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 12:01:49,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919798755]
[2022-04-15 12:01:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 12:01:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 12:01:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 12:01:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,039 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-15 12:01:50,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-15 12:01:50,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID
[2022-04-15 12:01:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-15 12:01:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,055 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-15 12:01:50,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-15 12:01:50,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID
[2022-04-15 12:01:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-15 12:01:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,104 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-15 12:01:50,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID
[2022-04-15 12:01:50,105 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-15 12:01:50,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID
[2022-04-15 12:01:50,106 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-15 12:01:50,107 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-15 12:01:50,108 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-15 12:01:50,109 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-15 12:01:50,110 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-15 12:01:50,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-15 12:01:50,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID
[2022-04-15 12:01:50,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret10 := main(); {269#true} is VALID
[2022-04-15 12:01:50,111 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-15 12:01:50,111 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-15 12:01:50,112 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-15 12:01:50,112 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-15 12:01:50,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-15 12:01:50,113 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID
[2022-04-15 12:01:50,113 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-15 12:01:50,113 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-15 12:01:50,114 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-15 12:01:50,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID
[2022-04-15 12:01:50,114 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-15 12:01:50,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID
[2022-04-15 12:01:50,115 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-15 12:01:50,116 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-15 12:01:50,117 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-15 12:01:50,118 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-15 12:01:50,119 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-15 12:01:50,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {286#(= __VERIFIER_assert_~cond 1)} is VALID
[2022-04-15 12:01:50,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {270#false} is VALID
[2022-04-15 12:01:50,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#false} assume !false; {270#false} is VALID
[2022-04-15 12:01:50,120 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-15 12:01:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 12:01:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919798755]
[2022-04-15 12:01:50,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919798755] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:50,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:50,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 12:01:50,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 12:01:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479699338]
[2022-04-15 12:01:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479699338] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 12:01:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019905913]
[2022-04-15 12:01:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 12:01:50,123 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-15 12:01:50,124 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 12:01:50,124 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-15 12:01:50,148 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-15 12:01:50,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-15 12:01:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-15 12:01:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-04-15 12:01:50,150 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-15 12:01:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:50,529 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions.
[2022-04-15 12:01:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-15 12:01:50,530 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-15 12:01:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 12:01:50,530 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-15 12:01:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions.
[2022-04-15 12:01:50,532 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-15 12:01:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions.
[2022-04-15 12:01:50,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions.
[2022-04-15 12:01:50,582 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-15 12:01:50,584 INFO L225 Difference]: With dead ends: 35
[2022-04-15 12:01:50,584 INFO L226 Difference]: Without dead ends: 27
[2022-04-15 12:01:50,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2022-04-15 12:01:50,586 INFO L913 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time
[2022-04-15 12:01:50,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 12:01:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-15 12:01:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-15 12:01:50,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 12:01:50,596 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-15 12:01:50,598 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-15 12:01:50,598 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-15 12:01:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:50,601 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions.
[2022-04-15 12:01:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2022-04-15 12:01:50,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:50,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:50,603 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-15 12:01:50,603 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-15 12:01:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:50,606 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions.
[2022-04-15 12:01:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2022-04-15 12:01:50,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:50,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:50,608 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 12:01:50,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 12:01:50,608 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-15 12:01:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions.
[2022-04-15 12:01:50,614 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25
[2022-04-15 12:01:50,614 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 12:01:50,614 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions.
[2022-04-15 12:01:50,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 12:01:50,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions.
[2022-04-15 12:01:50,648 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-15 12:01:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2022-04-15 12:01:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-15 12:01:50,650 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 12:01:50,650 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 12:01:50,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-15 12:01:50,650 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 12:01:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 12:01:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times
[2022-04-15 12:01:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1234026999]
[2022-04-15 12:01:50,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 12:01:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 2 times
[2022-04-15 12:01:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 12:01:50,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981750677]
[2022-04-15 12:01:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 12:01:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 12:01:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 12:01:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,764 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-15 12:01:50,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-15 12:01:50,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID
[2022-04-15 12:01:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-15 12:01:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,777 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-15 12:01:50,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-15 12:01:50,779 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-15 12:01:50,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-15 12:01:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:50,887 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-15 12:01:50,888 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-15 12:01:50,889 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-15 12:01:50,889 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-15 12:01:50,890 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-15 12:01:50,891 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-15 12:01:50,892 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-15 12:01:50,893 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-15 12:01:50,893 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-15 12:01:50,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-15 12:01:50,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID
[2022-04-15 12:01:50,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret10 := main(); {479#true} is VALID
[2022-04-15 12:01:50,894 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-15 12:01:50,895 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-15 12:01:50,896 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-15 12:01:50,897 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-15 12:01:50,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-15 12:01:50,898 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-15 12:01:50,898 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-15 12:01:50,898 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-15 12:01:50,899 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-15 12:01:50,900 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-15 12:01:50,900 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-15 12:01:50,901 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-15 12:01:50,902 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-15 12:01:50,902 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-15 12:01:50,904 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-15 12:01:50,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {480#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {480#false} is VALID
[2022-04-15 12:01:50,904 INFO L272 TraceCheckUtils]: 21: Hoare triple {480#false} call __VERIFIER_assert(#t~ret9); {480#false} is VALID
[2022-04-15 12:01:50,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {480#false} ~cond := #in~cond; {480#false} is VALID
[2022-04-15 12:01:50,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {480#false} assume 0 == ~cond; {480#false} is VALID
[2022-04-15 12:01:50,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {480#false} assume !false; {480#false} is VALID
[2022-04-15 12:01:50,905 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-15 12:01:50,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 12:01:50,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981750677]
[2022-04-15 12:01:50,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981750677] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:50,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:50,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 12:01:50,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 12:01:50,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1234026999]
[2022-04-15 12:01:50,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1234026999] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:50,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:50,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 12:01:50,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462063917]
[2022-04-15 12:01:50,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 12:01:50,908 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-15 12:01:50,908 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 12:01:50,908 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-15 12:01:50,940 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-15 12:01:50,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-15 12:01:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-15 12:01:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-04-15 12:01:50,942 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-15 12:01:55,529 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-15 12:01:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:56,317 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions.
[2022-04-15 12:01:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-15 12:01:56,318 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-15 12:01:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 12:01:56,318 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-15 12:01:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions.
[2022-04-15 12:01:56,320 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-15 12:01:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions.
[2022-04-15 12:01:56,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions.
[2022-04-15 12:01:56,380 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-15 12:01:56,381 INFO L225 Difference]: With dead ends: 40
[2022-04-15 12:01:56,381 INFO L226 Difference]: Without dead ends: 31
[2022-04-15 12:01:56,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240
[2022-04-15 12:01:56,383 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-04-15 12:01:56,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time]
[2022-04-15 12:01:56,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-04-15 12:01:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30.
[2022-04-15 12:01:56,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 12:01:56,444 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-15 12:01:56,446 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-15 12:01:56,446 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-15 12:01:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:56,448 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions.
[2022-04-15 12:01:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions.
[2022-04-15 12:01:56,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:56,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:56,449 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-15 12:01:56,449 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-15 12:01:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:56,450 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions.
[2022-04-15 12:01:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions.
[2022-04-15 12:01:56,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:56,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:56,463 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 12:01:56,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 12:01:56,467 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-15 12:01:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions.
[2022-04-15 12:01:56,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25
[2022-04-15 12:01:56,469 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 12:01:56,469 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions.
[2022-04-15 12:01:56,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-15 12:01:56,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions.
[2022-04-15 12:01:56,545 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-15 12:01:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2022-04-15 12:01:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-15 12:01:56,549 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 12:01:56,549 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 12:01:56,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-15 12:01:56,550 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 12:01:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 12:01:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times
[2022-04-15 12:01:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:56,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344335713]
[2022-04-15 12:01:56,565 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays.
[2022-04-15 12:01:56,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 12:01:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 2 times
[2022-04-15 12:01:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 12:01:56,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906036316]
[2022-04-15 12:01:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 12:01:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 12:01:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 12:01:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:56,800 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-15 12:01:56,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID
[2022-04-15 12:01:56,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #72#return; {721#true} is VALID
[2022-04-15 12:01:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-15 12:01:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:56,817 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-15 12:01:56,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID
[2022-04-15 12:01:56,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #66#return; {721#true} is VALID
[2022-04-15 12:01:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-15 12:01:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:56,942 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-15 12:01:56,951 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-15 12:01:56,968 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-15 12:01:56,969 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-15 12:01:56,970 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-15 12:01:56,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {722#false} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {722#false} is VALID
[2022-04-15 12:01:56,970 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-15 12:01:56,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {722#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {722#false} is VALID
[2022-04-15 12:01:56,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {722#false} is VALID
[2022-04-15 12:01:56,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#false} assume true; {722#false} is VALID
[2022-04-15 12:01:56,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {722#false} {721#true} #68#return; {722#false} is VALID
[2022-04-15 12:01:56,972 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-15 12:01:56,972 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-15 12:01:56,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {721#true} assume true; {721#true} is VALID
[2022-04-15 12:01:56,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {721#true} {721#true} #72#return; {721#true} is VALID
[2022-04-15 12:01:56,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {721#true} call #t~ret10 := main(); {721#true} is VALID
[2022-04-15 12:01:56,973 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-15 12:01:56,973 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-15 12:01:56,974 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-15 12:01:56,974 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-15 12:01:56,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#true} assume true; {721#true} is VALID
[2022-04-15 12:01:56,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {721#true} {721#true} #66#return; {721#true} is VALID
[2022-04-15 12:01:56,975 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-15 12:01:56,975 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-15 12:01:56,975 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-15 12:01:56,976 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-15 12:01:56,976 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-15 12:01:56,977 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-15 12:01:56,978 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-15 12:01:56,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {722#false} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {722#false} is VALID
[2022-04-15 12:01:56,978 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-15 12:01:56,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {722#false} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {722#false} assume true; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {722#false} {721#true} #68#return; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {722#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L272 TraceCheckUtils]: 25: Hoare triple {722#false} call __VERIFIER_assert(#t~ret9); {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {722#false} ~cond := #in~cond; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {722#false} assume 0 == ~cond; {722#false} is VALID
[2022-04-15 12:01:56,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {722#false} assume !false; {722#false} is VALID
[2022-04-15 12:01:56,980 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-15 12:01:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 12:01:56,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906036316]
[2022-04-15 12:01:56,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906036316] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:56,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:56,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 12:01:56,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 12:01:56,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344335713]
[2022-04-15 12:01:56,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344335713] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 12:01:56,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 12:01:56,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-15 12:01:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926856957]
[2022-04-15 12:01:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 12:01:56,982 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-15 12:01:56,982 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 12:01:56,982 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-15 12:01:57,024 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-15 12:01:57,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-15 12:01:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-15 12:01:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2022-04-15 12:01:57,026 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-15 12:01:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:57,491 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions.
[2022-04-15 12:01:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-15 12:01:57,492 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-15 12:01:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 12:01:57,492 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-15 12:01:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions.
[2022-04-15 12:01:57,494 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-15 12:01:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions.
[2022-04-15 12:01:57,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions.
[2022-04-15 12:01:57,588 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-15 12:01:57,589 INFO L225 Difference]: With dead ends: 50
[2022-04-15 12:01:57,589 INFO L226 Difference]: Without dead ends: 37
[2022-04-15 12:01:57,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2022-04-15 12:01:57,590 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-15 12:01:57,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-15 12:01:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2022-04-15 12:01:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31.
[2022-04-15 12:01:57,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 12:01:57,651 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-15 12:01:57,651 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-15 12:01:57,651 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-15 12:01:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:57,669 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions.
[2022-04-15 12:01:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions.
[2022-04-15 12:01:57,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:57,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:57,670 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-15 12:01:57,671 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-15 12:01:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 12:01:57,674 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions.
[2022-04-15 12:01:57,674 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions.
[2022-04-15 12:01:57,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 12:01:57,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 12:01:57,675 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 12:01:57,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 12:01:57,675 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-15 12:01:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions.
[2022-04-15 12:01:57,679 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29
[2022-04-15 12:01:57,681 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 12:01:57,681 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions.
[2022-04-15 12:01:57,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-15 12:01:57,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions.
[2022-04-15 12:01:57,749 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-15 12:01:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions.
[2022-04-15 12:01:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-15 12:01:57,751 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 12:01:57,752 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 12:01:57,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-04-15 12:01:57,752 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 12:01:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 12:01:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 291267457, now seen corresponding path program 1 times
[2022-04-15 12:01:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 12:01:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306426173]
[2022-04-15 12:01:57,757 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays.
[2022-04-15 12:01:57,757 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 12:01:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash 291267457, now seen corresponding path program 2 times
[2022-04-15 12:01:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 12:01:57,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258451136]
[2022-04-15 12:01:57,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 12:01:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 12:01:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:57,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-15 12:01:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:57,907 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-15 12:01:57,908 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-15 12:01:57,909 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-15 12:01:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-15 12:01:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:57,925 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-15 12:01:57,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#true} assume true; {989#true} is VALID
[2022-04-15 12:01:57,926 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-15 12:01:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-15 12:01:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 12:01:58,222 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-15 12:01:58,224 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-15 12:01:58,224 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-15 12:01:58,225 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-15 12:01:58,226 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-15 12:01:58,227 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-15 12:01:58,228 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-15 12:01:58,229 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-15 12:01:58,230 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-15 12:01:58,231 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-15 12:01:58,232 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-15 12:01:58,233 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-15 12:01:58,233 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-15 12:01:58,234 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-15 12:01:58,236 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-15 12:01:58,236 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-15 12:01:58,237 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-15 12:01:58,238 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-15 12:01:58,247 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-15 12:01:58,247 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-15 12:01:58,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {989#true} assume true; {989#true} is VALID
[2022-04-15 12:01:58,248 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-15 12:01:58,249 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-15 12:01:58,249 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-15 12:01:58,249 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-15 12:01:58,250 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-15 12:01:58,251 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-15 12:01:58,252 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-15 12:01:58,253 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-15 12:01:58,254 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-15 12:01:58,254 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-15 12:01:58,255 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-15 12:01:58,256 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-15 12:01:58,256 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-15 12:01:58,257 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-15 12:01:58,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {990#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {990#false} is VALID
[2022-04-15 12:01:58,258 INFO L272 TraceCheckUtils]: 25: Hoare triple {990#false} call __VERIFIER_assert(#t~ret9); {990#false} is VALID
[2022-04-15 12:01:58,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {990#false} ~cond := #in~cond; {990#false} is VALID
[2022-04-15 12:01:58,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {990#false} assume 0 == ~cond; {990#false} is VALID
[2022-04-15 12:01:58,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {990#false} assume !false; {990#false} is VALID
[2022-04-15 12:01:58,258 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-15 12:01:58,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 12:01:58,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258451136]
[2022-04-15 12:01:58,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258451136] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-15 12:01:58,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608675362]
[2022-04-15 12:01:58,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 12:01:58,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 12:01:58,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 12:01:58,271 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-15 12:01:58,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process