/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:35:00,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:35:00,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:35:00,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:35:00,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:35:00,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:35:00,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:35:00,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:35:00,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:35:00,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:35:00,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:35:00,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:35:00,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:35:00,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:35:00,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:35:00,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:35:00,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:35:00,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:35:00,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:35:00,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:35:00,311 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:35:00,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:35:00,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:35:00,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:35:00,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:35:00,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:35:00,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:35:00,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:35:00,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:35:00,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:35:00,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:35:00,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:35:00,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:35:00,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:35:00,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:35:00,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:35:00,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:35:00,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:35:00,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:35:00,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:35:00,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:35:00,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:35:00,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:35:00,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:35:00,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:35:00,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:35:00,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:35:00,348 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:35:00,348 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:35:00,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:35:00,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:35:00,348 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:35:00,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:35:00,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:35:00,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:35:00,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:35:00,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:35:00,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:35:00,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:35:00,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:35:00,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:35:00,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:35:00,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:35:00,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:35:00,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:35:00,352 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:35:00,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:35:00,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:35:00,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:35:00,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:35:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:35:00,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:35:00,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:35:00,520 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:35:00,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-27 10:35:00,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998e77b9c/1b6c1ffe37b84d5086f062c57a4d5aeb/FLAG6d730b160 [2022-04-27 10:35:00,910 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:35:00,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_3-2.c [2022-04-27 10:35:00,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998e77b9c/1b6c1ffe37b84d5086f062c57a4d5aeb/FLAG6d730b160 [2022-04-27 10:35:01,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998e77b9c/1b6c1ffe37b84d5086f062c57a4d5aeb [2022-04-27 10:35:01,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:35:01,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:35:01,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:35:01,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:35:01,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:35:01,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee9f4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01, skipping insertion in model container [2022-04-27 10:35:01,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:35:01,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:35:01,460 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-acceleration/simple_3-2.c[376,389] [2022-04-27 10:35:01,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:35:01,475 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:35:01,484 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-acceleration/simple_3-2.c[376,389] [2022-04-27 10:35:01,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:35:01,495 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:35:01,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01 WrapperNode [2022-04-27 10:35:01,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:35:01,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:35:01,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:35:01,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:35:01,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:35:01,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:35:01,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:35:01,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:35:01,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (1/1) ... [2022-04-27 10:35:01,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:35:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:35:01,547 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-27 10:35:01,554 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-27 10:35:01,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:35:01,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:35:01,574 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:35:01,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:35:01,575 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:35:01,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:35:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:35:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:35:01,614 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:35:01,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:35:01,699 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:35:01,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:35:01,704 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:35:01,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:35:01 BoogieIcfgContainer [2022-04-27 10:35:01,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:35:01,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:35:01,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:35:01,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:35:01,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:35:01" (1/3) ... [2022-04-27 10:35:01,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a36ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:35:01, skipping insertion in model container [2022-04-27 10:35:01,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:35:01" (2/3) ... [2022-04-27 10:35:01,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a36ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:35:01, skipping insertion in model container [2022-04-27 10:35:01,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:35:01" (3/3) ... [2022-04-27 10:35:01,730 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_3-2.c [2022-04-27 10:35:01,740 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:35:01,740 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:35:01,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:35:01,797 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@438e8c12, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c8929c8 [2022-04-27 10:35:01,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:35:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:35:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:35:01,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:35:01,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:35:01,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:35:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:35:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 1 times [2022-04-27 10:35:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:35:01,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234281470] [2022-04-27 10:35:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:35:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:35:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:35:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:35:02,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:35:02,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-27 10:35:02,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:35:02,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(13, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:35:02,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:35:02,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-27 10:35:02,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-27 10:35:02,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {26#(= main_~x~0 0)} is VALID [2022-04-27 10:35:02,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {26#(= main_~x~0 0)} is VALID [2022-04-27 10:35:02,074 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:35:02,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:35:02,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:35:02,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:35:02,076 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-27 10:35:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:35:02,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234281470] [2022-04-27 10:35:02,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234281470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:35:02,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:35:02,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:35:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336663037] [2022-04-27 10:35:02,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:35:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:35:02,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,105 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-27 10:35:02,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:35:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:35:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:35:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:35:02,131 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:35:02,352 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 10:35:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:35:02,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:35:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 10:35:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-27 10:35:02,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-27 10:35:02,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:35:02,405 INFO L225 Difference]: With dead ends: 37 [2022-04-27 10:35:02,405 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:35:02,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:35:02,409 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:35:02,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:35:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:35:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:35:02,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:35:02,428 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-27 10:35:02,428 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-27 10:35:02,428 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-27 10:35:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:35:02,430 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:35:02,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:35:02,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:35:02,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:35:02,431 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-27 10:35:02,431 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-27 10:35:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:35:02,432 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:35:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:35:02,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:35:02,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:35:02,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:35:02,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:35:02,433 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-27 10:35:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:35:02,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:35:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:35:02,435 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:35:02,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-27 10:35:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:35:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:35:02,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:35:02,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:35:02,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:35:02,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:35:02,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:35:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 1 times [2022-04-27 10:35:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:35:02,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941551629] [2022-04-27 10:35:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:35:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:35:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:35:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#(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(13, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-04-27 10:35:02,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:35:02,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #36#return; {136#true} is VALID [2022-04-27 10:35:02,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:35:02,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(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(13, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-04-27 10:35:02,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:35:02,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #36#return; {136#true} is VALID [2022-04-27 10:35:02,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret5 := main(); {136#true} is VALID [2022-04-27 10:35:02,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {141#(= main_~x~0 0)} is VALID [2022-04-27 10:35:02,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296);~x~0 := 2 + ~x~0; {142#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} is VALID [2022-04-27 10:35:02,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {142#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {142#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} is VALID [2022-04-27 10:35:02,525 INFO L272 TraceCheckUtils]: 8: Hoare triple {142#(and (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= 2 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:35:02,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {144#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:35:02,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {144#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {137#false} is VALID [2022-04-27 10:35:02,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-04-27 10:35:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:35:02,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:35:02,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941551629] [2022-04-27 10:35:02,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941551629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:35:02,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653010188] [2022-04-27 10:35:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:35:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:35:02,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:35:02,529 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-27 10:35:02,564 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-27 10:35:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:35:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:35:02,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:35:02,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2022-04-27 10:35:02,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#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(13, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-04-27 10:35:02,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:35:02,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #36#return; {136#true} is VALID [2022-04-27 10:35:02,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret5 := main(); {136#true} is VALID [2022-04-27 10:35:02,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {141#(= main_~x~0 0)} is VALID [2022-04-27 10:35:02,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296);~x~0 := 2 + ~x~0; {167#(= main_~x~0 2)} is VALID [2022-04-27 10:35:02,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(= main_~x~0 2)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {167#(= main_~x~0 2)} is VALID [2022-04-27 10:35:02,683 INFO L272 TraceCheckUtils]: 8: Hoare triple {167#(= main_~x~0 2)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:35:02,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:35:02,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {137#false} is VALID [2022-04-27 10:35:02,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-04-27 10:35:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:35:02,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:35:02,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-04-27 10:35:02,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {137#false} is VALID [2022-04-27 10:35:02,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:35:02,802 INFO L272 TraceCheckUtils]: 8: Hoare triple {194#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:35:02,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296); {194#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:35:02,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < ~N~0 % 65536 % 4294967296);~x~0 := 2 + ~x~0; {194#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:35:02,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} ~x~0 := 0;~N~0 := #t~nondet4;havoc #t~nondet4; {194#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:35:02,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} call #t~ret5 := main(); {136#true} is VALID [2022-04-27 10:35:02,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} #36#return; {136#true} is VALID [2022-04-27 10:35:02,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} assume true; {136#true} is VALID [2022-04-27 10:35:02,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#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(13, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-04-27 10:35:02,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2022-04-27 10:35:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:35:02,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653010188] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 10:35:02,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:35:02,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 11 [2022-04-27 10:35:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697585163] [2022-04-27 10:35:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:35:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 10:35:02,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:35:02,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-27 10:35:02,823 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-27 10:35:02,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:35:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:35:02,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:35:02,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:35:02,826 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-27 10:35:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:35:02,865 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:35:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:35:02,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-27 10:35:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:35:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-27 10:35:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-27 10:35:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-27 10:35:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-04-27 10:35:02,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 12 transitions. [2022-04-27 10:35:02,891 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-27 10:35:02,891 INFO L225 Difference]: With dead ends: 13 [2022-04-27 10:35:02,891 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:35:02,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 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-27 10:35:02,895 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:35:02,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:35:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:35:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:35:02,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:35:02,897 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-27 10:35:02,897 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-27 10:35:02,897 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-27 10:35:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:35:02,897 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:35:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:35:02,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:35:02,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:35:02,898 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-27 10:35:02,898 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-27 10:35:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:35:02,898 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:35:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:35:02,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:35:02,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:35:02,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:35:02,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:35:02,899 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-27 10:35:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:35:02,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 10:35:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:35:02,899 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:35:02,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-27 10:35:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:35:02,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:35:02,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:35:02,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:35:03,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:35:03,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:35:03,166 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:35:03,170 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:35:03,170 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:35:03,170 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 22) the Hoare annotation is: true [2022-04-27 10:35:03,170 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 22) no Hoare annotation was computed. [2022-04-27 10:35:03,170 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 19) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 10:35:03,170 INFO L895 garLoopResultBuilder]: At program point L17-3(lines 17 19) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 10:35:03,171 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 22) no Hoare annotation was computed. [2022-04-27 10:35:03,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:35:03,171 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:35:03,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:35:03,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:35:03,171 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:35:03,171 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:35:03,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:35:03,173 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-27 10:35:03,173 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-27 10:35:03,173 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 10:35:03,173 INFO L899 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-27 10:35:03,173 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-27 10:35:03,173 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-27 10:35:03,177 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 10:35:03,179 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:35:03,182 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:35:03,182 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:35:03,184 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:35:03,185 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:35:03,185 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:35:03,185 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:35:03,186 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:35:03,187 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:35:03,187 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:35:03,187 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:35:03,187 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:35:03,187 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:35:03,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:35:03 BoogieIcfgContainer [2022-04-27 10:35:03,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:35:03,193 INFO L158 Benchmark]: Toolchain (without parser) took 1858.09ms. Allocated memory is still 199.2MB. Free memory was 150.1MB in the beginning and 83.1MB in the end (delta: 66.9MB). Peak memory consumption was 66.6MB. Max. memory is 8.0GB. [2022-04-27 10:35:03,195 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 199.2MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:35:03,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.70ms. Allocated memory is still 199.2MB. Free memory was 149.9MB in the beginning and 177.0MB in the end (delta: -27.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-27 10:35:03,197 INFO L158 Benchmark]: Boogie Preprocessor took 18.37ms. Allocated memory is still 199.2MB. Free memory was 176.5MB in the beginning and 175.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:35:03,197 INFO L158 Benchmark]: RCFGBuilder took 179.02ms. Allocated memory is still 199.2MB. Free memory was 175.3MB in the beginning and 164.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:35:03,198 INFO L158 Benchmark]: TraceAbstraction took 1486.10ms. Allocated memory is still 199.2MB. Free memory was 163.9MB in the beginning and 83.1MB in the end (delta: 80.7MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2022-04-27 10:35:03,198 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.08ms. Allocated memory is still 199.2MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.70ms. Allocated memory is still 199.2MB. Free memory was 149.9MB in the beginning and 177.0MB in the end (delta: -27.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.37ms. Allocated memory is still 199.2MB. Free memory was 176.5MB in the beginning and 175.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 179.02ms. Allocated memory is still 199.2MB. Free memory was 175.3MB in the beginning and 164.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1486.10ms. Allocated memory is still 199.2MB. Free memory was 163.9MB in the beginning and 83.1MB in the end (delta: 80.7MB). Peak memory consumption was 80.7MB. 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: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 20 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 21 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 SizeOfPredicates, 1 NumberOfNonLiveVariables, 56 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, 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: 17]: Loop Invariant Derived loop invariant: x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:35:03,224 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...