/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/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:26,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:26,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:26,899 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:26,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:26,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:26,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:26,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:26,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:26,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:26,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:26,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:26,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:26,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:26,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:26,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:26,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:26,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:26,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:26,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:26,924 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:26,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:26,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:26,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:26,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:26,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:26,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:26,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:26,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:26,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:26,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:26,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:26,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:26,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:26,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:26,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:26,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:26,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:26,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:26,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:26,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:26,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:26,942 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:31:26,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:26,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:26,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:26,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:26,972 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:26,972 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:26,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:26,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:26,974 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:26,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:26,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:26,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:26,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:26,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:26,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:26,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:26,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:26,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:26,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:26,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:26,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:26,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:26,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:26,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:26,978 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:26,978 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:26,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:26,978 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:31:27,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:27,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:27,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:27,218 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:27,219 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:27,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-27 10:31:27,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15ede60f/ea90f79eab2441abbddfb5f16948167f/FLAGc014e5d58 [2022-04-27 10:31:27,639 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:27,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-27 10:31:27,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15ede60f/ea90f79eab2441abbddfb5f16948167f/FLAGc014e5d58 [2022-04-27 10:31:28,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15ede60f/ea90f79eab2441abbddfb5f16948167f [2022-04-27 10:31:28,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:28,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:28,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:28,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:28,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:28,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426493a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28, skipping insertion in model container [2022-04-27 10:31:28,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:28,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:28,250 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/diamond_1-1.c[373,386] [2022-04-27 10:31:28,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:28,268 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:28,279 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/diamond_1-1.c[373,386] [2022-04-27 10:31:28,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:28,293 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:28,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28 WrapperNode [2022-04-27 10:31:28,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:28,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:28,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:28,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:28,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:28,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:28,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:28,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:28,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (1/1) ... [2022-04-27 10:31:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:28,345 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:31:28,357 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:31:28,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:28,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:28,378 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:28,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:28,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:28,428 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:28,429 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:28,521 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:28,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:28,527 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:31:28,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:28 BoogieIcfgContainer [2022-04-27 10:31:28,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:28,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:28,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:28,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:28,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:28" (1/3) ... [2022-04-27 10:31:28,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50598691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:28, skipping insertion in model container [2022-04-27 10:31:28,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:28" (2/3) ... [2022-04-27 10:31:28,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50598691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:28, skipping insertion in model container [2022-04-27 10:31:28,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:28" (3/3) ... [2022-04-27 10:31:28,536 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2022-04-27 10:31:28,548 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:28,549 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:28,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:28,593 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@63eb800a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62a93e1 [2022-04-27 10:31:28,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-27 10:31:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:28,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:28,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:28,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:28,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:28,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-27 10:31:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:28,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006175821] [2022-04-27 10:31:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:28,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-27 10:31:28,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:31:28,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-27 10:31:28,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:28,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-27 10:31:28,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-27 10:31:28,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-27 10:31:28,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-27 10:31:28,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-27 10:31:28,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-27 10:31:28,789 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-27 10:31:28,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-27 10:31:28,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-27 10:31:28,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-27 10:31:28,790 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:31:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006175821] [2022-04-27 10:31:28,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006175821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:28,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:28,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:28,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537827634] [2022-04-27 10:31:28,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:28,798 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-27 10:31:28,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:28,802 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-27 10:31:28,825 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:31:28,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:28,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:28,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:28,844 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-27 10:31:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:28,908 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-27 10:31:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:28,908 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-27 10:31:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:28,909 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-27 10:31:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 10:31:28,916 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-27 10:31:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 10:31:28,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-27 10:31:28,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:28,976 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:31:28,976 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:31:28,978 INFO L412 NwaCegarLoop]: 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-27 10:31:28,981 INFO L413 NwaCegarLoop]: 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-27 10:31:28,982 INFO L414 NwaCegarLoop]: 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-27 10:31:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:31:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:31:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:29,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:31:29,008 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:31:29,008 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:31:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,011 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 10:31:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:31:29,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:29,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:29,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:31:29,012 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:31:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,014 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 10:31:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:31:29,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:29,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:29,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:29,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:31:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 10:31:29,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 10:31:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:29,019 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 10:31:29,019 INFO L496 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-27 10:31:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 10:31:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:29,020 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:29,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:29,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:29,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-27 10:31:29,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:29,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582205048] [2022-04-27 10:31:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:29,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:29,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(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(14, 2);call #Ultimate.allocInit(12, 3); {115#true} is VALID [2022-04-27 10:31:29,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} assume true; {115#true} is VALID [2022-04-27 10:31:29,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} #42#return; {115#true} is VALID [2022-04-27 10:31:29,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} call ULTIMATE.init(); {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:29,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(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(14, 2);call #Ultimate.allocInit(12, 3); {115#true} is VALID [2022-04-27 10:31:29,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} assume true; {115#true} is VALID [2022-04-27 10:31:29,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} #42#return; {115#true} is VALID [2022-04-27 10:31:29,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} call #t~ret6 := main(); {115#true} is VALID [2022-04-27 10:31:29,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {120#(= main_~x~0 0)} is VALID [2022-04-27 10:31:29,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {116#false} is VALID [2022-04-27 10:31:29,129 INFO L272 TraceCheckUtils]: 7: Hoare triple {116#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {116#false} is VALID [2022-04-27 10:31:29,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} ~cond := #in~cond; {116#false} is VALID [2022-04-27 10:31:29,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} assume 0 == ~cond; {116#false} is VALID [2022-04-27 10:31:29,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} assume !false; {116#false} is VALID [2022-04-27 10:31:29,130 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:31:29,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582205048] [2022-04-27 10:31:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582205048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:29,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:29,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467223950] [2022-04-27 10:31:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:29,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:29,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,148 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:31:29,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:29,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:29,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:29,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:29,149 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,236 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 10:31:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:29,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 10:31:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 10:31:29,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-27 10:31:29,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:29,316 INFO L225 Difference]: With dead ends: 20 [2022-04-27 10:31:29,316 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 10:31:29,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:29,318 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:29,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 10:31:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-27 10:31:29,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:29,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 10:31:29,323 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 10:31:29,323 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 10:31:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,325 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 10:31:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 10:31:29,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:29,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:29,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 10:31:29,326 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 10:31:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:29,327 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 10:31:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 10:31:29,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:29,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:29,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:29,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-27 10:31:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 10:31:29,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 10:31:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:29,330 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 10:31:29,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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:31:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 10:31:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:31:29,331 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:29,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:29,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:29,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-27 10:31:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:29,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286856438] [2022-04-27 10:31:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:29,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:29,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#(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(14, 2);call #Ultimate.allocInit(12, 3); {208#true} is VALID [2022-04-27 10:31:29,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:29,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:29,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {215#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:29,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#(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(14, 2);call #Ultimate.allocInit(12, 3); {208#true} is VALID [2022-04-27 10:31:29,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:29,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:29,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2022-04-27 10:31:29,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:29,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:29,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {214#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:31:29,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {214#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {209#false} is VALID [2022-04-27 10:31:29,430 INFO L272 TraceCheckUtils]: 9: Hoare triple {209#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {209#false} is VALID [2022-04-27 10:31:29,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2022-04-27 10:31:29,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:31:29,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:31:29,431 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:31:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:29,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286856438] [2022-04-27 10:31:29,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286856438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:29,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673101781] [2022-04-27 10:31:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:29,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:29,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:29,434 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:31:29,444 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:31:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:29,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:31:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:29,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:29,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-27 10:31:29,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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(14, 2);call #Ultimate.allocInit(12, 3); {208#true} is VALID [2022-04-27 10:31:29,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:29,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:29,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2022-04-27 10:31:29,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:29,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {213#(= main_~x~0 0)} is VALID [2022-04-27 10:31:29,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {240#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-27 10:31:29,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} assume !(~x~0 % 4294967296 < 99); {240#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} is VALID [2022-04-27 10:31:29,991 INFO L272 TraceCheckUtils]: 9: Hoare triple {240#(and (not (= (mod main_~y~0 2) 0)) (= main_~x~0 1))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:29,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:29,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:31:29,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:31:29,992 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:31:29,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:30,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-27 10:31:30,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {209#false} is VALID [2022-04-27 10:31:30,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:30,479 INFO L272 TraceCheckUtils]: 9: Hoare triple {267#(= (mod main_~x~0 2) (mod main_~y~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:30,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(= (mod main_~x~0 2) (mod main_~y~0 2))} assume !(~x~0 % 4294967296 < 99); {267#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:30,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#(<= 1 (mod (+ main_~x~0 1) 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {267#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-27 10:31:30,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(<= 1 (mod (+ main_~x~0 1) 2))} assume !!(~x~0 % 4294967296 < 99); {274#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:30,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {274#(<= 1 (mod (+ main_~x~0 1) 2))} is VALID [2022-04-27 10:31:30,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret6 := main(); {208#true} is VALID [2022-04-27 10:31:30,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #42#return; {208#true} is VALID [2022-04-27 10:31:30,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-27 10:31:30,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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(14, 2);call #Ultimate.allocInit(12, 3); {208#true} is VALID [2022-04-27 10:31:30,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-27 10:31:30,482 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:31:30,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673101781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:30,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:30,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-04-27 10:31:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27014759] [2022-04-27 10:31:30,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:30,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:31:30,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:30,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:30,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:30,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 10:31:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 10:31:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:31:30,509 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:30,798 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 10:31:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:31:30,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:31:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-27 10:31:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-27 10:31:30,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2022-04-27 10:31:30,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:30,843 INFO L225 Difference]: With dead ends: 32 [2022-04-27 10:31:30,843 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 10:31:30,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:31:30,845 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:30,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 36 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 10:31:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2022-04-27 10:31:30,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:30,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:31:30,852 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:31:30,852 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:31:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:30,853 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:31:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:31:30,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:30,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:30,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 19 states. [2022-04-27 10:31:30,854 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 19 states. [2022-04-27 10:31:30,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:30,856 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 10:31:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-27 10:31:30,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:30,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:30,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:30,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:31:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:31:30,858 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-27 10:31:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:30,858 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:31:30,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:31:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:31:30,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:30,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:30,889 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:31:31,072 WARN L477 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-27 10:31:31,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:31,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 2 times [2022-04-27 10:31:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:31,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258657098] [2022-04-27 10:31:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:31,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#(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(14, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-04-27 10:31:31,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#true} assume true; {424#true} is VALID [2022-04-27 10:31:31,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {424#true} {424#true} #42#return; {424#true} is VALID [2022-04-27 10:31:31,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:31,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#(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(14, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-04-27 10:31:31,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2022-04-27 10:31:31,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #42#return; {424#true} is VALID [2022-04-27 10:31:31,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret6 := main(); {424#true} is VALID [2022-04-27 10:31:31,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {429#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {429#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:31,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:31,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {431#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:31,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {425#false} is VALID [2022-04-27 10:31:31,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {425#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {425#false} is VALID [2022-04-27 10:31:31,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2022-04-27 10:31:31,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {425#false} assume 0 == ~cond; {425#false} is VALID [2022-04-27 10:31:31,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {425#false} assume !false; {425#false} is VALID [2022-04-27 10:31:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:31,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258657098] [2022-04-27 10:31:31,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258657098] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:31,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418129818] [2022-04-27 10:31:31,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:31:31,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:31,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:31,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:31,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:31:31,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:31:31,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:31,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:31:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:31,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:31,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {424#true} is VALID [2022-04-27 10:31:31,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#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(14, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-04-27 10:31:31,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2022-04-27 10:31:31,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #42#return; {424#true} is VALID [2022-04-27 10:31:31,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret6 := main(); {424#true} is VALID [2022-04-27 10:31:31,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {429#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {429#(= main_~x~0 0)} is VALID [2022-04-27 10:31:31,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:31,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:31,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:31,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {425#false} is VALID [2022-04-27 10:31:31,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {425#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {425#false} is VALID [2022-04-27 10:31:31,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2022-04-27 10:31:31,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {425#false} assume 0 == ~cond; {425#false} is VALID [2022-04-27 10:31:31,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {425#false} assume !false; {425#false} is VALID [2022-04-27 10:31:31,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:31,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {425#false} assume !false; {425#false} is VALID [2022-04-27 10:31:31,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {425#false} assume 0 == ~cond; {425#false} is VALID [2022-04-27 10:31:31,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {425#false} ~cond := #in~cond; {425#false} is VALID [2022-04-27 10:31:31,530 INFO L272 TraceCheckUtils]: 11: Hoare triple {425#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {425#false} is VALID [2022-04-27 10:31:31,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {491#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {425#false} is VALID [2022-04-27 10:31:31,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {491#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:31,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {495#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:31:31,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {495#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-27 10:31:31,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {502#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:31,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {502#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-27 10:31:31,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {424#true} call #t~ret6 := main(); {424#true} is VALID [2022-04-27 10:31:31,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {424#true} {424#true} #42#return; {424#true} is VALID [2022-04-27 10:31:31,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {424#true} assume true; {424#true} is VALID [2022-04-27 10:31:31,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {424#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(14, 2);call #Ultimate.allocInit(12, 3); {424#true} is VALID [2022-04-27 10:31:31,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {424#true} call ULTIMATE.init(); {424#true} is VALID [2022-04-27 10:31:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:31,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418129818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:31:31,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:31:31,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-27 10:31:31,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466144508] [2022-04-27 10:31:31,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:31:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:31:31,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:31,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 10:31:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 10:31:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-27 10:31:31,591 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,852 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-04-27 10:31:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:31:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:31:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-27 10:31:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-27 10:31:31,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-27 10:31:31,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:31,889 INFO L225 Difference]: With dead ends: 31 [2022-04-27 10:31:31,889 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:31:31,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:31:31,890 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:31,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:31:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-27 10:31:31,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:31,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,903 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,903 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,907 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-27 10:31:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-27 10:31:31,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:31,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:31,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-27 10:31:31,908 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-27 10:31:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:31,910 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-27 10:31:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-27 10:31:31,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:31,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:31,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:31,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-27 10:31:31,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 15 [2022-04-27 10:31:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:31,912 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-27 10:31:31,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-27 10:31:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:31:31,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:31,912 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:31,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:32,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:31:32,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1715393034, now seen corresponding path program 3 times [2022-04-27 10:31:32,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:32,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330855035] [2022-04-27 10:31:32,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:32,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:32,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(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(14, 2);call #Ultimate.allocInit(12, 3); {674#true} is VALID [2022-04-27 10:31:32,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-27 10:31:32,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {674#true} {674#true} #42#return; {674#true} is VALID [2022-04-27 10:31:32,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:32,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#(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(14, 2);call #Ultimate.allocInit(12, 3); {674#true} is VALID [2022-04-27 10:31:32,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-27 10:31:32,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #42#return; {674#true} is VALID [2022-04-27 10:31:32,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret6 := main(); {674#true} is VALID [2022-04-27 10:31:32,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {679#(= main_~x~0 0)} is VALID [2022-04-27 10:31:32,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {679#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {679#(= main_~x~0 0)} is VALID [2022-04-27 10:31:32,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {679#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {680#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:32,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {680#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {680#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:31:32,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {681#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:32,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {681#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:32,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {682#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:32,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {682#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:31:32,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {682#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {683#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:32,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {683#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {683#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:31:32,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {683#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {684#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:32,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {684#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {684#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 10:31:32,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {684#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {685#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 10:31:32,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {685#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {675#false} is VALID [2022-04-27 10:31:32,312 INFO L272 TraceCheckUtils]: 19: Hoare triple {675#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {675#false} is VALID [2022-04-27 10:31:32,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2022-04-27 10:31:32,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2022-04-27 10:31:32,312 INFO L290 TraceCheckUtils]: 22: Hoare triple {675#false} assume !false; {675#false} is VALID [2022-04-27 10:31:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330855035] [2022-04-27 10:31:32,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330855035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900629071] [2022-04-27 10:31:32,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:31:32,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:32,315 INFO L229 MonitoredProcess]: Starting monitored process 4 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:31:32,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 10:31:32,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 10:31:32,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:31:32,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:31:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:32,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:33,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {674#true} is VALID [2022-04-27 10:31:33,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#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(14, 2);call #Ultimate.allocInit(12, 3); {674#true} is VALID [2022-04-27 10:31:33,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2022-04-27 10:31:33,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#true} {674#true} #42#return; {674#true} is VALID [2022-04-27 10:31:33,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#true} call #t~ret6 := main(); {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#true} assume !!(~x~0 % 4294967296 < 99); {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {674#true} assume !!(~x~0 % 4294967296 < 99); {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {674#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {674#true} assume !!(~x~0 % 4294967296 < 99); {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {674#true} is VALID [2022-04-27 10:31:33,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {674#true} assume !!(~x~0 % 4294967296 < 99); {674#true} is VALID [2022-04-27 10:31:33,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {674#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {674#true} is VALID [2022-04-27 10:31:33,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {674#true} assume !!(~x~0 % 4294967296 < 99); {674#true} is VALID [2022-04-27 10:31:33,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {674#true} is VALID [2022-04-27 10:31:33,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {674#true} assume !!(~x~0 % 4294967296 < 99); {738#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-27 10:31:33,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {738#(< (mod main_~x~0 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {742#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99))} is VALID [2022-04-27 10:31:33,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {742#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99))} assume !(~x~0 % 4294967296 < 99); {746#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} is VALID [2022-04-27 10:31:33,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {746#(and (not (= (mod main_~y~0 2) 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99) (not (< (mod main_~x~0 4294967296) 99)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:33,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:33,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {675#false} is VALID [2022-04-27 10:31:33,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {675#false} assume !false; {675#false} is VALID [2022-04-27 10:31:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-27 10:31:33,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:31:33,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900629071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:33,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:31:33,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-04-27 10:31:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978447485] [2022-04-27 10:31:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 10:31:33,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:33,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,389 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-27 10:31:33,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:31:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:31:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:31:33,390 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:33,553 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-27 10:31:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:31:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 10:31:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-27 10:31:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2022-04-27 10:31:33,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 15 transitions. [2022-04-27 10:31:33,603 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-27 10:31:33,603 INFO L225 Difference]: With dead ends: 24 [2022-04-27 10:31:33,604 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:31:33,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:31:33,605 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:33,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:31:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:31:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:31:33,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:33,606 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:31:33,606 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:31:33,606 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:31:33,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:33,607 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:31:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:33,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:33,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:33,607 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:31:33,607 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:31:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:33,607 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:31:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:33,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:33,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:33,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:33,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:33,607 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:31:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:31:33,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 10:31:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:33,608 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:31:33,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:33,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:33,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:31:33,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:33,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:33,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:31:33,982 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:31:33,982 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:31:33,982 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:31:33,982 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2022-04-27 10:31:33,982 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 13 26) no Hoare annotation was computed. [2022-04-27 10:31:33,983 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 22) no Hoare annotation was computed. [2022-04-27 10:31:33,983 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 23) the Hoare annotation is: (let ((.cse0 (mod main_~y~0 2))) (or (= main_~x~0 0) (and (not (= .cse0 0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 99)) (and (<= 1 (mod (+ main_~x~0 1) 2)) (= (mod main_~x~0 2) .cse0)))) [2022-04-27 10:31:33,983 INFO L895 garLoopResultBuilder]: At program point L17-2(lines 17 23) the Hoare annotation is: (= (mod main_~x~0 2) (mod main_~y~0 2)) [2022-04-27 10:31:33,983 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 13 26) no Hoare annotation was computed. [2022-04-27 10:31:33,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:31:33,983 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:31:33,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:31:33,983 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:31:33,983 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:31:33,983 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:31:33,984 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:31:33,984 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2022-04-27 10:31:33,984 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2022-04-27 10:31:33,984 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 10:31:33,984 INFO L899 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2022-04-27 10:31:33,984 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2022-04-27 10:31:33,984 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2022-04-27 10:31:33,986 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 10:31:33,988 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:31:33,991 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:31:33,992 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:31:33,993 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:33,993 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:31:33,993 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:31:33,993 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 10:31:34,008 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:31:34,009 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:31:34,009 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:31:34,009 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:31:34,009 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:31:34,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:31:34 BoogieIcfgContainer [2022-04-27 10:31:34,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:31:34,018 INFO L158 Benchmark]: Toolchain (without parser) took 5940.77ms. Allocated memory was 169.9MB in the beginning and 227.5MB in the end (delta: 57.7MB). Free memory was 119.6MB in the beginning and 203.7MB in the end (delta: -84.1MB). Peak memory consumption was 107.2MB. Max. memory is 8.0GB. [2022-04-27 10:31:34,018 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 169.9MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:31:34,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.41ms. Allocated memory is still 169.9MB. Free memory was 119.4MB in the beginning and 145.6MB in the end (delta: -26.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-27 10:31:34,018 INFO L158 Benchmark]: Boogie Preprocessor took 22.83ms. Allocated memory is still 169.9MB. Free memory was 145.6MB in the beginning and 144.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:31:34,019 INFO L158 Benchmark]: RCFGBuilder took 210.37ms. Allocated memory is still 169.9MB. Free memory was 144.0MB in the beginning and 133.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:31:34,019 INFO L158 Benchmark]: TraceAbstraction took 5486.13ms. Allocated memory was 169.9MB in the beginning and 227.5MB in the end (delta: 57.7MB). Free memory was 133.1MB in the beginning and 203.7MB in the end (delta: -70.6MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2022-04-27 10:31:34,020 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 169.9MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.41ms. Allocated memory is still 169.9MB. Free memory was 119.4MB in the beginning and 145.6MB in the end (delta: -26.2MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.83ms. Allocated memory is still 169.9MB. Free memory was 145.6MB in the beginning and 144.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 210.37ms. Allocated memory is still 169.9MB. Free memory was 144.0MB in the beginning and 133.8MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5486.13ms. Allocated memory was 169.9MB in the beginning and 227.5MB in the end (delta: 57.7MB). Free memory was 133.1MB in the beginning and 203.7MB in the end (delta: -70.6MB). Peak memory consumption was 120.6MB. 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 143 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 57 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 24 NumberOfFragments, 51 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 254 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 124 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 435 SizeOfPredicates, 4 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 36/87 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 == 0 || (!(y % 2 == 0) && (x + 4294967295) % 4294967296 < 99)) || (1 <= (x + 1) % 2 && x % 2 == y % 2) RESULT: Ultimate proved your program to be correct! [2022-04-27 10:31:34,039 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...