/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/loop-invariants/mod4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:31:26,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:31:26,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:31:26,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:31:26,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:31:26,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:31:26,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:31:26,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:31:26,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:31:26,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:31:26,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:31:26,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:31:26,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:31:26,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:31:26,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:31:26,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:31:26,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:31:26,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:31:26,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:31:26,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:31:26,094 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:31:26,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:31:26,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:31:26,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:31:26,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:31:26,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:31:26,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:31:26,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:31:26,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:31:26,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:31:26,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:31:26,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:31:26,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:31:26,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:31:26,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:31:26,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:31:26,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:31:26,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:31:26,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:31:26,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:31:26,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:31:26,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:31:26,118 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:31:26,123 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:31:26,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:31:26,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:31:26,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:31:26,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:31:26,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:31:26,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:31:26,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:31:26,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:31:26,127 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:31:26,127 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:31:26,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:31:26,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:31:26,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:31:26,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:31:26,312 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:31:26,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/mod4.c [2022-04-08 10:31:26,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6155ade5/c56dfe4dd8ee49ea9ab7f0ced327b6a6/FLAG1c550b7fd [2022-04-08 10:31:26,693 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:31:26,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4.c [2022-04-08 10:31:26,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6155ade5/c56dfe4dd8ee49ea9ab7f0ced327b6a6/FLAG1c550b7fd [2022-04-08 10:31:26,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6155ade5/c56dfe4dd8ee49ea9ab7f0ced327b6a6 [2022-04-08 10:31:26,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:31:26,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:31:26,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:31:26,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:31:26,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:31:26,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50dcae74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26, skipping insertion in model container [2022-04-08 10:31:26,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:31:26,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:31:26,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4.c[351,364] [2022-04-08 10:31:26,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:31:26,915 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:31:26,931 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/mod4.c[351,364] [2022-04-08 10:31:26,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:31:26,948 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:31:26,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26 WrapperNode [2022-04-08 10:31:26,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:31:26,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:31:26,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:31:26,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:31:26,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:31:26,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:31:26,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:31:26,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:31:26,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (1/1) ... [2022-04-08 10:31:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:31:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:31:27,007 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:31:27,024 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:31:27,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:31:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:31:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:31:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:31:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:31:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:31:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:31:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:31:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:31:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:31:27,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:31:27,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:31:27,169 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:31:27,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:31:27,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:31:27,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:31:27 BoogieIcfgContainer [2022-04-08 10:31:27,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:31:27,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:31:27,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:31:27,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:31:27,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:31:26" (1/3) ... [2022-04-08 10:31:27,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d860627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:31:27, skipping insertion in model container [2022-04-08 10:31:27,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:31:26" (2/3) ... [2022-04-08 10:31:27,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d860627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:31:27, skipping insertion in model container [2022-04-08 10:31:27,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:31:27" (3/3) ... [2022-04-08 10:31:27,204 INFO L111 eAbstractionObserver]: Analyzing ICFG mod4.c [2022-04-08 10:31:27,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:31:27,208 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:31:27,255 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:31:27,259 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:31:27,259 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:31:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:31:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 10:31:27,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:31:27,278 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:31:27,278 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:31:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:31:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1035305623, now seen corresponding path program 1 times [2022-04-08 10:31:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:27,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1361717993] [2022-04-08 10:31:27,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:31:27,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1035305623, now seen corresponding path program 2 times [2022-04-08 10:31:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:31:27,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382033254] [2022-04-08 10:31:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:31:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:31:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:31:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:27,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-08 10:31:27,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 10:31:27,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2022-04-08 10:31:27,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:31:27,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-08 10:31:27,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 10:31:27,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2022-04-08 10:31:27,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-08 10:31:27,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-08 10:31:27,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-08 10:31:27,487 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 4 then ~x~0 % 4294967296 % 4 - 4 else ~x~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-08 10:31:27,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 10:31:27,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 10:31:27,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 10:31:27,488 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:31:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:31:27,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382033254] [2022-04-08 10:31:27,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382033254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:27,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:27,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:31:27,494 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:31:27,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1361717993] [2022-04-08 10:31:27,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1361717993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:27,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:27,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:31:27,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550355153] [2022-04-08 10:31:27,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:31:27,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 10:31:27,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:31:27,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:27,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:27,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:31:27,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:31:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:31:27,547 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:27,634 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-08 10:31:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:31:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 10:31:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:31:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 10:31:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 10:31:27,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-08 10:31:27,695 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:31:27,700 INFO L225 Difference]: With dead ends: 32 [2022-04-08 10:31:27,700 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 10:31:27,703 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:31:27,706 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:31:27,708 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:31:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 10:31:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 10:31:27,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:31:27,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:31:27,732 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:31:27,732 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:31:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:27,737 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 10:31:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:31:27,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:27,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:27,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 10:31:27,739 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-08 10:31:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:27,741 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-08 10:31:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:31:27,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:27,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:27,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:31:27,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:31:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:31:27,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-08 10:31:27,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-08 10:31:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:31:27,745 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-08 10:31:27,745 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:31:27,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-08 10:31:27,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-08 10:31:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:31:27,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:31:27,762 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:31:27,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:31:27,764 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:31:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:31:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2042096758, now seen corresponding path program 1 times [2022-04-08 10:31:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:27,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643139630] [2022-04-08 10:31:27,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:31:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2042096758, now seen corresponding path program 2 times [2022-04-08 10:31:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:31:27,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337971851] [2022-04-08 10:31:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:31:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:31:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:27,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:31:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:27,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-08 10:31:27,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-08 10:31:27,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #38#return; {147#true} is VALID [2022-04-08 10:31:27,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:31:27,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-08 10:31:27,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-08 10:31:27,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #38#return; {147#true} is VALID [2022-04-08 10:31:27,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2022-04-08 10:31:27,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0; {152#(= main_~x~0 0)} is VALID [2022-04-08 10:31:27,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {152#(= main_~x~0 0)} is VALID [2022-04-08 10:31:27,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(= main_~x~0 0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {152#(= main_~x~0 0)} is VALID [2022-04-08 10:31:27,841 INFO L272 TraceCheckUtils]: 8: Hoare triple {152#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 4 then ~x~0 % 4294967296 % 4 - 4 else ~x~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:31:27,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {153#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:31:27,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {148#false} is VALID [2022-04-08 10:31:27,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-08 10:31:27,842 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:31:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:31:27,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337971851] [2022-04-08 10:31:27,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337971851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:27,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:27,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:31:27,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:31:27,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643139630] [2022-04-08 10:31:27,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643139630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:27,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:27,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:31:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812219201] [2022-04-08 10:31:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:31:27,846 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:31:27,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:31:27,846 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:31:27,858 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:31:27,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:31:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:31:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:31:27,859 INFO L87 Difference]: Start difference. First operand 13 states and 13 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:31:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:27,955 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-08 10:31:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:31:27,955 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:31:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:31:27,956 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:31:27,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:31:27,961 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:31:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-08 10:31:27,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-08 10:31:27,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:27,980 INFO L225 Difference]: With dead ends: 20 [2022-04-08 10:31:27,981 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 10:31:27,981 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:31:27,984 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:31:27,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:31:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 10:31:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-08 10:31:27,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:31:27,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:31:27,990 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:31:27,990 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:31:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:27,992 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:31:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:31:27,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:27,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:27,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-08 10:31:27,993 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 15 states. [2022-04-08 10:31:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:27,994 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:31:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:31:27,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:27,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:27,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:31:27,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:31:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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:31:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-08 10:31:27,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-08 10:31:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:31:27,997 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-08 10:31:27,998 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:31:27,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-08 10:31:28,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-08 10:31:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:31:28,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:31:28,011 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:31:28,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:31:28,011 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:31:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:31:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 615626395, now seen corresponding path program 1 times [2022-04-08 10:31:28,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:28,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [172363948] [2022-04-08 10:31:28,030 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:31:28,030 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:31:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash 615626395, now seen corresponding path program 2 times [2022-04-08 10:31:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:31:28,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297981590] [2022-04-08 10:31:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:31:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:31:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:31:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:28,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {264#true} is VALID [2022-04-08 10:31:28,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:31:28,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {264#true} {264#true} #38#return; {264#true} is VALID [2022-04-08 10:31:28,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:31:28,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {264#true} is VALID [2022-04-08 10:31:28,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:31:28,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #38#return; {264#true} is VALID [2022-04-08 10:31:28,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret5 := main(); {264#true} is VALID [2022-04-08 10:31:28,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#true} ~x~0 := 0; {269#(= main_~x~0 0)} is VALID [2022-04-08 10:31:28,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#(= main_~x~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {269#(= main_~x~0 0)} is VALID [2022-04-08 10:31:28,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(= main_~x~0 0)} assume !!(0 != #t~nondet4);havoc #t~nondet4;~x~0 := 4 + ~x~0; {270#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} is VALID [2022-04-08 10:31:28,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {270#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {270#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} is VALID [2022-04-08 10:31:28,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {270#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} assume !(0 != #t~nondet4);havoc #t~nondet4; {270#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} is VALID [2022-04-08 10:31:28,159 INFO L272 TraceCheckUtils]: 10: Hoare triple {270#(and (<= main_~x~0 (* (div main_~x~0 4) 4)) (not (<= (div main_~x~0 4) 0)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 4 then ~x~0 % 4294967296 % 4 - 4 else ~x~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {271#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:31:28,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {272#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:31:28,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {272#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {265#false} is VALID [2022-04-08 10:31:28,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#false} assume !false; {265#false} is VALID [2022-04-08 10:31:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:31:28,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297981590] [2022-04-08 10:31:28,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297981590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:31:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601864776] [2022-04-08 10:31:28,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:31:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:31:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:31:28,163 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:31:28,184 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:31:28,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:31:28,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:31:28,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:31:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:31:28,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:31:28,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2022-04-08 10:31:28,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#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(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {264#true} is VALID [2022-04-08 10:31:28,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:31:28,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #38#return; {264#true} is VALID [2022-04-08 10:31:28,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret5 := main(); {264#true} is VALID [2022-04-08 10:31:28,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#true} ~x~0 := 0; {269#(= main_~x~0 0)} is VALID [2022-04-08 10:31:28,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#(= main_~x~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {269#(= main_~x~0 0)} is VALID [2022-04-08 10:31:28,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(= main_~x~0 0)} assume !!(0 != #t~nondet4);havoc #t~nondet4;~x~0 := 4 + ~x~0; {298#(= (+ main_~x~0 (- 4)) 0)} is VALID [2022-04-08 10:31:28,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(= (+ main_~x~0 (- 4)) 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {298#(= (+ main_~x~0 (- 4)) 0)} is VALID [2022-04-08 10:31:28,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {298#(= (+ main_~x~0 (- 4)) 0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {298#(= (+ main_~x~0 (- 4)) 0)} is VALID [2022-04-08 10:31:28,382 INFO L272 TraceCheckUtils]: 10: Hoare triple {298#(= (+ main_~x~0 (- 4)) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 4 then ~x~0 % 4294967296 % 4 - 4 else ~x~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:31:28,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:31:28,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {265#false} is VALID [2022-04-08 10:31:28,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#false} assume !false; {265#false} is VALID [2022-04-08 10:31:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:31:28,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:31:28,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#false} assume !false; {265#false} is VALID [2022-04-08 10:31:28,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {265#false} is VALID [2022-04-08 10:31:28,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {308#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:31:28,521 INFO L272 TraceCheckUtils]: 10: Hoare triple {328#(= (mod main_~x~0 4) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 4 then ~x~0 % 4294967296 % 4 - 4 else ~x~0 % 4294967296 % 4) % 4294967296 then 1 else 0)); {308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:31:28,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#(= (mod main_~x~0 4) 0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {328#(= (mod main_~x~0 4) 0)} is VALID [2022-04-08 10:31:28,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(= (mod main_~x~0 4) 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {328#(= (mod main_~x~0 4) 0)} is VALID [2022-04-08 10:31:28,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {328#(= (mod main_~x~0 4) 0)} assume !!(0 != #t~nondet4);havoc #t~nondet4;~x~0 := 4 + ~x~0; {328#(= (mod main_~x~0 4) 0)} is VALID [2022-04-08 10:31:28,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {328#(= (mod main_~x~0 4) 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {328#(= (mod main_~x~0 4) 0)} is VALID [2022-04-08 10:31:28,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#true} ~x~0 := 0; {328#(= (mod main_~x~0 4) 0)} is VALID [2022-04-08 10:31:28,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret5 := main(); {264#true} is VALID [2022-04-08 10:31:28,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #38#return; {264#true} is VALID [2022-04-08 10:31:28,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:31:28,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#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(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(52, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {264#true} is VALID [2022-04-08 10:31:28,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2022-04-08 10:31:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:31:28,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601864776] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:31:28,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:31:28,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-08 10:31:28,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:31:28,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [172363948] [2022-04-08 10:31:28,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [172363948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:31:28,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:31:28,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:31:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482511347] [2022-04-08 10:31:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:31:28,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2022-04-08 10:31:28,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:31:28,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:31:28,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:28,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:31:28,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:31:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:31:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:31:28,537 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:31:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:28,572 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-08 10:31:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:31:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 14 [2022-04-08 10:31:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:31:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:31:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-08 10:31:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:31:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-08 10:31:28,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2022-04-08 10:31:28,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:31:28,583 INFO L225 Difference]: With dead ends: 15 [2022-04-08 10:31:28,583 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:31:28,584 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:31:28,584 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:31:28,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:31:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:31:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:31:28,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:31:28,595 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:31:28,595 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:31:28,595 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:31:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:28,595 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:31:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:31:28,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:28,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:28,595 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:31:28,595 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:31:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:31:28,596 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:31:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:31:28,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:28,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:31:28,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:31:28,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:31:28,596 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:31:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:31:28,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-08 10:31:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:31:28,596 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:31:28,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:31:28,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:31:28,597 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:31:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:31:28,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:31:28,599 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:31:28,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:31:28,805 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:31:28,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:31:28,889 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 10:31:28,889 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 10:31:28,889 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 10:31:28,889 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2022-04-08 10:31:28,889 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 11 18) the Hoare annotation is: true [2022-04-08 10:31:28,889 INFO L885 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-08 10:31:28,889 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 11 18) the Hoare annotation is: true [2022-04-08 10:31:28,889 INFO L878 garLoopResultBuilder]: At program point L13-1(lines 13 15) the Hoare annotation is: (= (mod main_~x~0 4) 0) [2022-04-08 10:31:28,889 INFO L878 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (= (mod main_~x~0 4) 0) [2022-04-08 10:31:28,890 INFO L878 garLoopResultBuilder]: At program point L13-4(lines 13 15) the Hoare annotation is: (= (mod main_~x~0 4) 0) [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-08 10:31:28,890 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:31:28,891 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) 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:31:28,891 INFO L885 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-08 10:31:28,891 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:31:28,893 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 10:31:28,894 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:31:28,896 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:31:28,898 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:31:28,900 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:31:28,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:31:28 BoogieIcfgContainer [2022-04-08 10:31:28,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:31:28,907 INFO L158 Benchmark]: Toolchain (without parser) took 2197.17ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 127.2MB in the beginning and 149.8MB in the end (delta: -22.6MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-08 10:31:28,907 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:31:28,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.68ms. Allocated memory is still 175.1MB. Free memory was 127.1MB in the beginning and 153.0MB in the end (delta: -25.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-08 10:31:28,908 INFO L158 Benchmark]: Boogie Preprocessor took 33.34ms. Allocated memory is still 175.1MB. Free memory was 153.0MB in the beginning and 151.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:31:28,908 INFO L158 Benchmark]: RCFGBuilder took 192.41ms. Allocated memory is still 175.1MB. Free memory was 151.4MB in the beginning and 141.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 10:31:28,908 INFO L158 Benchmark]: TraceAbstraction took 1710.92ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 141.0MB in the beginning and 149.8MB in the end (delta: -8.8MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2022-04-08 10:31:28,909 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.11ms. Allocated memory is still 175.1MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.68ms. Allocated memory is still 175.1MB. Free memory was 127.1MB in the beginning and 153.0MB in the end (delta: -25.9MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.34ms. Allocated memory is still 175.1MB. Free memory was 153.0MB in the beginning and 151.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 192.41ms. Allocated memory is still 175.1MB. Free memory was 151.4MB in the beginning and 141.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1710.92ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 141.0MB in the beginning and 149.8MB in the end (delta: -8.8MB). Peak memory consumption was 27.9MB. 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: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 45 NumberOfFragments, 58 HoareAnnotationTreeSize, 32 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 43 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x % 4 == 0 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 10:31:28,936 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...