/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-crafted-1/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:59:08,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:59:08,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:59:08,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:59:08,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:59:08,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:59:08,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:59:08,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:59:08,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:59:08,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:59:08,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:59:08,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:59:08,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:59:08,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:59:08,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:59:09,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:59:09,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:59:09,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:59:09,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:59:09,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:59:09,017 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:59:09,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:59:09,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:59:09,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:59:09,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:59:09,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:59:09,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:59:09,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:59:09,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:59:09,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:59:09,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:59:09,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:59:09,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:59:09,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:59:09,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:59:09,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:59:09,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:59:09,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:59:09,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:59:09,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:59:09,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:59:09,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:59:09,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:59:09,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:59:09,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:59:09,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:59:09,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:59:09,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:59:09,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:59:09,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:59:09,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:59:09,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:59:09,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:59:09,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:59:09,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:59:09,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:59:09,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:59:09,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:59:09,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:59:09,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:59:09,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:59:09,063 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:59:09,063 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:59:09,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:59:09,063 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:59:09,063 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-08 09:59:09,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:59:09,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:59:09,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:59:09,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:59:09,313 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:59:09,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-08 09:59:09,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439f2b4a9/f0e1b19dbed24a70b3b7aeddb8880dfe/FLAG9d517e57f [2022-04-08 09:59:09,788 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:59:09,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-08 09:59:09,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439f2b4a9/f0e1b19dbed24a70b3b7aeddb8880dfe/FLAG9d517e57f [2022-04-08 09:59:09,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439f2b4a9/f0e1b19dbed24a70b3b7aeddb8880dfe [2022-04-08 09:59:09,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:59:09,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:59:09,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:59:09,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:59:09,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:59:09,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:59:09" (1/1) ... [2022-04-08 09:59:09,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f2ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:09, skipping insertion in model container [2022-04-08 09:59:09,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:59:09" (1/1) ... [2022-04-08 09:59:09,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:59:09,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:59:09,988 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-crafted-1/iftelse.c[406,419] [2022-04-08 09:59:10,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:59:10,007 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:59:10,017 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-crafted-1/iftelse.c[406,419] [2022-04-08 09:59:10,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:59:10,033 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:59:10,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10 WrapperNode [2022-04-08 09:59:10,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:59:10,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:59:10,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:59:10,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:59:10,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:59:10,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:59:10,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:59:10,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:59:10,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (1/1) ... [2022-04-08 09:59:10,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:59:10,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:59:10,102 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-08 09:59:10,106 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-08 09:59:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:59:10,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:59:10,132 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:59:10,132 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:59:10,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:59:10,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:59:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:59:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:59:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:59:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:59:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:59:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:59:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:59:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:59:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:59:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:59:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:59:10,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:59:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:59:10,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:59:10,187 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:59:10,189 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:59:10,348 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:59:10,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:59:10,355 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:59:10,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:59:10 BoogieIcfgContainer [2022-04-08 09:59:10,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:59:10,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:59:10,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:59:10,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:59:10,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:59:09" (1/3) ... [2022-04-08 09:59:10,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39adaccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:59:10, skipping insertion in model container [2022-04-08 09:59:10,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:59:10" (2/3) ... [2022-04-08 09:59:10,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39adaccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:59:10, skipping insertion in model container [2022-04-08 09:59:10,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:59:10" (3/3) ... [2022-04-08 09:59:10,372 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2022-04-08 09:59:10,376 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:59:10,376 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:59:10,457 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:59:10,463 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-08 09:59:10,463 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:59:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:59:10,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:59:10,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:59:10,501 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:59:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:59:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 1 times [2022-04-08 09:59:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:59:10,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [110830178] [2022-04-08 09:59:10,547 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:59:10,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 2 times [2022-04-08 09:59:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:59:10,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462585768] [2022-04-08 09:59:10,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:59:10,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:59:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:59:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:59:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:59:11,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-08 09:59:11,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:59:11,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 09:59:11,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:59:11,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |old(~SIZE~0)| ~SIZE~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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-08 09:59:11,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:59:11,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 09:59:11,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-08 09:59:11,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-08 09:59:11,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {30#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 09:59:11,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(and (= main_~j~0 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 09:59:11,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-08 09:59:11,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} assume ~n~0 % 4294967296 > 0; {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-08 09:59:11,227 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:59:11,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:59:11,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-08 09:59:11,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 09:59:11,229 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-08 09:59:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:59:11,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462585768] [2022-04-08 09:59:11,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462585768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:59:11,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:59:11,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:59:11,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:59:11,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [110830178] [2022-04-08 09:59:11,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [110830178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:59:11,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:59:11,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:59:11,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679453052] [2022-04-08 09:59:11,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:59:11,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:59:11,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:59:11,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:11,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:59:11,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:59:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:59:11,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:59:11,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:59:11,280 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:13,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:15,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:17,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:20,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:24,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:26,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:28,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:30,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:32,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:59:32,691 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-08 09:59:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:59:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 09:59:32,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:59:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-08 09:59:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-08 09:59:32,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2022-04-08 09:59:32,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:59:32,901 INFO L225 Difference]: With dead ends: 53 [2022-04-08 09:59:32,901 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 09:59:32,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 09:59:32,912 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-04-08 09:59:32,913 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 8 Unknown, 0 Unchecked, 18.8s Time] [2022-04-08 09:59:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 09:59:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-08 09:59:32,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:59:32,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:32,956 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:32,957 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:59:32,968 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 09:59:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 09:59:32,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:59:32,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:59:32,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 09:59:32,971 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 09:59:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:59:32,975 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 09:59:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 09:59:32,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:59:32,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:59:32,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:59:32,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:59:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 09:59:32,986 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-08 09:59:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:59:32,986 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 09:59:32,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:32,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 09:59:33,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:59:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 09:59:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:59:33,033 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:59:33,033 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:59:33,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:59:33,033 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:59:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:59:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 1 times [2022-04-08 09:59:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:59:33,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183949557] [2022-04-08 09:59:33,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:59:33,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:59:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 2 times [2022-04-08 09:59:33,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:59:33,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789182794] [2022-04-08 09:59:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:59:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:59:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:59:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:59:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:59:33,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(and (= |old(~SIZE~0)| ~SIZE~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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {260#true} is VALID [2022-04-08 09:59:33,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-08 09:59:33,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #61#return; {260#true} is VALID [2022-04-08 09:59:33,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {266#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:59:33,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#(and (= |old(~SIZE~0)| ~SIZE~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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {260#true} is VALID [2022-04-08 09:59:33,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-08 09:59:33,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #61#return; {260#true} is VALID [2022-04-08 09:59:33,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret5 := main(); {260#true} is VALID [2022-04-08 09:59:33,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {260#true} is VALID [2022-04-08 09:59:33,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {260#true} is VALID [2022-04-08 09:59:33,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {260#true} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {260#true} is VALID [2022-04-08 09:59:33,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#true} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {260#true} is VALID [2022-04-08 09:59:33,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#true} assume !(~n~0 % 4294967296 > 0); {265#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-08 09:59:33,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {265#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {265#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-08 09:59:33,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {265#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-08 09:59:33,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} assume ~n~0 % 4294967296 > 0; {261#false} is VALID [2022-04-08 09:59:33,129 INFO L272 TraceCheckUtils]: 13: Hoare triple {261#false} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {261#false} is VALID [2022-04-08 09:59:33,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2022-04-08 09:59:33,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#false} assume 0 == ~cond; {261#false} is VALID [2022-04-08 09:59:33,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-04-08 09:59:33,130 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-08 09:59:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:59:33,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789182794] [2022-04-08 09:59:33,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789182794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:59:33,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:59:33,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:59:33,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:59:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183949557] [2022-04-08 09:59:33,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183949557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:59:33,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:59:33,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:59:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902746835] [2022-04-08 09:59:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:59:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:59:33,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:59:33,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:33,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:59:33,150 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:59:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:59:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:59:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:59:33,151 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:37,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:39,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 09:59:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:59:39,530 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 09:59:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:59:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:59:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:59:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 09:59:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 09:59:39,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-08 09:59:39,578 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-08 09:59:39,580 INFO L225 Difference]: With dead ends: 36 [2022-04-08 09:59:39,581 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:59:39,581 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 09:59:39,584 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:59:39,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 09:59:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:59:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 09:59:39,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:59:39,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:39,603 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:39,604 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:59:39,607 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-08 09:59:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 09:59:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:59:39,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:59:39,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 09:59:39,609 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 09:59:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:59:39,615 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-08 09:59:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 09:59:39,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:59:39,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:59:39,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:59:39,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:59:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:59:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-08 09:59:39,621 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2022-04-08 09:59:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:59:39,621 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-08 09:59:39,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:59:39,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-08 09:59:39,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:59:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-08 09:59:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:59:39,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:59:39,660 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:59:39,660 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:59:39,660 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:59:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:59:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 1 times [2022-04-08 09:59:39,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:59:39,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256477463] [2022-04-08 10:00:34,633 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:00:34,633 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:00:34,633 INFO L85 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 2 times [2022-04-08 10:00:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:00:34,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756324524] [2022-04-08 10:00:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:00:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:00:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:00:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:00:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:00:34,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#(and (= |old(~SIZE~0)| ~SIZE~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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {443#true} is VALID [2022-04-08 10:00:34,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#true} assume true; {443#true} is VALID [2022-04-08 10:00:34,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {443#true} {443#true} #61#return; {443#true} is VALID [2022-04-08 10:00:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 10:00:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:00:34,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {443#true} ~cond := #in~cond; {443#true} is VALID [2022-04-08 10:00:34,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#true} assume !(0 == ~cond); {443#true} is VALID [2022-04-08 10:00:34,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {443#true} assume true; {443#true} is VALID [2022-04-08 10:00:34,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {443#true} {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #59#return; {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:00:34,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {443#true} call ULTIMATE.init(); {455#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:00:34,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#(and (= |old(~SIZE~0)| ~SIZE~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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {443#true} is VALID [2022-04-08 10:00:34,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {443#true} assume true; {443#true} is VALID [2022-04-08 10:00:34,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {443#true} {443#true} #61#return; {443#true} is VALID [2022-04-08 10:00:34,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {443#true} call #t~ret5 := main(); {443#true} is VALID [2022-04-08 10:00:34,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {443#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {443#true} is VALID [2022-04-08 10:00:34,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {448#(= main_~i~0 0)} is VALID [2022-04-08 10:00:34,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {448#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:00:34,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:00:34,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume ~n~0 % 4294967296 > 0; {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:00:34,759 INFO L272 TraceCheckUtils]: 10: Hoare triple {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {443#true} is VALID [2022-04-08 10:00:34,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {443#true} ~cond := #in~cond; {443#true} is VALID [2022-04-08 10:00:34,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {443#true} assume !(0 == ~cond); {443#true} is VALID [2022-04-08 10:00:34,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#true} assume true; {443#true} is VALID [2022-04-08 10:00:34,760 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {443#true} {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #59#return; {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 10:00:34,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {449#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {454#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 6 main_~i~0))} is VALID [2022-04-08 10:00:34,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#(and (<= main_~i~0 (* (div main_~i~0 2) 2)) (<= 6 main_~i~0))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {444#false} is VALID [2022-04-08 10:00:34,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {444#false} assume ~n~0 % 4294967296 > 0; {444#false} is VALID [2022-04-08 10:00:34,762 INFO L272 TraceCheckUtils]: 18: Hoare triple {444#false} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {444#false} is VALID [2022-04-08 10:00:34,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {444#false} ~cond := #in~cond; {444#false} is VALID [2022-04-08 10:00:34,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {444#false} assume 0 == ~cond; {444#false} is VALID [2022-04-08 10:00:34,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {444#false} assume !false; {444#false} is VALID [2022-04-08 10:00:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:00:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:00:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756324524] [2022-04-08 10:00:34,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756324524] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:00:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979580010] [2022-04-08 10:00:34,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:00:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:00:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:00:34,771 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-08 10:00:34,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process