/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-industry-pattern/mod3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:58:24,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:58:24,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:58:24,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:58:24,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:58:24,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:58:24,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:58:24,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:58:24,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:58:24,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:58:24,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:58:24,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:58:24,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:58:24,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:58:24,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:58:24,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:58:24,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:58:24,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:58:24,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:58:24,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:58:24,693 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:58:24,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:58:24,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:58:24,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:58:24,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:58:24,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:58:24,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:58:24,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:58:24,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:58:24,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:58:24,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:58:24,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:58:24,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:58:24,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:58:24,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:58:24,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:58:24,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:58:24,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:58:24,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:58:24,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:58:24,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:58:24,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:58:24,704 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:58:24,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:58:24,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:58:24,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:58:24,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:58:24,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:58:24,719 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:58:24,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:58:24,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:58:24,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:58:24,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:58:24,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:58:24,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:58:24,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:58:24,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:58:24,723 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:58:24,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:58:24,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:58:24,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:58:24,948 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:58:24,949 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:58:24,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-27 10:58:24,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb01ff23/fdc5de125bda4fc3b4f6ae1ac92209f0/FLAG40b88c8c3 [2022-04-27 10:58:25,346 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:58:25,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c [2022-04-27 10:58:25,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb01ff23/fdc5de125bda4fc3b4f6ae1ac92209f0/FLAG40b88c8c3 [2022-04-27 10:58:25,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb01ff23/fdc5de125bda4fc3b4f6ae1ac92209f0 [2022-04-27 10:58:25,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:58:25,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:58:25,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:58:25,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:58:25,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:58:25,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f8fe5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25, skipping insertion in model container [2022-04-27 10:58:25,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:58:25,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:58:25,490 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-industry-pattern/mod3.c[394,407] [2022-04-27 10:58:25,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:58:25,508 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:58:25,516 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-industry-pattern/mod3.c[394,407] [2022-04-27 10:58:25,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:58:25,527 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:58:25,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25 WrapperNode [2022-04-27 10:58:25,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:58:25,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:58:25,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:58:25,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:58:25,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:58:25,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:58:25,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:58:25,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:58:25,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (1/1) ... [2022-04-27 10:58:25,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:58:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:58:25,589 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:58:25,590 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:58:25,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:58:25,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:58:25,613 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:58:25,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:58:25,615 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:58:25,615 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:58:25,615 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:58:25,615 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:58:25,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:58:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:58:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:58:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:58:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:58:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:58:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:58:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:58:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:58:25,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:58:25,660 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:58:25,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:58:30,155 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:58:30,160 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:58:30,160 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:58:30,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:58:30 BoogieIcfgContainer [2022-04-27 10:58:30,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:58:30,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:58:30,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:58:30,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:58:30,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:58:25" (1/3) ... [2022-04-27 10:58:30,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487b60ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:58:30, skipping insertion in model container [2022-04-27 10:58:30,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:25" (2/3) ... [2022-04-27 10:58:30,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487b60ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:58:30, skipping insertion in model container [2022-04-27 10:58:30,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:58:30" (3/3) ... [2022-04-27 10:58:30,167 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c [2022-04-27 10:58:30,175 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:58:30,176 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:58:30,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:58:30,207 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@7b5e2ac3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69c1efff [2022-04-27 10:58:30,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:58:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 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:58:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:58:30,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:30,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:30,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:30,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1060463359, now seen corresponding path program 1 times [2022-04-27 10:58:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:30,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116181924] [2022-04-27 10:58:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:30,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 10:58:30,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:58:30,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-27 10:58:30,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:30,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 10:58:30,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 10:58:30,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2022-04-27 10:58:30,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret7 := main(); {27#true} is VALID [2022-04-27 10:58:30,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {27#true} is VALID [2022-04-27 10:58:30,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-27 10:58:30,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume 0 == ~y~0 % 4294967296; {28#false} is VALID [2022-04-27 10:58:30,403 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-27 10:58:30,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-27 10:58:30,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-27 10:58:30,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 10:58:30,404 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:58:30,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:58:30,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116181924] [2022-04-27 10:58:30,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116181924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:58:30,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:58:30,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:58:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921040605] [2022-04-27 10:58:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:58:30,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:58:30,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:58:30,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:30,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:30,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:58:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:58:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:58:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:58:30,456 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:39,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:39,223 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-27 10:58:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:58:39,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:58:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:58:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 10:58:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-27 10:58:39,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-27 10:58:39,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:39,319 INFO L225 Difference]: With dead ends: 38 [2022-04-27 10:58:39,319 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:58:39,321 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:58:39,323 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:58:39,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 10:58:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:58:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:58:39,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:58:39,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:58:39,359 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:58:39,360 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:58:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:39,362 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 10:58:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 10:58:39,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:39,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:39,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 17 states. [2022-04-27 10:58:39,363 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 17 states. [2022-04-27 10:58:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:39,364 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-27 10:58:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 10:58:39,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:39,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:39,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:58:39,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:58:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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:58:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-27 10:58:39,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-27 10:58:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:58:39,367 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-27 10:58:39,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-27 10:58:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:58:39,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:39,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:39,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:58:39,369 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1839610256, now seen corresponding path program 1 times [2022-04-27 10:58:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:39,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435323085] [2022-04-27 10:58:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:39,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {140#true} is VALID [2022-04-27 10:58:39,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-27 10:58:39,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #60#return; {140#true} is VALID [2022-04-27 10:58:39,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:39,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {140#true} is VALID [2022-04-27 10:58:39,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume true; {140#true} is VALID [2022-04-27 10:58:39,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140#true} {140#true} #60#return; {140#true} is VALID [2022-04-27 10:58:39,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {140#true} call #t~ret7 := main(); {140#true} is VALID [2022-04-27 10:58:39,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {145#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 10:58:39,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(= (+ (- 1) main_~y~0) 0)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {145#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 10:58:39,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#(= (+ (- 1) main_~y~0) 0)} assume !(0 != #t~nondet5);havoc #t~nondet5; {145#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-27 10:58:39,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {145#(= (+ (- 1) main_~y~0) 0)} assume 0 == ~y~0 % 4294967296; {141#false} is VALID [2022-04-27 10:58:39,462 INFO L272 TraceCheckUtils]: 9: Hoare triple {141#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {141#false} is VALID [2022-04-27 10:58:39,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} ~cond := #in~cond; {141#false} is VALID [2022-04-27 10:58:39,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume 0 == ~cond; {141#false} is VALID [2022-04-27 10:58:39,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-04-27 10:58:39,463 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:58:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:58:39,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435323085] [2022-04-27 10:58:39,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435323085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:58:39,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:58:39,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:58:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123749096] [2022-04-27 10:58:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:58:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-27 10:58:39,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:58:39,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:58:39,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:39,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:58:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:58:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:58:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:58:39,476 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:58:43,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:48,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:52,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:52,585 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-27 10:58:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:58:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 13 [2022-04-27 10:58:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:58:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:58:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-27 10:58:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:58:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-27 10:58:52,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-27 10:58:52,621 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:58:52,622 INFO L225 Difference]: With dead ends: 28 [2022-04-27 10:58:52,623 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:58:52,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:58:52,624 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:58:52,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-27 10:58:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:58:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-04-27 10:58:52,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:58:52,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:52,627 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:52,627 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:52,629 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 10:58:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 10:58:52,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:52,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:58:52,629 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-27 10:58:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:52,631 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 10:58:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 10:58:52,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:52,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:52,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:58:52,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:58:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-27 10:58:52,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-04-27 10:58:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:58:52,632 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-27 10:58:52,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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:58:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 10:58:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:58:52,633 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:52,633 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:52,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:58:52,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:52,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:52,634 INFO L85 PathProgramCache]: Analyzing trace with hash -496948910, now seen corresponding path program 1 times [2022-04-27 10:58:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:52,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312494465] [2022-04-27 10:58:52,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:52,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:52,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {260#true} is VALID [2022-04-27 10:58:52,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-27 10:58:52,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #60#return; {260#true} is VALID [2022-04-27 10:58:52,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:52,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(109, 2, 0, 1);call write~init~int(111, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(51, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {260#true} is VALID [2022-04-27 10:58:52,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-27 10:58:52,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #60#return; {260#true} is VALID [2022-04-27 10:58:52,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret7 := main(); {260#true} is VALID [2022-04-27 10:58:52,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;~y~0 := 1; {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:52,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:52,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} assume !!(0 != #t~nondet5);havoc #t~nondet5; {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:55,080 WARN L290 TraceCheckUtils]: 8: Hoare triple {265#(and (<= main_~x~0 2147483647) (or (<= 0 (+ main_~x~0 2147483648)) (< 1431655764 (+ (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 1431655765)))))} assume 1 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296;~x~0 := 2 + ~x~0;~y~0 := 0; {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is UNKNOWN [2022-04-27 10:58:55,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-27 10:58:55,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} assume !(0 != #t~nondet5);havoc #t~nondet5; {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-27 10:58:55,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} assume 0 == ~y~0 % 4294967296; {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} is VALID [2022-04-27 10:58:55,090 INFO L272 TraceCheckUtils]: 12: Hoare triple {266#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0 (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) (- 3))) 4294967296) 4294967296) (* (div (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 3) 3)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 3 then ~x~0 % 4294967296 % 3 - 3 else ~x~0 % 4294967296 % 3) % 4294967296 then 1 else 0)); {267#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:58:55,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {268#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:58:55,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {261#false} is VALID [2022-04-27 10:58:55,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-04-27 10:58:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:58:55,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:58:55,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312494465] [2022-04-27 10:58:55,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312494465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:58:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775673139] [2022-04-27 10:58:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:55,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:58:55,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:58:55,094 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:58:55,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process