/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:37:03,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:37:03,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:37:03,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:37:03,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:37:03,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:37:03,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:37:03,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:37:03,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:37:03,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:37:03,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:37:03,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:37:03,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:37:03,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:37:03,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:37:03,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:37:03,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:37:03,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:37:03,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:37:03,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:37:03,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:37:03,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:37:03,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:37:03,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:37:03,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:37:03,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:37:03,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:37:03,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:37:03,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:37:03,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:37:03,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:37:03,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:37:03,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:37:03,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:37:03,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:37:03,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:37:03,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:37:03,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:37:03,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:37:03,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:37:03,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:37:03,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:37:03,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:37:03,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:37:03,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:37:03,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:37:03,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:37:03,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:37:03,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:37:03,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:37:03,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:37:03,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:37:03,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:37:03,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:37:03,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:37:03,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:37:03,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:37:03,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:37:03,984 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:37:03,984 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-01-31 20:37:04,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:37:04,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:37:04,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:37:04,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:37:04,191 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:37:04,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch.c [2022-01-31 20:37:04,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb5f5bdf/a2d1766d33a54b52a499a08ed2fd4498/FLAGbd92b0460 [2022-01-31 20:37:04,555 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:37:04,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-01-31 20:37:04,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb5f5bdf/a2d1766d33a54b52a499a08ed2fd4498/FLAGbd92b0460 [2022-01-31 20:37:04,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fb5f5bdf/a2d1766d33a54b52a499a08ed2fd4498 [2022-01-31 20:37:04,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:37:04,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:37:04,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:37:04,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:37:05,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:37:05,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:37:04" (1/1) ... [2022-01-31 20:37:05,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646be534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05, skipping insertion in model container [2022-01-31 20:37:05,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:37:04" (1/1) ... [2022-01-31 20:37:05,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:37:05,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:37:05,128 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_sea.ch.c[383,396] [2022-01-31 20:37:05,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:37:05,146 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:37:05,163 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_sea.ch.c[383,396] [2022-01-31 20:37:05,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:37:05,195 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:37:05,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05 WrapperNode [2022-01-31 20:37:05,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:37:05,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:37:05,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:37:05,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:37:05,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:37:05,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:37:05,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:37:05,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:37:05,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (1/1) ... [2022-01-31 20:37:05,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:37:05,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:37:05,276 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-01-31 20:37:05,277 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-01-31 20:37:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:37:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:37:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:37:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:37:05,306 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-01-31 20:37:05,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:37:05,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-01-31 20:37:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:37:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:37:05,307 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:37:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:37:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-01-31 20:37:05,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:37:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 20:37:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-01-31 20:37:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:37:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:37:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-31 20:37:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-01-31 20:37:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:37:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:37:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:37:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:37:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:37:05,379 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:37:05,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:37:05,492 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:37:05,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:37:05,497 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 20:37:05,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:37:05 BoogieIcfgContainer [2022-01-31 20:37:05,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:37:05,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:37:05,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:37:05,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:37:05,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:37:04" (1/3) ... [2022-01-31 20:37:05,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d8dfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:37:05, skipping insertion in model container [2022-01-31 20:37:05,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:37:05" (2/3) ... [2022-01-31 20:37:05,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d8dfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:37:05, skipping insertion in model container [2022-01-31 20:37:05,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:37:05" (3/3) ... [2022-01-31 20:37:05,524 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2022-01-31 20:37:05,528 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:37:05,529 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:37:05,599 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:37:05,605 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:37:05,605 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:37:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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-01-31 20:37:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-31 20:37:05,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:37:05,646 INFO L514 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-01-31 20:37:05,646 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:37:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:37:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 1 times [2022-01-31 20:37:05,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:37:05,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905399816] [2022-01-31 20:37:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:37:05,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:37:05,700 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:37:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:05,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:37:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 20:37:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:05,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:37:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:37:05,897 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:37:05,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905399816] [2022-01-31 20:37:05,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [905399816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:37:05,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:37:05,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 20:37:05,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887441539] [2022-01-31 20:37:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:37:05,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 20:37:05,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:37:05,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 20:37:05,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 20:37:05,939 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 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-01-31 20:37:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:37:06,062 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-01-31 20:37:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 20:37:06,064 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-01-31 20:37:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:37:06,073 INFO L225 Difference]: With dead ends: 51 [2022-01-31 20:37:06,073 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 20:37:06,076 INFO L932 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-01-31 20:37:06,079 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 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-01-31 20:37:06,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:37:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 20:37:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 20:37:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-01-31 20:37:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-31 20:37:06,114 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-01-31 20:37:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:37:06,115 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-31 20:37:06,115 INFO L471 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-01-31 20:37:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-31 20:37:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 20:37:06,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:37:06,116 INFO L514 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-01-31 20:37:06,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:37:06,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:37:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:37:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 1 times [2022-01-31 20:37:06,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:37:06,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774746650] [2022-01-31 20:37:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:37:06,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:37:06,121 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:37:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:37:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 20:37:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:37:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:37:06,282 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:37:06,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774746650] [2022-01-31 20:37:06,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [774746650] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:37:06,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:37:06,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:37:06,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605772106] [2022-01-31 20:37:06,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:37:06,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:37:06,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:37:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:37:06,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:37:06,285 INFO L87 Difference]: Start difference. First operand 26 states and 28 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-01-31 20:37:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:37:06,444 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-01-31 20:37:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:37:06,444 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-01-31 20:37:06,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:37:06,447 INFO L225 Difference]: With dead ends: 34 [2022-01-31 20:37:06,447 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 20:37:06,449 INFO L932 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-01-31 20:37:06,450 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:37:06,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:37:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 20:37:06,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-31 20:37:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-01-31 20:37:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-01-31 20:37:06,467 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-01-31 20:37:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:37:06,468 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-01-31 20:37:06,468 INFO L471 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-01-31 20:37:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-01-31 20:37:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 20:37:06,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:37:06,469 INFO L514 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-01-31 20:37:06,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:37:06,469 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:37:06,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:37:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 1 times [2022-01-31 20:37:06,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:37:06,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92986206] [2022-01-31 20:37:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:37:06,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:37:06,472 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:37:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:37:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 20:37:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:37:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:37:06,715 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:37:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92986206] [2022-01-31 20:37:06,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [92986206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:37:06,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:37:06,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:37:06,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112087910] [2022-01-31 20:37:06,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:37:06,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:37:06,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:37:06,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:37:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:37:06,721 INFO L87 Difference]: Start difference. First operand 26 states and 27 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-01-31 20:37:08,833 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-01-31 20:37:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:37:09,106 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-01-31 20:37:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 20:37:09,106 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-01-31 20:37:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:37:09,107 INFO L225 Difference]: With dead ends: 39 [2022-01-31 20:37:09,107 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 20:37:09,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:37:09,109 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:37:09,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 20:37:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 20:37:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-01-31 20:37:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-01-31 20:37:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 20:37:09,120 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-01-31 20:37:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:37:09,121 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 20:37:09,121 INFO L471 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-01-31 20:37:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 20:37:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 20:37:09,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:37:09,122 INFO L514 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] [2022-01-31 20:37:09,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:37:09,122 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:37:09,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:37:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -238208460, now seen corresponding path program 1 times [2022-01-31 20:37:09,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:37:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768531082] [2022-01-31 20:37:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:37:10,060 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:37:10,061 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:37:10,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:37:10,095 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_13 (* (- 4294967296) .aux_div_v_it_1_50.1) (- .aux_mod_v_it_1_50.0) 1) 0)) [2022-01-31 20:37:10,095 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.1) .aux_mod_v_it_1_50.0 (- linear_search_~j~0_14) 1) 0)) [2022-01-31 20:37:10,095 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_1_50.0) (* (- 17179869184) (div .aux_mod_v_it_1_50.0 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-01-31 20:37:10,098 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_13 (* (- 4294967296) .aux_div_v_it_1_50.3) (- .aux_mod_v_it_1_50.2) 1) 0)) [2022-01-31 20:37:10,099 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.3) .aux_mod_v_it_1_50.2 (- linear_search_~j~0_14) 1) 0)) [2022-01-31 20:37:10,099 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_1_50.2) (* (- 17179869184) (div .aux_mod_v_it_1_50.2 4294967296)) linear_search_~a.offset_13)))) [2022-01-31 20:37:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:10,189 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_13 (* (- 4294967296) .aux_div_v_it_1_50.10) (- .aux_mod_v_it_1_50.9) 1) 0)) [2022-01-31 20:37:10,190 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.10) .aux_mod_v_it_1_50.9 (- linear_search_~j~0_14) 1) 0)) [2022-01-31 20:37:10,190 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_1_50.9) (* (- 17179869184) (div .aux_mod_v_it_1_50.9 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-01-31 20:37:10,191 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_13 (* (- 4294967296) .aux_div_v_it_1_50.12) (- .aux_mod_v_it_1_50.11) 1) 0)) [2022-01-31 20:37:10,191 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.12) .aux_mod_v_it_1_50.11 (- linear_search_~j~0_14) 1) 0)) [2022-01-31 20:37:10,191 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_1_50.11) (* (- 17179869184) (div .aux_mod_v_it_1_50.11 4294967296)) linear_search_~a.offset_13)))) [2022-01-31 20:37:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:37:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 20:37:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:10,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:37:10,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_0 (* (- 4294967296) .aux_div_v_it_1_50.15) (- .aux_mod_v_it_1_50.14) 1) 0)) [2022-01-31 20:37:10,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.15) .aux_mod_v_it_1_50.14 (- linear_search_~j~0_1) 1) 0)) [2022-01-31 20:37:10,443 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_1_50.14) (* (- 17179869184) (div .aux_mod_v_it_1_50.14 4294967296)) linear_search_~a.offset_0 (- 17179869184))))) [2022-01-31 20:37:10,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_0 (* (- 4294967296) .aux_div_v_it_1_50.17) (- .aux_mod_v_it_1_50.16) 1) 0)) [2022-01-31 20:37:10,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.17) .aux_mod_v_it_1_50.16 (- linear_search_~j~0_1) 1) 0)) [2022-01-31 20:37:10,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_1_50.16) (* (- 17179869184) (div .aux_mod_v_it_1_50.16 4294967296)) linear_search_~a.offset_0)))) [2022-01-31 20:37:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:37:10,466 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_0 (* (- 4294967296) .aux_div_v_it_1_50.31) (- .aux_mod_v_it_1_50.30) 1) 0)) [2022-01-31 20:37:10,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.31) .aux_mod_v_it_1_50.30 (- linear_search_~j~0_1) 1) 0)) [2022-01-31 20:37:10,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_1_50.30) (* (- 17179869184) (div .aux_mod_v_it_1_50.30 4294967296)) linear_search_~a.offset_0 (- 17179869184))))) [2022-01-31 20:37:10,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_0 (* (- 4294967296) .aux_div_v_it_1_50.33) (- .aux_mod_v_it_1_50.32) 1) 0)) [2022-01-31 20:37:10,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_1_50.33) .aux_mod_v_it_1_50.32 (- linear_search_~j~0_1) 1) 0)) [2022-01-31 20:37:10,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_0 (select (select |#memory_int_-2| linear_search_~a.base_0) (+ (* 4 .aux_mod_v_it_1_50.32) (* (- 17179869184) (div .aux_mod_v_it_1_50.32 4294967296)) linear_search_~a.offset_0)))) [2022-01-31 20:37:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:37:11,704 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:37:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768531082] [2022-01-31 20:37:11,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [768531082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:37:11,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:37:11,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 20:37:11,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71097185] [2022-01-31 20:37:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:37:11,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 20:37:11,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:37:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 20:37:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-01-31 20:37:11,707 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:37:13,774 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-01-31 20:37:15,996 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-01-31 20:37:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:37:16,924 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-01-31 20:37:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 20:37:16,925 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-01-31 20:37:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:37:16,926 INFO L225 Difference]: With dead ends: 41 [2022-01-31 20:37:16,926 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 20:37:16,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-01-31 20:37:16,927 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-01-31 20:37:16,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 52 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 226 Invalid, 2 Unknown, 19 Unchecked, 4.6s Time] [2022-01-31 20:37:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 20:37:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-01-31 20:37:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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-01-31 20:37:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-01-31 20:37:16,937 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 28 [2022-01-31 20:37:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:37:16,937 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-01-31 20:37:16,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:37:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-01-31 20:37:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 20:37:16,938 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:37:16,939 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:37:16,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:37:16,939 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:37:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:37:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -631235470, now seen corresponding path program 1 times [2022-01-31 20:37:16,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:37:16,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [588441412] [2022-01-31 20:37:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:37:17,515 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:37:17,515 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:37:17,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:37:17,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_13 (* (- 4294967296) .aux_div_v_it_2_51.0) (- .aux_mod_v_it_2_51.1) 1) 0)) [2022-01-31 20:37:17,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= linear_search_~q_13 (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_2_51.1) (* (- 17179869184) (div .aux_mod_v_it_2_51.1 4294967296)) linear_search_~a.offset_13 (- 17179869184))))) [2022-01-31 20:37:17,526 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_2_51.0) .aux_mod_v_it_2_51.1 (- linear_search_~j~0_14) 1) 0)) [2022-01-31 20:37:17,527 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ linear_search_~j~0_13 (* (- 4294967296) .aux_div_v_it_2_51.2) (- .aux_mod_v_it_2_51.3) 1) 0)) [2022-01-31 20:37:17,527 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= (select (select |#memory_int_11| linear_search_~a.base_13) (+ (* 4 .aux_mod_v_it_2_51.3) (* (- 17179869184) (div .aux_mod_v_it_2_51.3 4294967296)) linear_search_~a.offset_13)) linear_search_~q_13)) [2022-01-31 20:37:17,527 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* 4294967296 .aux_div_v_it_2_51.2) .aux_mod_v_it_2_51.3 (- linear_search_~j~0_14) 1) 0)) [2022-01-31 20:37:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-01-31 20:37:17,551 WARN L127 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2022-01-31 20:37:17,552 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2022-01-31 20:37:17,556 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:37:17,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:37:17,560 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-31 20:37:17,562 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:37:17,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:37:17 BoogieIcfgContainer [2022-01-31 20:37:17,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:37:17,573 INFO L158 Benchmark]: Toolchain (without parser) took 12575.68ms. Allocated memory was 183.5MB in the beginning and 229.6MB in the end (delta: 46.1MB). Free memory was 127.9MB in the beginning and 128.8MB in the end (delta: -906.8kB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2022-01-31 20:37:17,573 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:37:17,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.31ms. Allocated memory was 183.5MB in the beginning and 229.6MB in the end (delta: 46.1MB). Free memory was 127.6MB in the beginning and 203.2MB in the end (delta: -75.6MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-01-31 20:37:17,574 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 229.6MB. Free memory was 203.2MB in the beginning and 201.3MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 20:37:17,574 INFO L158 Benchmark]: RCFGBuilder took 254.26ms. Allocated memory is still 229.6MB. Free memory was 201.3MB in the beginning and 189.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 20:37:17,574 INFO L158 Benchmark]: TraceAbstraction took 12072.45ms. Allocated memory is still 229.6MB. Free memory was 188.7MB in the beginning and 128.8MB in the end (delta: 60.0MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. [2022-01-31 20:37:17,576 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.31ms. Allocated memory was 183.5MB in the beginning and 229.6MB in the end (delta: 46.1MB). Free memory was 127.6MB in the beginning and 203.2MB in the end (delta: -75.6MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 229.6MB. Free memory was 203.2MB in the beginning and 201.3MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.26ms. Allocated memory is still 229.6MB. Free memory was 201.3MB in the beginning and 189.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12072.45ms. Allocated memory is still 229.6MB. Free memory was 188.7MB in the beginning and 128.8MB in the end (delta: 60.0MB). Peak memory consumption was 61.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 8]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L13] unsigned int SIZE; [L14] const unsigned int MAX = 100000; [L24] SIZE=(__VERIFIER_nondet_uint()/8)+1 [L26] COND TRUE SIZE > 1 && SIZE < MAX [L27] EXPR, FCALL calloc(SIZE,sizeof(int)) [L27] int *a = calloc(SIZE,sizeof(int)); [L28] a[SIZE/2]=3 [L29] CALL, EXPR linear_search(a,SIZE,3) [L16] unsigned int j=0; [L17] j