/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:26:00,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:26:00,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:26:00,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:26:00,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:26:00,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:26:00,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:26:00,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:26:00,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:26:00,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:26:00,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:26:00,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:26:00,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:26:00,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:26:00,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:26:00,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:26:00,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:26:00,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:26:00,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:26:00,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:26:00,817 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:26:00,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:26:00,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:26:00,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:26:00,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:26:00,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:26:00,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:26:00,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:26:00,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:26:00,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:26:00,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:26:00,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:26:00,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:26:00,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:26:00,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:26:00,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:26:00,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:26:00,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:26:00,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:26:00,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:26:00,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:26:00,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:26:00,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:26:00,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:26:00,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:26:00,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:26:00,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:26:00,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:26:00,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:26:00,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:26:00,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:26:00,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:26:00,851 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:26:00,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:26:00,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:26:00,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:26:00,852 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:26:00,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:26:00,853 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:26:00,853 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:26:01,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:26:01,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:26:01,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:26:01,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:26:01,099 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:26:01,100 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-08 10:26:01,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff30f82d/95a480331cc8400eb1baff224c497ea3/FLAGbc2fc07b6 [2022-04-08 10:26:01,489 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:26:01,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2022-04-08 10:26:01,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff30f82d/95a480331cc8400eb1baff224c497ea3/FLAGbc2fc07b6 [2022-04-08 10:26:01,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff30f82d/95a480331cc8400eb1baff224c497ea3 [2022-04-08 10:26:01,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:26:01,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:26:01,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:26:01,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:26:01,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:26:01,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:26:01" (1/1) ... [2022-04-08 10:26:01,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f1c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:01, skipping insertion in model container [2022-04-08 10:26:01,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:26:01" (1/1) ... [2022-04-08 10:26:01,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:26:01,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:26:02,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c[403,416] [2022-04-08 10:26:02,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:26:02,103 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:26:02,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c[403,416] [2022-04-08 10:26:02,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:26:02,131 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:26:02,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02 WrapperNode [2022-04-08 10:26:02,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:26:02,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:26:02,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:26:02,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:26:02,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:26:02,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:26:02,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:26:02,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:26:02,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (1/1) ... [2022-04-08 10:26:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:26:02,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:02,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:26:02,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:26:02,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:26:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:26:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:26:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:26:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:26:02,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:26:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:26:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:26:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:26:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:26:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:26:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:26:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:26:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:26:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:26:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:26:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:26:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:26:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:26:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:26:02,327 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:26:02,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:26:04,673 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:26:04,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:26:04,679 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:26:04,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:26:04 BoogieIcfgContainer [2022-04-08 10:26:04,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:26:04,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:26:04,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:26:04,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:26:04,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:26:01" (1/3) ... [2022-04-08 10:26:04,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e14547b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:26:04, skipping insertion in model container [2022-04-08 10:26:04,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:02" (2/3) ... [2022-04-08 10:26:04,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e14547b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:26:04, skipping insertion in model container [2022-04-08 10:26:04,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:26:04" (3/3) ... [2022-04-08 10:26:04,695 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt3.c [2022-04-08 10:26:04,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:26:04,699 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:26:04,738 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:26:04,744 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:26:04,744 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:26:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:26:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:26:04,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:04,768 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:04,769 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:04,774 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 1 times [2022-04-08 10:26:04,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:04,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345361039] [2022-04-08 10:26:04,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:26:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash -639692549, now seen corresponding path program 2 times [2022-04-08 10:26:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:04,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589326271] [2022-04-08 10:26:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:04,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:05,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-08 10:26:05,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 10:26:05,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-08 10:26:05,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:05,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-08 10:26:05,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 10:26:05,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-08 10:26:05,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-08 10:26:05,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {26#true} is VALID [2022-04-08 10:26:05,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {26#true} is VALID [2022-04-08 10:26:05,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 10:26:05,013 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-08 10:26:05,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 10:26:05,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 10:26:05,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 10:26:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:05,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589326271] [2022-04-08 10:26:05,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589326271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:05,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:05,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:26:05,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345361039] [2022-04-08 10:26:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345361039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:05,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:05,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:26:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343613540] [2022-04-08 10:26:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-08 10:26:05,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:05,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:05,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:05,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:26:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:05,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:26:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:26:05,084 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:07,404 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-08 10:26:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:26:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-08 10:26:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-08 10:26:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-04-08 10:26:07,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-04-08 10:26:07,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:07,487 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:26:07,487 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 10:26:07,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:26:07,493 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:07,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:26:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 10:26:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 10:26:07,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:07,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,540 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,541 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:07,546 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 10:26:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 10:26:07,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:07,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:07,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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) Second operand 16 states. [2022-04-08 10:26:07,548 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 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) Second operand 16 states. [2022-04-08 10:26:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:07,550 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 10:26:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 10:26:07,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:07,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:07,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:07,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 10:26:07,554 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-08 10:26:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:07,555 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 10:26:07,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 10:26:07,599 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-08 10:26:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 10:26:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:26:07,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:07,600 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:07,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:26:07,600 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 1 times [2022-04-08 10:26:07,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:07,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [117577189] [2022-04-08 10:26:07,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:26:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash -654468885, now seen corresponding path program 2 times [2022-04-08 10:26:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:07,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428384301] [2022-04-08 10:26:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:07,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {168#true} is VALID [2022-04-08 10:26:07,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 10:26:07,926 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-08 10:26:07,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:07,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {168#true} is VALID [2022-04-08 10:26:07,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID [2022-04-08 10:26:07,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #61#return; {168#true} is VALID [2022-04-08 10:26:07,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret5 := main(); {168#true} is VALID [2022-04-08 10:26:07,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {168#true} is VALID [2022-04-08 10:26:07,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:07,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:07,947 INFO L272 TraceCheckUtils]: 8: Hoare triple {173#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {174#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:26:07,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {175#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:26:07,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {169#false} is VALID [2022-04-08 10:26:07,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-04-08 10:26:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:07,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428384301] [2022-04-08 10:26:07,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428384301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:07,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:07,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:07,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:07,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [117577189] [2022-04-08 10:26:07,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [117577189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:07,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:07,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465704020] [2022-04-08 10:26:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:07,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-08 10:26:07,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:07,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:07,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:07,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:26:07,966 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:10,458 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-08 10:26:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:26:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-08 10:26:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-08 10:26:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-08 10:26:10,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-08 10:26:10,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:10,495 INFO L225 Difference]: With dead ends: 23 [2022-04-08 10:26:10,495 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:26:10,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:26:10,497 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:10,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 10:26:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:26:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-08 10:26:10,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:10,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,503 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,504 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:10,505 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 10:26:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:26:10,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:10,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:10,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-08 10:26:10,506 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 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) Second operand 18 states. [2022-04-08 10:26:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:10,508 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 10:26:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:26:10,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:10,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:10,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:10,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 10:26:10,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-08 10:26:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:10,510 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 10:26:10,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:10,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 10:26:10,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:26:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:26:10,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:10,534 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:10,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:26:10,534 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:10,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1940796243, now seen corresponding path program 1 times [2022-04-08 10:26:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:10,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753292512] [2022-04-08 10:26:10,552 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:10,552 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1940796243, now seen corresponding path program 2 times [2022-04-08 10:26:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:10,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024404806] [2022-04-08 10:26:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:11,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-08 10:26:11,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 10:26:11,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-08 10:26:11,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:11,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-08 10:26:11,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 10:26:11,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-08 10:26:11,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-08 10:26:11,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {301#true} is VALID [2022-04-08 10:26:11,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:11,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {307#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-08 10:26:11,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {308#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} is VALID [2022-04-08 10:26:11,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {308#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} ~l~0 := 1 + ~l~0; {309#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:26:11,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {310#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:26:11,078 INFO L272 TraceCheckUtils]: 11: Hoare triple {310#(and (= main_~k~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:26:11,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:26:11,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-08 10:26:11,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-08 10:26:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:11,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:11,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024404806] [2022-04-08 10:26:11,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024404806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:11,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914189121] [2022-04-08 10:26:11,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:11,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:11,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:11,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:26:11,124 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-08 10:26:11,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:11,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:11,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:26:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:11,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:11,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2022-04-08 10:26:11,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-08 10:26:11,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 10:26:11,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-08 10:26:11,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-08 10:26:11,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {301#true} is VALID [2022-04-08 10:26:11,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:11,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:11,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {306#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {341#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:11,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {345#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:11,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {345#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:11,528 INFO L272 TraceCheckUtils]: 11: Hoare triple {345#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {352#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:11,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {352#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {356#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:11,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {302#false} is VALID [2022-04-08 10:26:11,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-08 10:26:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:11,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:11,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-08 10:26:11,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {302#false} is VALID [2022-04-08 10:26:11,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {352#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {356#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:11,854 INFO L272 TraceCheckUtils]: 11: Hoare triple {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {352#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:11,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:11,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {379#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:13,964 WARN L290 TraceCheckUtils]: 8: Hoare triple {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {379#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-08 10:26:13,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:13,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {372#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:13,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {301#true} is VALID [2022-04-08 10:26:13,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-08 10:26:13,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #61#return; {301#true} is VALID [2022-04-08 10:26:13,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-08 10:26:13,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {301#true} is VALID [2022-04-08 10:26:13,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2022-04-08 10:26:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:26:13,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914189121] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:13,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:13,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-08 10:26:13,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:13,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753292512] [2022-04-08 10:26:13,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753292512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:13,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:13,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:13,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744548956] [2022-04-08 10:26:13,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:13,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-08 10:26:13,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:13,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:16,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:16,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:16,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:16,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:26:16,128 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:20,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:20,653 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 10:26:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:26:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-08 10:26:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 10:26:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 10:26:20,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-08 10:26:22,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:22,810 INFO L225 Difference]: With dead ends: 25 [2022-04-08 10:26:22,810 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 10:26:22,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:26:22,812 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:22,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:26:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 10:26:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-08 10:26:22,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:22,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:22,816 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:22,816 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:22,817 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 10:26:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:26:22,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:22,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:22,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) Second operand 20 states. [2022-04-08 10:26:22,818 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 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) Second operand 20 states. [2022-04-08 10:26:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:22,820 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-08 10:26:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-08 10:26:22,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:22,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:22,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:22,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-08 10:26:22,822 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 15 [2022-04-08 10:26:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:22,822 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-08 10:26:22,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:22,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-08 10:26:24,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-08 10:26:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:26:24,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:24,993 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:25,019 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-08 10:26:25,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:25,194 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:25,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:25,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2042434564, now seen corresponding path program 1 times [2022-04-08 10:26:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:25,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825062222] [2022-04-08 10:26:25,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:25,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2042434564, now seen corresponding path program 2 times [2022-04-08 10:26:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:25,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254847799] [2022-04-08 10:26:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:25,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:25,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:25,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {539#true} is VALID [2022-04-08 10:26:25,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-08 10:26:25,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {539#true} {539#true} #61#return; {539#true} is VALID [2022-04-08 10:26:25,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {545#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:25,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {539#true} is VALID [2022-04-08 10:26:25,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-08 10:26:25,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #61#return; {539#true} is VALID [2022-04-08 10:26:25,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret5 := main(); {539#true} is VALID [2022-04-08 10:26:25,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {539#true} is VALID [2022-04-08 10:26:25,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {539#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {544#(= main_~l~0 0)} is VALID [2022-04-08 10:26:25,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {544#(= main_~l~0 0)} is VALID [2022-04-08 10:26:25,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {544#(= main_~l~0 0)} is VALID [2022-04-08 10:26:25,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {540#false} is VALID [2022-04-08 10:26:25,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#false} ~l~0 := 1 + ~l~0; {540#false} is VALID [2022-04-08 10:26:25,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {540#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {540#false} is VALID [2022-04-08 10:26:25,281 INFO L272 TraceCheckUtils]: 12: Hoare triple {540#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {540#false} is VALID [2022-04-08 10:26:25,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#false} ~cond := #in~cond; {540#false} is VALID [2022-04-08 10:26:25,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {540#false} assume 0 == ~cond; {540#false} is VALID [2022-04-08 10:26:25,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-08 10:26:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:25,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254847799] [2022-04-08 10:26:25,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254847799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:25,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:25,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:26:25,282 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:25,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825062222] [2022-04-08 10:26:25,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825062222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:25,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:25,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:26:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568679567] [2022-04-08 10:26:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-04-08 10:26:25,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:25,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:25,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:25,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:26:25,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:26:25,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:26:25,299 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,356 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:27,610 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-08 10:26:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:26:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-04-08 10:26:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 10:26:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-08 10:26:27,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-08 10:26:27,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:27,655 INFO L225 Difference]: With dead ends: 33 [2022-04-08 10:26:27,655 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:26:27,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:26:27,657 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:27,657 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:26:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:26:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-08 10:26:27,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:27,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,663 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,663 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:27,665 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 10:26:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 10:26:27,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:27,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:27,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 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) Second operand 24 states. [2022-04-08 10:26:27,666 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 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) Second operand 24 states. [2022-04-08 10:26:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:27,688 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 10:26:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 10:26:27,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:27,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:27,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:27,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-08 10:26:27,691 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-08 10:26:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:27,691 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-08 10:26:27,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:27,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-08 10:26:29,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 10:26:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:26:29,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:29,840 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:29,840 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 10:26:29,840 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:29,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash 267427202, now seen corresponding path program 1 times [2022-04-08 10:26:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:29,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607307532] [2022-04-08 10:26:29,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:29,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 267427202, now seen corresponding path program 2 times [2022-04-08 10:26:29,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:29,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751303466] [2022-04-08 10:26:29,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:29,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:29,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {709#true} is VALID [2022-04-08 10:26:29,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 10:26:29,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {709#true} {709#true} #61#return; {709#true} is VALID [2022-04-08 10:26:30,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {715#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:30,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {709#true} is VALID [2022-04-08 10:26:30,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2022-04-08 10:26:30,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #61#return; {709#true} is VALID [2022-04-08 10:26:30,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret5 := main(); {709#true} is VALID [2022-04-08 10:26:30,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {709#true} is VALID [2022-04-08 10:26:30,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {714#(= main_~l~0 0)} is VALID [2022-04-08 10:26:30,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {714#(= main_~l~0 0)} is VALID [2022-04-08 10:26:30,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {714#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {710#false} is VALID [2022-04-08 10:26:30,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {710#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {710#false} is VALID [2022-04-08 10:26:30,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {710#false} ~l~0 := 1 + ~l~0; {710#false} is VALID [2022-04-08 10:26:30,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {710#false} is VALID [2022-04-08 10:26:30,003 INFO L272 TraceCheckUtils]: 12: Hoare triple {710#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {710#false} is VALID [2022-04-08 10:26:30,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {710#false} ~cond := #in~cond; {710#false} is VALID [2022-04-08 10:26:30,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {710#false} assume 0 == ~cond; {710#false} is VALID [2022-04-08 10:26:30,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {710#false} assume !false; {710#false} is VALID [2022-04-08 10:26:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751303466] [2022-04-08 10:26:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751303466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:30,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:30,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:26:30,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:30,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607307532] [2022-04-08 10:26:30,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607307532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:30,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:30,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:26:30,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790075878] [2022-04-08 10:26:30,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-04-08 10:26:30,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:30,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:32,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:32,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:26:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:32,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:26:32,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 10:26:32,188 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:36,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:36,653 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-08 10:26:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:26:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16 [2022-04-08 10:26:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 10:26:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 10:26:36,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-08 10:26:38,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:38,863 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:26:38,863 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:26:38,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:26:38,864 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:38,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-08 10:26:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:26:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 10:26:38,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:38,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:38,869 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:38,869 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:38,871 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 10:26:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 10:26:38,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:38,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:38,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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) Second operand 22 states. [2022-04-08 10:26:38,871 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 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) Second operand 22 states. [2022-04-08 10:26:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:38,873 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 10:26:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-08 10:26:38,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:38,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:38,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:38,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-08 10:26:38,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2022-04-08 10:26:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:38,874 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-08 10:26:38,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:38,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-08 10:26:41,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 10:26:41,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:26:41,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:26:41,040 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:26:41,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 10:26:41,040 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:26:41,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:26:41,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1013814982, now seen corresponding path program 1 times [2022-04-08 10:26:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513880600] [2022-04-08 10:26:41,049 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:26:41,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:26:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1013814982, now seen corresponding path program 2 times [2022-04-08 10:26:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:26:41,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302168805] [2022-04-08 10:26:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:26:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:26:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:26:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:41,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {871#true} is VALID [2022-04-08 10:26:41,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#true} assume true; {871#true} is VALID [2022-04-08 10:26:41,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {871#true} {871#true} #61#return; {871#true} is VALID [2022-04-08 10:26:41,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {871#true} call ULTIMATE.init(); {885#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:26:41,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {871#true} is VALID [2022-04-08 10:26:41,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#true} assume true; {871#true} is VALID [2022-04-08 10:26:41,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#true} {871#true} #61#return; {871#true} is VALID [2022-04-08 10:26:41,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {871#true} call #t~ret5 := main(); {871#true} is VALID [2022-04-08 10:26:41,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {871#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {871#true} is VALID [2022-04-08 10:26:41,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {876#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {876#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {877#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-08 10:26:41,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {878#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} is VALID [2022-04-08 10:26:41,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {878#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0)) (= main_~k~0 0) (<= main_~i~0 1) (= main_~j~0 0) (= main_~l~0 0) (<= 1 main_~i~0))} ~l~0 := 1 + ~l~0; {879#(and (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-08 10:26:41,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(and (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {879#(and (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-08 10:26:41,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {879#(and (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {879#(and (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)))} is VALID [2022-04-08 10:26:41,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {879#(and (= main_~k~0 0) (<= main_~l~0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {880#(and (<= (+ main_~i~0 main_~k~0) (+ main_~l~0 1)) (= main_~j~0 0) (<= (+ main_~l~0 1) (+ main_~i~0 main_~k~0)) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0 main_~k~0)))} is VALID [2022-04-08 10:26:41,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {880#(and (<= (+ main_~i~0 main_~k~0) (+ main_~l~0 1)) (= main_~j~0 0) (<= (+ main_~l~0 1) (+ main_~i~0 main_~k~0)) (<= (+ main_~l~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~i~0 main_~n~0 main_~k~0)))} ~l~0 := 1 + ~l~0; {881#(and (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0 main_~k~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:26:41,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {881#(and (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~i~0 main_~n~0 main_~k~0)) (not (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {882#(and (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} is VALID [2022-04-08 10:26:41,654 INFO L272 TraceCheckUtils]: 15: Hoare triple {882#(and (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) 1)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296)) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)))) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {883#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:26:41,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {883#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {884#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:26:41,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {872#false} is VALID [2022-04-08 10:26:41,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#false} assume !false; {872#false} is VALID [2022-04-08 10:26:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:41,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:26:41,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302168805] [2022-04-08 10:26:41,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302168805] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:41,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354398511] [2022-04-08 10:26:41,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:26:41,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:26:41,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:41,664 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-08 10:26:41,667 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-08 10:26:41,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:26:41,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:26:41,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:26:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:26:41,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:26:42,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {871#true} call ULTIMATE.init(); {871#true} is VALID [2022-04-08 10:26:42,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {871#true} is VALID [2022-04-08 10:26:42,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#true} assume true; {871#true} is VALID [2022-04-08 10:26:42,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#true} {871#true} #61#return; {871#true} is VALID [2022-04-08 10:26:42,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {871#true} call #t~ret5 := main(); {871#true} is VALID [2022-04-08 10:26:42,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {871#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {871#true} is VALID [2022-04-08 10:26:42,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {876#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:42,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {876#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {876#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-08 10:26:42,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {876#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {913#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {917#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {917#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {917#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {917#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {917#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {917#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {927#(and (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {927#(and (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {931#(and (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {931#(and (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {931#(and (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:26:42,161 INFO L272 TraceCheckUtils]: 15: Hoare triple {931#(and (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~k~0 1) (= (+ (- 1) main_~i~0) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {938#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:42,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {942#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:42,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {872#false} is VALID [2022-04-08 10:26:42,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#false} assume !false; {872#false} is VALID [2022-04-08 10:26:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:26:42,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:26:42,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#false} assume !false; {872#false} is VALID [2022-04-08 10:26:42,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {872#false} is VALID [2022-04-08 10:26:42,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {942#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:26:42,598 INFO L272 TraceCheckUtils]: 15: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {938#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:26:42,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:42,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {965#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:42,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296);~k~0 := 1 + ~k~0; {965#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-08 10:26:42,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:42,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:42,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {965#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} ~l~0 := 1 + ~l~0; {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:44,727 WARN L290 TraceCheckUtils]: 8: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {965#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-08 10:26:44,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:44,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~i~0 := 0;~j~0 := 0;~k~0 := 0;~l~0 := 0; {958#(= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-08 10:26:44,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {871#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~l~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {871#true} is VALID [2022-04-08 10:26:44,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {871#true} call #t~ret5 := main(); {871#true} is VALID [2022-04-08 10:26:44,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#true} {871#true} #61#return; {871#true} is VALID [2022-04-08 10:26:44,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#true} assume true; {871#true} is VALID [2022-04-08 10:26:44,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {871#true} is VALID [2022-04-08 10:26:44,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {871#true} call ULTIMATE.init(); {871#true} is VALID [2022-04-08 10:26:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:26:44,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354398511] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:26:44,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:26:44,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 9] total 20 [2022-04-08 10:26:44,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:26:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513880600] [2022-04-08 10:26:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513880600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:26:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:26:44,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:26:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959651544] [2022-04-08 10:26:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:26:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 19 [2022-04-08 10:26:44,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:26:44,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:44,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:44,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:26:44,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:26:44,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:26:44,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:26:44,877 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:46,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:26:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:47,279 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-08 10:26:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:26:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 19 [2022-04-08 10:26:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:26:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-08 10:26:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-08 10:26:47,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-08 10:26:49,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:26:49,483 INFO L225 Difference]: With dead ends: 21 [2022-04-08 10:26:49,483 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:26:49,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:26:49,484 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:26:49,485 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 32 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:26:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:26:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:26:49,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:26:49,485 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-08 10:26:49,485 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-08 10:26:49,485 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-08 10:26:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:49,485 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:26:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:26:49,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:49,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:49,486 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-08 10:26:49,486 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-08 10:26:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:26:49,486 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:26:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:26:49,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:49,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:26:49,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:26:49,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:26:49,486 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-08 10:26:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:26:49,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-04-08 10:26:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:26:49,486 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:26:49,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:26:49,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:26:49,487 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-08 10:26:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:26:49,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:26:49,489 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:26:49,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 10:26:49,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 10:26:49,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:26:49,895 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 10:26:49,895 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 10:26:49,895 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 10:26:49,895 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:26:49,895 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-08 10:26:49,896 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:26:49,896 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:26:49,896 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 36) the Hoare annotation is: true [2022-04-08 10:26:49,896 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= main_~l~0 0) [2022-04-08 10:26:49,896 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 36) the Hoare annotation is: true [2022-04-08 10:26:49,896 INFO L885 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-04-08 10:26:49,896 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 36) the Hoare annotation is: true [2022-04-08 10:26:49,896 INFO L878 garLoopResultBuilder]: At program point L28(lines 28 31) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:26:49,896 INFO L878 garLoopResultBuilder]: At program point L26(lines 26 31) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:26:49,896 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 26 31) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod (+ main_~l~0 1) 4294967296)) [2022-04-08 10:26:49,896 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 24 33) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:26:49,897 INFO L878 garLoopResultBuilder]: At program point L24-3(lines 24 33) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2022-04-08 10:26:49,897 INFO L878 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 10:26:49,897 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2022-04-08 10:26:49,898 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:26:49,900 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-08 10:26:49,902 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:26:49,910 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:26:49,911 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 10:26:49,912 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:26:49,912 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:26:49,912 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:26:49,915 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 10:26:52,039 INFO L163 areAnnotationChecker]: CFG has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:26:52,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:26:52 BoogieIcfgContainer [2022-04-08 10:26:52,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:26:52,047 INFO L158 Benchmark]: Toolchain (without parser) took 50118.80ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 133.2MB in the beginning and 174.5MB in the end (delta: -41.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:26:52,048 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 183.5MB. Free memory was 149.5MB in the beginning and 149.4MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:26:52,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.75ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 133.1MB in the beginning and 197.3MB in the end (delta: -64.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:26:52,048 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 220.2MB. Free memory was 197.3MB in the beginning and 195.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:26:52,049 INFO L158 Benchmark]: RCFGBuilder took 2499.14ms. Allocated memory is still 220.2MB. Free memory was 195.6MB in the beginning and 184.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 10:26:52,049 INFO L158 Benchmark]: TraceAbstraction took 47364.31ms. Allocated memory is still 220.2MB. Free memory was 183.8MB in the beginning and 174.5MB in the end (delta: 9.3MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-08 10:26:52,050 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.21ms. Allocated memory is still 183.5MB. Free memory was 149.5MB in the beginning and 149.4MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.75ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 133.1MB in the beginning and 197.3MB in the end (delta: -64.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 220.2MB. Free memory was 197.3MB in the beginning and 195.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 2499.14ms. Allocated memory is still 220.2MB. Free memory was 195.6MB in the beginning and 184.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 47364.31ms. Allocated memory is still 220.2MB. Free memory was 183.8MB in the beginning and 174.5MB in the end (delta: 9.3MB). Peak memory consumption was 10.1MB. 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: 10]: 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 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 81 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 30, 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, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 53 PreInvPairs, 78 NumberOfFragments, 101 HoareAnnotationTreeSize, 53 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 218 FormulaSimplificationTreeSizeReductionInter, 0.2s 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: (i + k + j) % 4294967296 == l % 4294967296 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 10:26:52,079 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...