/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:09:21,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:09:21,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:09:21,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:09:21,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:09:21,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:09:21,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:09:21,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:09:21,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:09:21,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:09:21,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:09:21,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:09:21,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:09:21,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:09:21,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:09:21,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:09:21,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:09:21,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:09:21,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:09:21,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:09:21,787 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:09:21,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:09:21,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:09:21,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:09:21,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:09:21,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:09:21,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:09:21,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:09:21,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:09:21,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:09:21,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:09:21,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:09:21,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:09:21,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:09:21,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:09:21,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:09:21,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:09:21,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:09:21,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:09:21,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:09:21,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:09:21,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:09:21,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:09:21,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:09:21,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:09:21,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:09:21,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:09:21,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:09:21,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:09:21,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:09:21,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:09:21,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:09:21,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:09:21,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:09:21,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:09:21,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:09:21,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:09:21,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:09:21,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:09:21,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:09:21,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:09:21,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:09:21,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:09:21,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:09:21,823 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:09:21,823 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:09:21,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:09:21,823 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:09:21,823 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 06:09:22,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:09:22,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:09:22,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:09:22,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:09:22,072 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:09:22,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c [2022-04-28 06:09:22,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a0a94ea/cc229d8ba63d4be8a047874c2983b594/FLAGfb4ca44d3 [2022-04-28 06:09:22,502 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:09:22,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c [2022-04-28 06:09:22,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a0a94ea/cc229d8ba63d4be8a047874c2983b594/FLAGfb4ca44d3 [2022-04-28 06:09:22,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a0a94ea/cc229d8ba63d4be8a047874c2983b594 [2022-04-28 06:09:22,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:09:22,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:09:22,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:09:22,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:09:22,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:09:22,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b440c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22, skipping insertion in model container [2022-04-28 06:09:22,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:09:22,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:09:22,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c[525,538] [2022-04-28 06:09:22,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:09:22,713 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:09:22,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c[525,538] [2022-04-28 06:09:22,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:09:22,735 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:09:22,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22 WrapperNode [2022-04-28 06:09:22,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:09:22,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:09:22,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:09:22,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:09:22,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:09:22,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:09:22,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:09:22,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:09:22,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (1/1) ... [2022-04-28 06:09:22,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:09:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:22,785 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-28 06:09:22,797 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-28 06:09:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:09:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:09:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:09:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:09:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:09:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:09:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:09:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:09:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:09:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:09:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 06:09:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:09:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:09:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:09:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:09:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:09:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:09:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:09:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:09:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:09:22,871 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:09:22,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:09:23,048 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:09:23,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:09:23,054 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 06:09:23,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:09:23 BoogieIcfgContainer [2022-04-28 06:09:23,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:09:23,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:09:23,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:09:23,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:09:23,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:09:22" (1/3) ... [2022-04-28 06:09:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f1305a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:09:23, skipping insertion in model container [2022-04-28 06:09:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:22" (2/3) ... [2022-04-28 06:09:23,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f1305a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:09:23, skipping insertion in model container [2022-04-28 06:09:23,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:09:23" (3/3) ... [2022-04-28 06:09:23,062 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound50.c [2022-04-28 06:09:23,072 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:09:23,072 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:09:23,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:09:23,113 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6712288a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17f4a0e5 [2022-04-28 06:09:23,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:09:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:09:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 06:09:23,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:23,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:23,142 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-28 06:09:23,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:23,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1571451340] [2022-04-28 06:09:23,164 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-28 06:09:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:23,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043437238] [2022-04-28 06:09:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:23,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:23,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568866478] [2022-04-28 06:09:23,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:23,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:23,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:23,249 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-28 06:09:23,294 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-28 06:09:23,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:09:23,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:23,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 06:09:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:23,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:23,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2022-04-28 06:09:23,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-28 06:09:23,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 06:09:23,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 06:09:23,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-28 06:09:23,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {25#true} is VALID [2022-04-28 06:09:23,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 06:09:23,418 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-28 06:09:23,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 06:09:23,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 06:09:23,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 06:09:23,419 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-28 06:09:23,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:09:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:23,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043437238] [2022-04-28 06:09:23,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:23,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568866478] [2022-04-28 06:09:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568866478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:23,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:23,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 06:09:23,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:23,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1571451340] [2022-04-28 06:09:23,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1571451340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:23,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:23,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 06:09:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940594948] [2022-04-28 06:09:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 06:09:23,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:23,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-28 06:09:23,455 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-28 06:09:23,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 06:09:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 06:09:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 06:09:23,476 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-28 06:09:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:23,534 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 06:09:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 06:09:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-28 06:09:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-28 06:09:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-28 06:09:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-28 06:09:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-28 06:09:23,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-28 06:09:23,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:23,630 INFO L225 Difference]: With dead ends: 38 [2022-04-28 06:09:23,630 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 06:09:23,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 06:09:23,638 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:23,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:09:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 06:09:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 06:09:23,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:23,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:23,660 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:23,661 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:23,664 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 06:09:23,664 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 06:09:23,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:23,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:23,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 06:09:23,665 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 06:09:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:23,667 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 06:09:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 06:09:23,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:23,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:23,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:23,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 06:09:23,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 06:09:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:23,671 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 06:09:23,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-28 06:09:23,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 06:09:23,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 06:09:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:09:23,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:23,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:23,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 06:09:23,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 06:09:23,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:23,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-28 06:09:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:23,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767915951] [2022-04-28 06:09:23,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-28 06:09:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:23,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472556858] [2022-04-28 06:09:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:23,922 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872998725] [2022-04-28 06:09:23,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:23,930 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-28 06:09:23,931 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-28 06:09:23,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:09:23,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:23,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 06:09:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:23,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:24,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-28 06:09:24,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {211#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= ~counter~0 0)} assume true; {211#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#(<= ~counter~0 0)} {203#true} #54#return; {211#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#(<= ~counter~0 0)} call #t~ret8 := main(); {211#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {211#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:24,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227#(<= |main_#t~post7| 0)} is VALID [2022-04-28 06:09:24,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(<= |main_#t~post7| 0)} assume !(#t~post7 < 50);havoc #t~post7; {204#false} is VALID [2022-04-28 06:09:24,083 INFO L272 TraceCheckUtils]: 8: Hoare triple {204#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {204#false} is VALID [2022-04-28 06:09:24,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-28 06:09:24,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-28 06:09:24,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 06:09:24,084 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-28 06:09:24,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:09:24,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:24,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472556858] [2022-04-28 06:09:24,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:24,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872998725] [2022-04-28 06:09:24,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872998725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:24,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:24,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:09:24,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:24,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767915951] [2022-04-28 06:09:24,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767915951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:24,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:24,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:09:24,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660492406] [2022-04-28 06:09:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:24,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-28 06:09:24,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:24,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 06:09:24,098 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-28 06:09:24,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 06:09:24,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 06:09:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:09:24,099 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 06:09:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:24,150 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 06:09:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 06:09:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-28 06:09:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 06:09:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 06:09:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 06:09:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 06:09:24,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 06:09:24,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:24,189 INFO L225 Difference]: With dead ends: 26 [2022-04-28 06:09:24,189 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 06:09:24,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:09:24,190 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:24,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:09:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 06:09:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 06:09:24,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:24,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:24,203 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:24,203 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:24,206 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 06:09:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:09:24,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:24,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:24,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 06:09:24,208 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 06:09:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:24,211 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 06:09:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:09:24,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:24,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:24,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:24,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 06:09:24,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-28 06:09:24,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:24,214 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 06:09:24,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-28 06:09:24,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 06:09:24,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:09:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:09:24,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:24,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:24,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 06:09:24,451 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,SelfDestructingSolverStorable1 [2022-04-28 06:09:24,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-28 06:09:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:24,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756520293] [2022-04-28 06:09:24,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:24,453 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-28 06:09:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:24,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563782232] [2022-04-28 06:09:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:24,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:24,469 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:24,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725208135] [2022-04-28 06:09:24,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:24,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:24,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:24,473 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-28 06:09:24,498 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-28 06:09:24,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:09:24,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:24,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 06:09:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:24,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:24,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-28 06:09:24,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {370#true} is VALID [2022-04-28 06:09:24,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 06:09:24,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #54#return; {370#true} is VALID [2022-04-28 06:09:24,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret8 := main(); {370#true} is VALID [2022-04-28 06:09:24,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:24,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:24,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 50);havoc #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:24,714 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:09:24,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:24,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {371#false} is VALID [2022-04-28 06:09:24,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 06:09:24,715 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-28 06:09:24,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:09:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:24,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563782232] [2022-04-28 06:09:24,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:24,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725208135] [2022-04-28 06:09:24,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725208135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:24,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:24,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:09:24,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:24,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756520293] [2022-04-28 06:09:24,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756520293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:24,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:24,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:09:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857776223] [2022-04-28 06:09:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:09:24,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:24,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:09:24,729 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-28 06:09:24,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:09:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:09:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:09:24,730 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:09:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:24,860 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 06:09:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:09:24,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:09:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:09:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 06:09:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:09:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 06:09:24,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 06:09:24,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:24,899 INFO L225 Difference]: With dead ends: 28 [2022-04-28 06:09:24,899 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 06:09:24,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:09:24,900 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:24,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:09:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 06:09:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 06:09:24,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:24,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:24,917 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:24,917 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:24,918 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 06:09:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:09:24,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:24,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:24,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 06:09:24,919 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 06:09:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:24,921 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 06:09:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:09:24,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:24,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:24,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:24,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 06:09:24,923 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-28 06:09:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:24,924 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 06:09:24,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:09:24,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 06:09:24,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:09:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 06:09:24,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:24,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:24,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 06:09:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:25,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:25,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-28 06:09:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:25,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774955004] [2022-04-28 06:09:29,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:09:29,446 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:09:29,446 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:09:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-28 06:09:29,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496130064] [2022-04-28 06:09:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:29,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:29,458 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:29,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641683162] [2022-04-28 06:09:29,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:29,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:29,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 06:09:29,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:09:29,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:29,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:09:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:29,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:29,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 06:09:29,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:29,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:29,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #54#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:29,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret8 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:29,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 06:09:29,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,668 INFO L272 TraceCheckUtils]: 8: Hoare triple {592#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= ~counter~0 1)} ~cond := #in~cond; {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= ~counter~0 1)} assume !(0 == ~cond); {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= ~counter~0 1)} assume true; {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,670 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {592#(<= ~counter~0 1)} {592#(<= ~counter~0 1)} #50#return; {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {592#(<= ~counter~0 1)} is VALID [2022-04-28 06:09:29,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {617#(<= |main_#t~post7| 1)} is VALID [2022-04-28 06:09:29,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {569#false} is VALID [2022-04-28 06:09:29,675 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-28 06:09:29,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 06:09:29,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 06:09:29,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 06:09:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:09:29,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:09:29,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 06:09:29,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 06:09:29,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 06:09:29,830 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-28 06:09:29,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {645#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {569#false} is VALID [2022-04-28 06:09:29,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {645#(< |main_#t~post7| 50)} is VALID [2022-04-28 06:09:29,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#(< ~counter~0 50)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {649#(< ~counter~0 50)} is VALID [2022-04-28 06:09:29,832 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {568#true} {649#(< ~counter~0 50)} #50#return; {649#(< ~counter~0 50)} is VALID [2022-04-28 06:09:29,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-28 06:09:29,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-28 06:09:29,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-28 06:09:29,832 INFO L272 TraceCheckUtils]: 8: Hoare triple {649#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {568#true} is VALID [2022-04-28 06:09:29,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {649#(< ~counter~0 50)} is VALID [2022-04-28 06:09:29,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {649#(< ~counter~0 50)} is VALID [2022-04-28 06:09:29,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(< ~counter~0 49)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {674#(< ~counter~0 49)} is VALID [2022-04-28 06:09:29,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#(< ~counter~0 49)} call #t~ret8 := main(); {674#(< ~counter~0 49)} is VALID [2022-04-28 06:09:29,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#(< ~counter~0 49)} {568#true} #54#return; {674#(< ~counter~0 49)} is VALID [2022-04-28 06:09:29,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#(< ~counter~0 49)} assume true; {674#(< ~counter~0 49)} is VALID [2022-04-28 06:09:29,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {674#(< ~counter~0 49)} is VALID [2022-04-28 06:09:29,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 06:09:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:09:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:29,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496130064] [2022-04-28 06:09:29,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:29,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641683162] [2022-04-28 06:09:29,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641683162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:09:29,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:09:29,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 06:09:29,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:29,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774955004] [2022-04-28 06:09:29,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774955004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:29,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:29,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:09:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488550007] [2022-04-28 06:09:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:29,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:09:29,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:29,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:29,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:29,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:09:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:09:29,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:09:29,861 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:29,942 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 06:09:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:09:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:09:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 06:09:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 06:09:29,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 06:09:29,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:29,980 INFO L225 Difference]: With dead ends: 34 [2022-04-28 06:09:29,980 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 06:09:29,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:09:29,983 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:29,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:09:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 06:09:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 06:09:30,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:30,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:30,006 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:30,007 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:30,011 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 06:09:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 06:09:30,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:30,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:30,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 06:09:30,016 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 06:09:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:30,020 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 06:09:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 06:09:30,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:30,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:30,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:30,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:09:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 06:09:30,026 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-28 06:09:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:30,027 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 06:09:30,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:30,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 06:09:30,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 06:09:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 06:09:30,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:30,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:30,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 06:09:30,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:30,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-28 06:09:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:30,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353795424] [2022-04-28 06:09:30,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:09:30,356 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:09:30,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:09:30,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-28 06:09:30,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:30,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102589999] [2022-04-28 06:09:30,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:30,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:30,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:30,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559247739] [2022-04-28 06:09:30,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:30,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:30,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:30,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:30,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 06:09:30,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:09:30,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:30,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 06:09:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:30,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:30,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-28 06:09:30,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#true} is VALID [2022-04-28 06:09:30,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-28 06:09:30,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-28 06:09:30,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-28 06:09:30,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 50);havoc #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,749 INFO L272 TraceCheckUtils]: 8: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-28 06:09:30,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:30,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:30,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:30,751 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #50#return; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 50);havoc #t~post7; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:30,775 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:09:30,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:30,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-28 06:09:30,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-28 06:09:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:09:30,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:09:41,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-28 06:09:41,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-28 06:09:41,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:41,972 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:09:41,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 50);havoc #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:09:41,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:09:42,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:09:42,121 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {873#true} #50#return; {960#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:09:42,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:42,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:42,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:09:42,126 INFO L272 TraceCheckUtils]: 8: Hoare triple {873#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-28 06:09:42,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#true} assume !!(#t~post7 < 50);havoc #t~post7; {873#true} is VALID [2022-04-28 06:09:42,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {873#true} is VALID [2022-04-28 06:09:42,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {873#true} is VALID [2022-04-28 06:09:42,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-28 06:09:42,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-28 06:09:42,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-28 06:09:42,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#true} is VALID [2022-04-28 06:09:42,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-28 06:09:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:09:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:42,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102589999] [2022-04-28 06:09:42,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:42,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559247739] [2022-04-28 06:09:42,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559247739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:09:42,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:09:42,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 06:09:42,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:42,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353795424] [2022-04-28 06:09:42,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353795424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:42,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:42,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 06:09:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579515584] [2022-04-28 06:09:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:09:42,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:42,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:42,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:42,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 06:09:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:42,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 06:09:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:09:42,192 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:45,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:09:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:45,839 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 06:09:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:09:45,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:09:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 06:09:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 06:09:45,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-28 06:09:45,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:45,977 INFO L225 Difference]: With dead ends: 36 [2022-04-28 06:09:45,977 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 06:09:45,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 06:09:45,978 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:45,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 06:09:45,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 06:09:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 06:09:46,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:46,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:09:46,011 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:09:46,012 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:09:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:46,013 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 06:09:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 06:09:46,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:46,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:46,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 06:09:46,014 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 06:09:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:46,015 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 06:09:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 06:09:46,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:46,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:46,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:46,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:09:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 06:09:46,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-28 06:09:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:46,017 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 06:09:46,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:09:46,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 06:09:46,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 06:09:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 06:09:46,112 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:46,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:46,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 06:09:46,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:46,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:46,314 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-28 06:09:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:46,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151396639] [2022-04-28 06:09:50,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:09:50,372 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:09:50,372 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:09:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-28 06:09:50,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:50,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276652851] [2022-04-28 06:09:50,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:50,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368141746] [2022-04-28 06:09:50,384 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:09:50,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:50,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:50,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:50,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 06:09:50,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:09:50,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:50,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 06:09:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:51,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:10:03,630 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:10:11,923 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:10:23,948 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:10:38,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) is different from false [2022-04-28 06:11:19,673 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) (= 0 .cse0)) (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (let ((.cse2 (div .cse0 c_main_~z~0))) (+ (* .cse2 c_main_~z~0) (* (- 1) .cse2) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) (= .cse1 0)) (and (= (* (div .cse1 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not (= c_main_~az~0 0))))) (not (= c_main_~z~0 0))))) (= (+ (* c_main_~x~0 c_main_~z~0) c_main_~a~0) (+ (* c_main_~y~0 c_main_~az~0) c_main_~x~0))) is different from false [2022-04-28 06:11:33,605 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:11:43,651 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:11:49,681 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:11:55,625 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:12:20,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) c_main_~a~0))) (let ((.cse6 (+ .cse4 c_main_~x~0))) (or (and (let ((.cse5 (div .cse6 c_main_~z~0))) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (+ (* .cse5 c_main_~z~0) (* (- 1) .cse5) c_main_~a~0))) (or (let ((.cse0 (div .cse2 c_main_~az~0))) (and (= (* .cse0 c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0) (= (* (div (let ((.cse3 (div (+ .cse4 .cse5) c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)) c_main_~az~0) c_main_~z~0) .cse0))) (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= 0 (mod (div c_main_~y~0 c_main_~z~0) c_main_~z~0)) (= .cse2 0))))) (= (mod .cse6 c_main_~z~0) 0) (not (= c_main_~z~0 0))) (and (= (+ (* c_main_~a~0 c_main_~z~0) c_main_~a~0) c_main_~a~0) (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) (= 0 .cse6))))) is different from false [2022-04-28 06:12:57,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 06:12:57,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-28 06:12:57,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 06:12:57,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-28 06:12:57,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-28 06:12:57,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1211#true} is VALID [2022-04-28 06:12:57,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 06:12:57,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 50);havoc #t~post7; {1211#true} is VALID [2022-04-28 06:12:57,444 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 06:12:57,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:12:57,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:12:57,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:12:57,457 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:12:59,460 WARN L290 TraceCheckUtils]: 13: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-28 06:12:59,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-28 06:12:59,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} assume !!(#t~post7 < 50);havoc #t~post7; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-28 06:12:59,465 INFO L272 TraceCheckUtils]: 16: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 06:12:59,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:12:59,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:12:59,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:12:59,487 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #50#return; {1280#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (or (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))))) (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} is VALID [2022-04-28 06:13:01,495 WARN L290 TraceCheckUtils]: 21: Hoare triple {1280#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (or (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))))) (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-28 06:13:01,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-28 06:13:01,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} assume !(#t~post7 < 50);havoc #t~post7; {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-28 06:13:01,584 INFO L272 TraceCheckUtils]: 24: Hoare triple {1284#(or (and (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:13:01,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:13:01,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 06:13:01,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 06:13:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2022-04-28 06:13:01,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:13:13,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 06:13:13,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 06:13:13,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:13:13,983 INFO L272 TraceCheckUtils]: 24: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:13:13,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !(#t~post7 < 50);havoc #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:13:13,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:13:14,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:13:14,129 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1323#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:13:14,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:13:14,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:13:14,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:13:14,130 INFO L272 TraceCheckUtils]: 16: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 06:13:14,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !!(#t~post7 < 50);havoc #t~post7; {1211#true} is VALID [2022-04-28 06:13:14,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1211#true} #50#return; {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 50);havoc #t~post7; {1211#true} is VALID [2022-04-28 06:13:14,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 06:13:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:13:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:13:14,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276652851] [2022-04-28 06:13:14,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:13:14,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368141746] [2022-04-28 06:13:14,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368141746] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:13:14,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:13:14,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-28 06:13:14,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:13:14,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151396639] [2022-04-28 06:13:14,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151396639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:13:14,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:13:14,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:13:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917404248] [2022-04-28 06:13:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:13:14,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 06:13:14,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:13:14,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:13:18,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:13:18,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:13:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:13:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:13:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=55, Unknown=3, NotChecked=48, Total=132 [2022-04-28 06:13:18,383 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:13:21,362 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) (= (+ (* c_main_~x~0 c_main_~z~0) c_main_~a~0) (+ (* c_main_~y~0 c_main_~az~0) c_main_~x~0))) is different from false [2022-04-28 06:14:07,701 WARN L232 SmtUtils]: Spent 45.88s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 06:14:21,749 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (* (- 1) c_main_~a~0))) (let ((.cse6 (+ .cse4 c_main_~x~0))) (or (and (let ((.cse5 (div .cse6 c_main_~z~0))) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (+ (* .cse5 c_main_~z~0) (* (- 1) .cse5) c_main_~a~0))) (or (let ((.cse0 (div .cse2 c_main_~az~0))) (and (= (* .cse0 c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0) (= (* (div (let ((.cse3 (div (+ .cse4 .cse5) c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)) c_main_~az~0) c_main_~z~0) .cse0))) (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= 0 (mod (div c_main_~y~0 c_main_~z~0) c_main_~z~0)) (= .cse2 0))))) (= (mod .cse6 c_main_~z~0) 0) (not (= c_main_~z~0 0))) (and (= (+ (* c_main_~a~0 c_main_~z~0) c_main_~a~0) c_main_~a~0) (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) (= 0 .cse6))))) (= (+ (* c_main_~x~0 c_main_~z~0) c_main_~a~0) (+ (* c_main_~y~0 c_main_~az~0) c_main_~x~0))) is different from false [2022-04-28 06:14:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:14:31,818 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 06:14:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 06:14:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 06:14:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:14:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:14:31,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-28 06:14:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:14:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-28 06:14:31,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2022-04-28 06:14:36,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 32 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:14:36,858 INFO L225 Difference]: With dead ends: 40 [2022-04-28 06:14:36,858 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 06:14:36,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 58.3s TimeCoverageRelationStatistics Valid=47, Invalid=100, Unknown=5, NotChecked=120, Total=272 [2022-04-28 06:14:36,859 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:14:36,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 88 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-04-28 06:14:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 06:14:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 06:14:36,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:14:36,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:14:36,901 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:14:36,901 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:14:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:14:36,903 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-28 06:14:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 06:14:36,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:14:36,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:14:36,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 06:14:36,904 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 06:14:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:14:36,906 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-28 06:14:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 06:14:36,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:14:36,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:14:36,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:14:36,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:14:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:14:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-28 06:14:36,911 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-04-28 06:14:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:14:36,912 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-28 06:14:36,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:14:36,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 34 transitions. [2022-04-28 06:14:43,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 31 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 06:14:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-28 06:14:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 06:14:43,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:14:43,268 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:14:43,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 06:14:43,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:14:43,469 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:14:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:14:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash -694393736, now seen corresponding path program 3 times [2022-04-28 06:14:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:14:43,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294223167] [2022-04-28 06:14:45,542 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:14:45,542 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:14:45,542 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:14:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash -694393736, now seen corresponding path program 4 times [2022-04-28 06:14:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:14:45,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759065360] [2022-04-28 06:14:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:14:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:14:45,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:14:45,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025263866] [2022-04-28 06:14:45,561 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:14:45,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:14:45,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:14:45,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:14:45,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 06:14:46,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:14:46,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:14:46,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 06:14:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:14:46,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:15:00,604 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:15:05,471 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:15:09,489 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:15:27,834 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:15:32,092 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:15:33,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {1615#true} call ULTIMATE.init(); {1615#true} is VALID [2022-04-28 06:15:33,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {1615#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1615#true} is VALID [2022-04-28 06:15:33,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1615#true} assume true; {1615#true} is VALID [2022-04-28 06:15:33,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1615#true} {1615#true} #54#return; {1615#true} is VALID [2022-04-28 06:15:33,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {1615#true} call #t~ret8 := main(); {1615#true} is VALID [2022-04-28 06:15:33,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {1615#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1615#true} is VALID [2022-04-28 06:15:33,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {1615#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1615#true} is VALID [2022-04-28 06:15:33,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {1615#true} assume !!(#t~post7 < 50);havoc #t~post7; {1615#true} is VALID [2022-04-28 06:15:33,234 INFO L272 TraceCheckUtils]: 8: Hoare triple {1615#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1615#true} is VALID [2022-04-28 06:15:33,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {1615#true} ~cond := #in~cond; {1647#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:15:33,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {1647#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:15:33,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:15:33,242 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} {1615#true} #50#return; {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:15:35,243 WARN L290 TraceCheckUtils]: 13: Hoare triple {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is UNKNOWN [2022-04-28 06:15:35,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 06:15:35,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 06:15:35,246 INFO L272 TraceCheckUtils]: 16: Hoare triple {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1615#true} is VALID [2022-04-28 06:15:35,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {1615#true} ~cond := #in~cond; {1647#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:15:35,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {1647#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:15:35,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:15:35,248 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} #50#return; {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 06:15:37,250 WARN L290 TraceCheckUtils]: 21: Hoare triple {1662#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1687#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is UNKNOWN [2022-04-28 06:15:37,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {1687#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1687#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is VALID [2022-04-28 06:15:37,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {1687#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} assume !!(#t~post7 < 50);havoc #t~post7; {1687#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is VALID [2022-04-28 06:15:37,286 INFO L272 TraceCheckUtils]: 24: Hoare triple {1687#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1697#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:15:37,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {1697#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1701#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:15:37,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1616#false} is VALID [2022-04-28 06:15:37,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {1616#false} assume !false; {1616#false} is VALID [2022-04-28 06:15:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:15:37,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:15:46,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {1616#false} assume !false; {1616#false} is VALID [2022-04-28 06:15:46,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1616#false} is VALID [2022-04-28 06:15:46,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {1697#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1701#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:15:46,882 INFO L272 TraceCheckUtils]: 24: Hoare triple {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1697#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:15:46,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 50);havoc #t~post7; {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:15:46,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:15:46,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1658#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:15:46,909 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} {1615#true} #50#return; {1726#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:15:46,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:15:46,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {1739#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:15:46,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {1615#true} ~cond := #in~cond; {1739#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:15:46,910 INFO L272 TraceCheckUtils]: 16: Hoare triple {1615#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1615#true} is VALID [2022-04-28 06:15:46,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {1615#true} assume !!(#t~post7 < 50);havoc #t~post7; {1615#true} is VALID [2022-04-28 06:15:46,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {1615#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {1615#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1615#true} {1615#true} #50#return; {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {1615#true} assume true; {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {1615#true} assume !(0 == ~cond); {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1615#true} ~cond := #in~cond; {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L272 TraceCheckUtils]: 8: Hoare triple {1615#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1615#true} is VALID [2022-04-28 06:15:46,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1615#true} assume !!(#t~post7 < 50);havoc #t~post7; {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {1615#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1615#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1615#true} call #t~ret8 := main(); {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1615#true} {1615#true} #54#return; {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1615#true} assume true; {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1615#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1615#true} is VALID [2022-04-28 06:15:46,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {1615#true} call ULTIMATE.init(); {1615#true} is VALID [2022-04-28 06:15:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:15:46,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:15:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759065360] [2022-04-28 06:15:46,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:15:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025263866] [2022-04-28 06:15:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025263866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:15:46,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:15:46,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 06:15:46,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:15:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294223167] [2022-04-28 06:15:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294223167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:15:46,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:15:46,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 06:15:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867152032] [2022-04-28 06:15:46,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:15:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 06:15:46,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:15:46,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:15:51,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:15:51,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 06:15:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:15:51,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 06:15:51,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:15:51,035 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:15:53,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:15:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:15:55,513 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-28 06:15:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 06:15:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 06:15:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:15:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:15:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 06:15:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:15:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-04-28 06:15:55,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2022-04-28 06:16:03,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 24 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 06:16:03,742 INFO L225 Difference]: With dead ends: 33 [2022-04-28 06:16:03,742 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 06:16:03,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:16:03,743 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 06:16:03,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 86 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 06:16:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 06:16:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 06:16:03,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:16:03,744 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-28 06:16:03,744 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-28 06:16:03,745 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-28 06:16:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:16:03,745 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 06:16:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:16:03,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:16:03,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:16:03,745 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-28 06:16:03,745 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-28 06:16:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:16:03,745 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 06:16:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:16:03,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:16:03,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:16:03,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:16:03,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:16:03,771 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-28 06:16:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 06:16:03,771 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 06:16:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:16:03,772 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 06:16:03,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:16:03,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 06:16:03,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:16:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:16:03,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:16:03,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 06:16:03,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 06:16:03,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:16:03,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 06:16:42,420 WARN L232 SmtUtils]: Spent 38.37s on a formula simplification. DAG size of input: 102 DAG size of output: 70 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:17:47,467 WARN L232 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 88 DAG size of output: 71 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:18:31,378 WARN L232 SmtUtils]: Spent 43.90s on a formula simplification. DAG size of input: 102 DAG size of output: 72 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:19:39,595 WARN L232 SmtUtils]: Spent 1.14m on a formula simplification. DAG size of input: 84 DAG size of output: 66 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:21:05,421 WARN L232 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 86 DAG size of output: 65 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 06:21:05,453 INFO L895 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse12 (* main_~a~0 main_~z~0))) (let ((.cse10 (= main_~x~0 (+ .cse12 main_~a~0))) (.cse0 (= .cse12 main_~az~0))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (<= |main_#t~post7| 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse11 (* (- 1) main_~a~0))) (let ((.cse6 (+ .cse11 main_~x~0))) (let ((.cse4 (div .cse6 main_~z~0))) (let ((.cse8 (+ .cse4 .cse11))) (let ((.cse2 (div .cse8 main_~z~0))) (let ((.cse3 (* main_~z~0 .cse2)) (.cse5 (= main_~y~0 0))) (and (or (= main_~az~0 0) (let ((.cse1 (div (+ (* (- 1) .cse4) main_~a~0 (* .cse4 main_~z~0)) main_~az~0))) (and (= .cse1 (* main_~z~0 (div (+ (* (- 1) .cse2) main_~a~0 .cse3) main_~az~0))) (= (* .cse1 main_~z~0) main_~y~0))) .cse5) (let ((.cse9 (= main_~z~0 0))) (or (let ((.cse7 (div main_~y~0 main_~z~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse6 main_~z~0)) (= (mod .cse7 main_~z~0) 0) (= (mod .cse8 main_~z~0) 0) (= (+ (* (div .cse7 main_~z~0) main_~az~0) .cse2) (+ main_~a~0 .cse3)) (not .cse9))) (and .cse9 .cse5 .cse10)))))))))) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post7| 1) (= main_~z~0 main_~y~0) .cse10 .cse0)))) [2022-04-28 06:21:05,453 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse9 (* main_~a~0 main_~z~0))) (let ((.cse11 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse12 (= .cse9 main_~az~0))) (or (let ((.cse10 (* (- 1) main_~a~0))) (let ((.cse5 (+ .cse10 main_~x~0))) (let ((.cse3 (div .cse5 main_~z~0))) (let ((.cse7 (+ .cse3 .cse10))) (let ((.cse1 (div .cse7 main_~z~0))) (let ((.cse2 (* main_~z~0 .cse1)) (.cse4 (= main_~y~0 0))) (and (or (= main_~az~0 0) (let ((.cse0 (div (+ (* (- 1) .cse3) main_~a~0 (* .cse3 main_~z~0)) main_~az~0))) (and (= .cse0 (* main_~z~0 (div (+ (* (- 1) .cse1) main_~a~0 .cse2) main_~az~0))) (= (* .cse0 main_~z~0) main_~y~0))) .cse4) (let ((.cse8 (= main_~z~0 0))) (or (let ((.cse6 (div main_~y~0 main_~z~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse5 main_~z~0)) (= (mod .cse6 main_~z~0) 0) (= (mod .cse7 main_~z~0) 0) (= (+ (* (div .cse6 main_~z~0) main_~az~0) .cse1) (+ main_~a~0 .cse2)) (not .cse8))) (and .cse8 .cse4 (= main_~x~0 (+ .cse9 main_~a~0)))))))))))) (and (= main_~z~0 main_~y~0) (<= ~counter~0 1) .cse11 .cse12) (not (<= |old(~counter~0)| 0)) (and (= main_~y~0 1) (<= ~counter~0 0) .cse11 .cse12)))) [2022-04-28 06:21:05,454 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse11 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse11 main_~x~0))) (let ((.cse9 (div .cse1 main_~z~0))) (let ((.cse3 (+ .cse9 .cse11))) (let ((.cse4 (div .cse3 main_~z~0)) (.cse10 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse10 main_~az~0)) (.cse5 (* main_~z~0 .cse4)) (.cse6 (= main_~z~0 0)) (.cse7 (= main_~x~0 (+ .cse10 main_~a~0)))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (let ((.cse2 (div main_~y~0 main_~z~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 .cse5)) (not .cse6))) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) .cse7 .cse0) (let ((.cse8 (div (+ (* (- 1) .cse9) main_~a~0 (* .cse9 main_~z~0)) main_~az~0))) (and (= .cse8 (* main_~z~0 (div (+ (* (- 1) .cse4) main_~a~0 .cse5) main_~az~0))) (not (= main_~az~0 0)) (= (* .cse8 main_~z~0) main_~y~0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))) (and .cse6 (= main_~y~0 0) .cse7)))))))) [2022-04-28 06:21:05,454 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-28 06:21:05,454 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-28 06:21:05,454 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-28 06:21:05,454 INFO L902 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-28 06:21:05,454 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse1 (= .cse0 main_~az~0))) (or (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse0 main_~a~0)) .cse1) (let ((.cse11 (* (- 1) main_~a~0))) (let ((.cse4 (+ .cse11 main_~x~0))) (let ((.cse5 (div .cse4 main_~z~0)) (.cse3 (= main_~y~0 0))) (and (let ((.cse2 (= main_~z~0 0))) (or (and .cse2 .cse3 (= main_~a~0 main_~x~0)) (and (= 0 (mod .cse4 main_~z~0)) (let ((.cse6 (* .cse5 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse5 (+ main_~a~0 .cse6))) (let ((.cse7 (+ (* (- 1) .cse5) main_~a~0 .cse6))) (and (= (mod .cse7 main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div .cse7 main_~az~0) main_~z~0) main_~y~0))))) (not .cse2)))) (or (let ((.cse8 (div main_~y~0 main_~z~0)) (.cse9 (+ .cse5 .cse11))) (and (= (mod .cse8 main_~z~0) 0) (= (mod .cse9 main_~z~0) 0) (let ((.cse10 (div .cse9 main_~z~0))) (= (+ (* (div .cse8 main_~z~0) main_~az~0) .cse10) (+ main_~a~0 (* main_~z~0 .cse10)))))) .cse3))))) (and (<= ~counter~0 1) (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse1)))) [2022-04-28 06:21:05,454 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse7 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse8 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (div (+ .cse6 main_~x~0) main_~z~0)) (.cse0 (= main_~y~0 0))) (and (or (and .cse0 (= main_~a~0 main_~x~0)) (and (let ((.cse2 (* .cse1 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse1 (+ main_~a~0 .cse2))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse1) main_~a~0 .cse2) main_~az~0) main_~z~0) main_~y~0)))) (not (= main_~z~0 0)))) (or (let ((.cse3 (div main_~y~0 main_~z~0)) (.cse4 (+ .cse1 .cse6))) (and (= (mod .cse3 main_~z~0) 0) (= (mod .cse4 main_~z~0) 0) (let ((.cse5 (div .cse4 main_~z~0))) (= (+ (* (div .cse3 main_~z~0) main_~az~0) .cse5) (+ main_~a~0 (* main_~z~0 .cse5)))))) .cse0) .cse7))) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) .cse7 .cse8) (and (<= ~counter~0 1) (= main_~y~0 1) .cse7 .cse8))) [2022-04-28 06:21:05,454 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 06:21:05,454 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 06:21:05,454 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 06:21:05,454 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 06:21:05,455 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 06:21:05,455 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 06:21:05,455 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 06:21:05,455 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 06:21:05,455 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 06:21:05,455 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 06:21:05,455 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 06:21:05,455 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 06:21:05,455 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 06:21:05,458 INFO L356 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2] [2022-04-28 06:21:05,459 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 06:21:05,462 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 06:21:05,464 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 06:21:05,466 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 06:21:05,467 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 06:21:05,467 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 06:21:05,514 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 06:21:09,896 INFO L163 areAnnotationChecker]: CFG has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 06:21:09,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 06:21:09 BoogieIcfgContainer [2022-04-28 06:21:09,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 06:21:09,911 INFO L158 Benchmark]: Toolchain (without parser) took 707392.63ms. Allocated memory was 174.1MB in the beginning and 221.2MB in the end (delta: 47.2MB). Free memory was 122.1MB in the beginning and 114.3MB in the end (delta: 7.8MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. [2022-04-28 06:21:09,912 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 174.1MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 06:21:09,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.07ms. Allocated memory was 174.1MB in the beginning and 221.2MB in the end (delta: 47.2MB). Free memory was 121.9MB in the beginning and 197.1MB in the end (delta: -75.2MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-28 06:21:09,912 INFO L158 Benchmark]: Boogie Preprocessor took 21.81ms. Allocated memory is still 221.2MB. Free memory was 197.1MB in the beginning and 195.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 06:21:09,912 INFO L158 Benchmark]: RCFGBuilder took 296.37ms. Allocated memory is still 221.2MB. Free memory was 195.5MB in the beginning and 184.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 06:21:09,913 INFO L158 Benchmark]: TraceAbstraction took 706853.58ms. Allocated memory is still 221.2MB. Free memory was 183.5MB in the beginning and 114.9MB in the end (delta: 68.6MB). Peak memory consumption was 69.1MB. Max. memory is 8.0GB. [2022-04-28 06:21:09,914 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 174.1MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.07ms. Allocated memory was 174.1MB in the beginning and 221.2MB in the end (delta: 47.2MB). Free memory was 121.9MB in the beginning and 197.1MB in the end (delta: -75.2MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.81ms. Allocated memory is still 221.2MB. Free memory was 197.1MB in the beginning and 195.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 296.37ms. Allocated memory is still 221.2MB. Free memory was 195.5MB in the beginning and 184.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 706853.58ms. Allocated memory is still 221.2MB. Free memory was 183.5MB in the beginning and 114.9MB in the end (delta: 68.6MB). Peak memory consumption was 69.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 702.4s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 95.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 301.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 430 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 124 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 179 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 59.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 82 PreInvPairs, 133 NumberOfFragments, 1177 HoareAnnotationTreeSize, 82 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1253 FormulaSimplificationTreeSizeReductionInter, 301.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((az == 0 || ((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az == z * ((-1 * (((-1 * a + x) / z + -1 * a) / z) + a + z * (((-1 * a + x) / z + -1 * a) / z)) / az) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y)) || y == 0) && ((((((y % z == 0 && 0 == (-1 * a + x) % z) && y / z % z == 0) && ((-1 * a + x) / z + -1 * a) % z == 0) && y / z / z * az + ((-1 * a + x) / z + -1 * a) / z == a + z * (((-1 * a + x) / z + -1 * a) / z)) && !(z == 0)) || ((z == 0 && y == 0) && x == a * z + a))) || (((z == y && counter <= 1) && y * az + x == z * x + a) && a * z == az)) || !(\old(counter) <= 0)) || (((y == 1 && counter <= 0) && y * az + x == z * x + a) && a * z == az) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 06:21:10,032 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...