/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/sum03-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:02:22,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:02:22,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:02:22,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:02:22,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:02:22,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:02:22,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:02:22,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:02:22,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:02:22,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:02:22,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:02:22,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:02:22,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:02:22,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:02:22,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:02:22,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:02:22,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:02:22,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:02:22,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:02:22,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:02:22,856 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:02:22,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:02:22,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:02:22,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:02:22,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:02:22,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:02:22,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:02:22,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:02:22,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:02:22,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:02:22,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:02:22,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:02:22,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:02:22,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:02:22,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:02:22,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:02:22,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:02:22,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:02:22,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:02:22,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:02:22,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:02:22,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:02:22,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:02:22,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:02:22,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:02:22,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:02:22,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:02:22,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:02:22,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:02:22,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:02:22,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:02:22,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:02:22,892 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:02:22,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:02:22,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:02:22,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:02:22,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:02:22,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:02:22,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:02:22,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:02:22,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:02:22,893 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:02:22,893 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:02:22,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:02:22,893 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:02:22,893 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:02:23,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:02:23,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:02:23,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:02:23,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:02:23,106 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:02:23,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-2.i [2022-04-28 09:02:23,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74ee4564/b85622000fdf4224bd9fc0c878e3b82a/FLAGe919b0c4f [2022-04-28 09:02:23,509 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:02:23,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-2.i [2022-04-28 09:02:23,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74ee4564/b85622000fdf4224bd9fc0c878e3b82a/FLAGe919b0c4f [2022-04-28 09:02:23,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c74ee4564/b85622000fdf4224bd9fc0c878e3b82a [2022-04-28 09:02:23,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:02:23,530 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:02:23,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:02:23,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:02:23,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:02:23,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fe040b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23, skipping insertion in model container [2022-04-28 09:02:23,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:02:23,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:02:23,723 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/sum03-2.i[807,820] [2022-04-28 09:02:23,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:02:23,745 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:02:23,753 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/sum03-2.i[807,820] [2022-04-28 09:02:23,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:02:23,768 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:02:23,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23 WrapperNode [2022-04-28 09:02:23,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:02:23,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:02:23,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:02:23,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:02:23,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:02:23,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:02:23,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:02:23,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:02:23,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (1/1) ... [2022-04-28 09:02:23,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:02:23,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:23,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 09:02:23,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 09:02:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:02:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:02:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:02:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:02:23,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:02:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:02:23,848 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:02:23,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:02:23,888 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:02:23,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:02:24,017 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:02:24,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:02:24,021 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:02:24,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:02:24 BoogieIcfgContainer [2022-04-28 09:02:24,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:02:24,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:02:24,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:02:24,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:02:24,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:02:23" (1/3) ... [2022-04-28 09:02:24,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b9ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:02:24, skipping insertion in model container [2022-04-28 09:02:24,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:02:23" (2/3) ... [2022-04-28 09:02:24,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b9ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:02:24, skipping insertion in model container [2022-04-28 09:02:24,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:02:24" (3/3) ... [2022-04-28 09:02:24,028 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-2.i [2022-04-28 09:02:24,036 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:02:24,036 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:02:24,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:02:24,072 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4288afbf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20ded4f [2022-04-28 09:02:24,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:02:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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-28 09:02:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:02:24,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:24,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:24,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -107069111, now seen corresponding path program 1 times [2022-04-28 09:02:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249243950] [2022-04-28 09:02:24,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:02:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash -107069111, now seen corresponding path program 2 times [2022-04-28 09:02:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:24,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640081110] [2022-04-28 09:02:24,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:24,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#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); {21#true} is VALID [2022-04-28 09:02:24,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 09:02:24,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #41#return; {21#true} is VALID [2022-04-28 09:02:24,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:24,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#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); {21#true} is VALID [2022-04-28 09:02:24,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 09:02:24,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #41#return; {21#true} is VALID [2022-04-28 09:02:24,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-28 09:02:24,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {26#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:02:24,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-28 09:02:24,613 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:24,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:02:24,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-28 09:02:24,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 09:02:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:02:24,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640081110] [2022-04-28 09:02:24,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640081110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:24,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:24,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:02:24,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249243950] [2022-04-28 09:02:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249243950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:02:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765019273] [2022-04-28 09:02:24,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-28 09:02:24,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:24,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-28 09:02:24,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:24,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:02:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:02:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:02:24,661 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 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 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-28 09:02:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:24,910 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-28 09:02:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:02:24,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-28 09:02:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-28 09:02:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 09:02:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-28 09:02:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-28 09:02:24,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-28 09:02:24,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:24,971 INFO L225 Difference]: With dead ends: 33 [2022-04-28 09:02:24,971 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 09:02:24,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:02:24,975 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:24,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:02:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 09:02:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 09:02:25,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:25,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-28 09:02:25,007 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-28 09:02:25,007 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-28 09:02:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:25,011 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:02:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 09:02:25,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:25,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:25,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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 21 states. [2022-04-28 09:02:25,013 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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 21 states. [2022-04-28 09:02:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:25,015 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:02:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 09:02:25,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:25,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:25,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:25,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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-28 09:02:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 09:02:25,025 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2022-04-28 09:02:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:25,025 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 09:02:25,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-28 09:02:25,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 09:02:25,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 09:02:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:02:25,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:25,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:25,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:02:25,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:25,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:25,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1456105815, now seen corresponding path program 1 times [2022-04-28 09:02:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:25,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [614773869] [2022-04-28 09:02:26,272 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:26,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1456105815, now seen corresponding path program 2 times [2022-04-28 09:02:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480660282] [2022-04-28 09:02:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:26,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |#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); {191#true} is VALID [2022-04-28 09:02:26,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:26,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191#true} {191#true} #41#return; {191#true} is VALID [2022-04-28 09:02:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:02:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:26,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-28 09:02:26,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-28 09:02:26,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:26,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} #39#return; {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:02:26,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {205#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:26,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#(and (= |#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); {191#true} is VALID [2022-04-28 09:02:26,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:26,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #41#return; {191#true} is VALID [2022-04-28 09:02:26,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-28 09:02:26,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:02:26,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:02:26,488 INFO L272 TraceCheckUtils]: 7: Hoare triple {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {191#true} is VALID [2022-04-28 09:02:26,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-28 09:02:26,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-28 09:02:26,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:26,489 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {191#true} {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} #39#return; {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:02:26,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {202#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} is VALID [2022-04-28 09:02:26,492 INFO L272 TraceCheckUtils]: 13: Hoare triple {202#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) 0)) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)) (<= (div (* main_~x~0 2) 4294967296) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {203#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:26,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {203#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {204#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:02:26,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {204#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {192#false} is VALID [2022-04-28 09:02:26,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 09:02:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:02:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:26,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480660282] [2022-04-28 09:02:26,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480660282] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:26,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928226644] [2022-04-28 09:02:26,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:02:26,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:26,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:26,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:02:26,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:02:26,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:02:26,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:26,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:02:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:26,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:26,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-28 09:02:26,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} #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); {191#true} is VALID [2022-04-28 09:02:26,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:26,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #41#return; {191#true} is VALID [2022-04-28 09:02:26,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-28 09:02:26,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {196#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:02:26,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {196#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:02:26,917 INFO L272 TraceCheckUtils]: 7: Hoare triple {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {191#true} is VALID [2022-04-28 09:02:26,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-28 09:02:26,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-28 09:02:26,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:26,921 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {191#true} {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} #39#return; {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} is VALID [2022-04-28 09:02:26,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {197#(and (<= main_~x~0 1) (<= main_~sn~0 (* main_~x~0 2)) (<= 2 main_~sn~0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {245#(and (<= 4 main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)) (<= main_~x~0 2))} is VALID [2022-04-28 09:02:26,923 INFO L272 TraceCheckUtils]: 13: Hoare triple {245#(and (<= 4 main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:02:26,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:26,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-28 09:02:26,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 09:02:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:02:26,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:27,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-04-28 09:02:27,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-04-28 09:02:27,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:27,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {269#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:02:27,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {269#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-28 09:02:27,204 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {191#true} {273#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} #39#return; {273#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-28 09:02:27,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:27,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-04-28 09:02:27,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-04-28 09:02:27,204 INFO L272 TraceCheckUtils]: 7: Hoare triple {273#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {191#true} is VALID [2022-04-28 09:02:27,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {273#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-28 09:02:27,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {292#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} is VALID [2022-04-28 09:02:27,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {191#true} call #t~ret4 := main(); {191#true} is VALID [2022-04-28 09:02:27,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191#true} {191#true} #41#return; {191#true} is VALID [2022-04-28 09:02:27,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume true; {191#true} is VALID [2022-04-28 09:02:27,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} #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); {191#true} is VALID [2022-04-28 09:02:27,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {191#true} call ULTIMATE.init(); {191#true} is VALID [2022-04-28 09:02:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:02:27,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928226644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:27,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:27,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 09:02:27,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:27,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [614773869] [2022-04-28 09:02:27,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [614773869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:27,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:27,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:02:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866918928] [2022-04-28 09:02:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:27,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 09:02:27,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:27,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:27,244 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-28 09:02:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:02:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:02:27,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:02:27,245 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:27,450 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 09:02:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:02:27,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 09:02:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 09:02:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 09:02:27,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-28 09:02:27,483 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-28 09:02:27,484 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:02:27,484 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 09:02:27,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:02:27,486 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:27,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 37 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:02:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 09:02:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 09:02:27,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:27,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:27,501 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:27,502 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:27,503 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:02:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:02:27,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:27,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:27,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 09:02:27,504 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 09:02:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:27,505 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 09:02:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 09:02:27,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:27,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:27,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:27,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:02:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 09:02:27,506 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2022-04-28 09:02:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:27,507 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 09:02:27,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:27,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 09:02:27,536 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-28 09:02:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 09:02:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 09:02:27,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:02:27,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:02:27,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:02:27,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:27,738 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:02:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:02:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1401906185, now seen corresponding path program 3 times [2022-04-28 09:02:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:27,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1723871916] [2022-04-28 09:02:28,149 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:02:28,150 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:02:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1401906185, now seen corresponding path program 4 times [2022-04-28 09:02:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:02:28,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737737088] [2022-04-28 09:02:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:02:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:02:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:02:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:28,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= |#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); {490#true} is VALID [2022-04-28 09:02:28,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {490#true} {490#true} #41#return; {490#true} is VALID [2022-04-28 09:02:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 09:02:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:28,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #39#return; {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:02:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-28 09:02:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:28,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #39#return; {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:02:28,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:02:28,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= |#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); {490#true} is VALID [2022-04-28 09:02:28,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #41#return; {490#true} is VALID [2022-04-28 09:02:28,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret4 := main(); {490#true} is VALID [2022-04-28 09:02:28,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {490#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {495#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:02:28,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:02:28,309 INFO L272 TraceCheckUtils]: 7: Hoare triple {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {490#true} is VALID [2022-04-28 09:02:28,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,310 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {490#true} {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #39#return; {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:02:28,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:02:28,311 INFO L272 TraceCheckUtils]: 13: Hoare triple {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {490#true} is VALID [2022-04-28 09:02:28,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,312 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {490#true} {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} #39#return; {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-28 09:02:28,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {496#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {505#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) (div (* main_~x~0 2) 4294967296))) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 09:02:28,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (<= (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)))) (not (<= (+ (div main_~sn~0 4294967296) 1) (div (* main_~x~0 2) 4294967296))) (< (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {506#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:02:28,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {506#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {507#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:02:28,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {507#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {491#false} is VALID [2022-04-28 09:02:28,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {491#false} assume !false; {491#false} is VALID [2022-04-28 09:02:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 09:02:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:02:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737737088] [2022-04-28 09:02:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737737088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:02:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677943828] [2022-04-28 09:02:28,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:02:28,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:02:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:02:28,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:02:28,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:02:28,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:02:28,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:02:28,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 09:02:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:02:28,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:02:28,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2022-04-28 09:02:28,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} #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); {490#true} is VALID [2022-04-28 09:02:28,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #41#return; {490#true} is VALID [2022-04-28 09:02:28,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret4 := main(); {490#true} is VALID [2022-04-28 09:02:28,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {490#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {495#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-28 09:02:28,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {530#(and (= main_~x~0 1) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-28 09:02:28,508 INFO L272 TraceCheckUtils]: 7: Hoare triple {530#(and (= main_~x~0 1) (= (+ (- 2) main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {490#true} is VALID [2022-04-28 09:02:28,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,509 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {490#true} {530#(and (= main_~x~0 1) (= (+ (- 2) main_~sn~0) 0))} #39#return; {530#(and (= main_~x~0 1) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-28 09:02:28,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#(and (= main_~x~0 1) (= (+ (- 2) main_~sn~0) 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {549#(and (= (+ (- 1) main_~x~0) 1) (= main_~sn~0 4))} is VALID [2022-04-28 09:02:28,511 INFO L272 TraceCheckUtils]: 13: Hoare triple {549#(and (= (+ (- 1) main_~x~0) 1) (= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {490#true} is VALID [2022-04-28 09:02:28,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,532 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {490#true} {549#(and (= (+ (- 1) main_~x~0) 1) (= main_~sn~0 4))} #39#return; {549#(and (= (+ (- 1) main_~x~0) 1) (= main_~sn~0 4))} is VALID [2022-04-28 09:02:28,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {549#(and (= (+ (- 1) main_~x~0) 1) (= main_~sn~0 4))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {568#(and (= main_~x~0 3) (= (+ (- 2) main_~sn~0) 4))} is VALID [2022-04-28 09:02:28,533 INFO L272 TraceCheckUtils]: 19: Hoare triple {568#(and (= main_~x~0 3) (= (+ (- 2) main_~sn~0) 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:02:28,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:28,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {491#false} is VALID [2022-04-28 09:02:28,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {491#false} assume !false; {491#false} is VALID [2022-04-28 09:02:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:02:28,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:02:28,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {491#false} assume !false; {491#false} is VALID [2022-04-28 09:02:28,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {576#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {491#false} is VALID [2022-04-28 09:02:28,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {572#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {576#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:02:28,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {592#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {572#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:02:28,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {596#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {592#(or (= (mod main_~sn~0 4294967296) 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))} is VALID [2022-04-28 09:02:28,885 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {490#true} {596#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} #39#return; {596#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-28 09:02:28,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,886 INFO L272 TraceCheckUtils]: 13: Hoare triple {596#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {490#true} is VALID [2022-04-28 09:02:28,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {615#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {596#(or (= (mod (+ 2 main_~sn~0) 4294967296) 0) (= (mod (+ 2 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 2) 4294967296)))} is VALID [2022-04-28 09:02:28,888 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {490#true} {615#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} #39#return; {615#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} is VALID [2022-04-28 09:02:28,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2022-04-28 09:02:28,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2022-04-28 09:02:28,888 INFO L272 TraceCheckUtils]: 7: Hoare triple {615#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 % 4294967296 then 1 else 0)); {490#true} is VALID [2022-04-28 09:02:28,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#(or (= (mod (+ 6 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 6) 4294967296)) (= (mod (+ 6 main_~sn~0) 4294967296) 0))} assume !false;~sn~0 := 2 + ~sn~0;#t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {615#(or (= (mod (+ main_~sn~0 4) 4294967296) 0) (= (mod (+ (* main_~x~0 2) 4) 4294967296) (mod (+ main_~sn~0 4) 4294967296)))} is VALID [2022-04-28 09:02:28,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {490#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {634#(or (= (mod (+ 6 main_~sn~0) 4294967296) (mod (+ (* main_~x~0 2) 6) 4294967296)) (= (mod (+ 6 main_~sn~0) 4294967296) 0))} is VALID [2022-04-28 09:02:28,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret4 := main(); {490#true} is VALID [2022-04-28 09:02:28,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #41#return; {490#true} is VALID [2022-04-28 09:02:28,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2022-04-28 09:02:28,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#true} #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); {490#true} is VALID [2022-04-28 09:02:28,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2022-04-28 09:02:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:02:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677943828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:02:28,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:02:28,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-04-28 09:02:28,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:02:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1723871916] [2022-04-28 09:02:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1723871916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:02:28,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:02:28,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:02:28,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978877159] [2022-04-28 09:02:28,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:02:28,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 09:02:28,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:02:28,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:28,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:28,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:02:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:02:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:02:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:02:28,907 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:29,031 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:02:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:02:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 09:02:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:02:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-28 09:02:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-28 09:02:29,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2022-04-28 09:02:29,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:29,045 INFO L225 Difference]: With dead ends: 26 [2022-04-28 09:02:29,046 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:02:29,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:02:29,047 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:02:29,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 30 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:02:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:02:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:02:29,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:02:29,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:02:29,048 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:02:29,048 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:02:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:29,048 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:02:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:02:29,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:29,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:29,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:02:29,048 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:02:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:02:29,048 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:02:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:02:29,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:29,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:02:29,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:02:29,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:02:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:02:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:02:29,049 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-28 09:02:29,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:02:29,049 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:02:29,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:02:29,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:02:29,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:02:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:02:29,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:02:29,051 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:02:29,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:02:29,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:02:29,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:02:29,321 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:02:29,321 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:02:29,322 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:02:29,322 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 29) the Hoare annotation is: true [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (* main_~x~0 2))) (and (<= .cse0 main_~sn~0) (<= main_~sn~0 .cse0))) [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point L27-1(lines 24 28) the Hoare annotation is: (let ((.cse0 (* main_~x~0 2))) (and (<= .cse0 main_~sn~0) (<= main_~sn~0 .cse0))) [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 20 29) the Hoare annotation is: false [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 20 29) the Hoare annotation is: false [2022-04-28 09:02:29,322 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:02:29,322 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: false [2022-04-28 09:02:29,322 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:02:29,322 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: false [2022-04-28 09:02:29,322 INFO L895 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:02:29,323 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 18) the Hoare annotation is: true [2022-04-28 09:02:29,323 INFO L895 garLoopResultBuilder]: At program point L14(lines 14 16) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:02:29,323 INFO L895 garLoopResultBuilder]: At program point L14-2(lines 13 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:02:29,323 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 13 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:02:29,323 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:02:29,325 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-28 09:02:29,326 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:02:29,328 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:02:29,328 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:02:29,345 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:02:29,347 INFO L163 areAnnotationChecker]: CFG has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:02:29,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:02:29 BoogieIcfgContainer [2022-04-28 09:02:29,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:02:29,354 INFO L158 Benchmark]: Toolchain (without parser) took 5823.53ms. Allocated memory was 190.8MB in the beginning and 259.0MB in the end (delta: 68.2MB). Free memory was 141.2MB in the beginning and 142.0MB in the end (delta: -778.5kB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-04-28 09:02:29,354 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:02:29,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.63ms. Allocated memory is still 190.8MB. Free memory was 141.1MB in the beginning and 166.7MB in the end (delta: -25.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-28 09:02:29,354 INFO L158 Benchmark]: Boogie Preprocessor took 27.79ms. Allocated memory is still 190.8MB. Free memory was 166.7MB in the beginning and 165.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:02:29,355 INFO L158 Benchmark]: RCFGBuilder took 224.65ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 155.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:02:29,355 INFO L158 Benchmark]: TraceAbstraction took 5329.97ms. Allocated memory was 190.8MB in the beginning and 259.0MB in the end (delta: 68.2MB). Free memory was 154.5MB in the beginning and 142.0MB in the end (delta: 12.5MB). Peak memory consumption was 80.0MB. Max. memory is 8.0GB. [2022-04-28 09:02:29,356 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.63ms. Allocated memory is still 190.8MB. Free memory was 141.1MB in the beginning and 166.7MB in the end (delta: -25.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.79ms. Allocated memory is still 190.8MB. Free memory was 166.7MB in the beginning and 165.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 224.65ms. Allocated memory is still 190.8MB. Free memory was 165.0MB in the beginning and 155.1MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5329.97ms. Allocated memory was 190.8MB in the beginning and 259.0MB in the end (delta: 68.2MB). Free memory was 154.5MB in the beginning and 142.0MB in the end (delta: 12.5MB). Peak memory consumption was 80.0MB. 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 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 28 mSDtfsCounter, 115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 36 PreInvPairs, 48 NumberOfFragments, 69 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: x * 2 <= sn && sn <= x * 2 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 0 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:02:29,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...