/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:54:59,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:54:59,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:54:59,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:54:59,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:54:59,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:54:59,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:54:59,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:54:59,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:54:59,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:54:59,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:54:59,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:54:59,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:54:59,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:54:59,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:54:59,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:54:59,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:54:59,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:54:59,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:54:59,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:54:59,814 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:54:59,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:54:59,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:54:59,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:54:59,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:54:59,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:54:59,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:54:59,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:54:59,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:54:59,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:54:59,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:54:59,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:54:59,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:54:59,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:54:59,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:54:59,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:54:59,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:54:59,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:54:59,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:54:59,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:54:59,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:54:59,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:54:59,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:54:59,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:54:59,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:54:59,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:54:59,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:54:59,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:54:59,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:54:59,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:54:59,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:54:59,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:54:59,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:54:59,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:54:59,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:54:59,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:54:59,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:54:59,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:54:59,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:54:59,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:54:59,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:54:59,839 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:54:59,839 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:54:59,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:54:59,839 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:54:59,839 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 10:55:00,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:55:00,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:55:00,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:55:00,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:55:00,087 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:55:00,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-28 10:55:00,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64d6b4c6/4202412ee96e45adbb8afa0182d18c58/FLAG2be150ed3 [2022-04-28 10:55:00,509 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:55:00,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-28 10:55:00,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64d6b4c6/4202412ee96e45adbb8afa0182d18c58/FLAG2be150ed3 [2022-04-28 10:55:00,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64d6b4c6/4202412ee96e45adbb8afa0182d18c58 [2022-04-28 10:55:00,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:55:00,538 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:55:00,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:55:00,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:55:00,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:55:00,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685fc1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00, skipping insertion in model container [2022-04-28 10:55:00,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:55:00,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:55:00,778 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/prod4br-ll.c[524,537] [2022-04-28 10:55:00,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:55:00,819 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:55:00,831 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/prod4br-ll.c[524,537] [2022-04-28 10:55:00,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:55:00,867 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:55:00,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00 WrapperNode [2022-04-28 10:55:00,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:55:00,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:55:00,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:55:00,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:55:00,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:55:00,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:55:00,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:55:00,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:55:00,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (1/1) ... [2022-04-28 10:55:00,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:55:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:00,936 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 10:55:00,962 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 10:55:00,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:55:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:55:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:55:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:55:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:55:00,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:55:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:55:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:55:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:55:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:55:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:55:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:55:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:55:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:55:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:55:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:55:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:55:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:55:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:55:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:55:01,043 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:55:01,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:55:01,259 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:55:01,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:55:01,266 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:55:01,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:55:01 BoogieIcfgContainer [2022-04-28 10:55:01,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:55:01,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:55:01,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:55:01,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:55:01,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:55:00" (1/3) ... [2022-04-28 10:55:01,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58592821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:55:01, skipping insertion in model container [2022-04-28 10:55:01,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:00" (2/3) ... [2022-04-28 10:55:01,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58592821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:55:01, skipping insertion in model container [2022-04-28 10:55:01,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:55:01" (3/3) ... [2022-04-28 10:55:01,276 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-28 10:55:01,287 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:55:01,287 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:55:01,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:55:01,345 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@1e0249c3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@51c13b1f [2022-04-28 10:55:01,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:55:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:55:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:55:01,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:01,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:55:01,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-28 10:55:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:01,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369228839] [2022-04-28 10:55:01,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:55:01,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 2 times [2022-04-28 10:55:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:01,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254893912] [2022-04-28 10:55:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:01,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:55:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:01,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 10:55:01,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 10:55:01,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-28 10:55:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:55:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:01,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 10:55:01,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 10:55:01,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 10:55:01,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-28 10:55:01,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:55:01,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 10:55:01,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 10:55:01,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-28 10:55:01,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-28 10:55:01,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34#true} is VALID [2022-04-28 10:55:01,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-28 10:55:01,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 10:55:01,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 10:55:01,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 10:55:01,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-28 10:55:01,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35#false} is VALID [2022-04-28 10:55:01,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 10:55:01,612 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-28 10:55:01,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 10:55:01,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 10:55:01,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 10:55:01,613 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 10:55:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:55:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254893912] [2022-04-28 10:55:01,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254893912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:01,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:01,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:55:01,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:55:01,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369228839] [2022-04-28 10:55:01,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369228839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:01,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:01,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:55:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138921762] [2022-04-28 10:55:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:55:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:01,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:55:01,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:01,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:01,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:55:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:01,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:55:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:55:01,671 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:01,772 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-28 10:55:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:55:01,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:01,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:55:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-28 10:55:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-28 10:55:01,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-28 10:55:01,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:01,896 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:55:01,896 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 10:55:01,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:55:01,901 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:55:01,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:55:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 10:55:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 10:55:01,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:55:01,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:01,940 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:01,941 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:01,950 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 10:55:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 10:55:01,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:01,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:01,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 10:55:01,952 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 10:55:01,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:01,962 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 10:55:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 10:55:01,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:01,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:01,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:55:01,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:55:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 10:55:01,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 10:55:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:55:01,974 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 10:55:01,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:01,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 10:55:02,014 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 10:55:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 10:55:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:55:02,015 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:02,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:55:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:55:02,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-28 10:55:02,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:02,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1882324952] [2022-04-28 10:55:02,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:55:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 2 times [2022-04-28 10:55:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:02,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661606783] [2022-04-28 10:55:02,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:02,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:02,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:55:02,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388201846] [2022-04-28 10:55:02,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:55:02,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:55:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:02,063 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 10:55:02,093 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 10:55:02,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:55:02,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:55:02,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:55:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:02,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:55:02,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-28 10:55:02,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 10:55:02,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 10:55:02,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #76#return; {256#true} is VALID [2022-04-28 10:55:02,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret6 := main(); {256#true} is VALID [2022-04-28 10:55:02,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-28 10:55:02,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-28 10:55:02,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 10:55:02,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 10:55:02,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 10:55:02,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #68#return; {256#true} is VALID [2022-04-28 10:55:02,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 10:55:02,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 10:55:02,311 INFO L272 TraceCheckUtils]: 13: Hoare triple {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:55:02,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:55:02,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-28 10:55:02,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 10:55:02,313 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 10:55:02,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:55:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:55:02,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661606783] [2022-04-28 10:55:02,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:55:02,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388201846] [2022-04-28 10:55:02,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388201846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:02,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:02,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:55:02,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:55:02,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1882324952] [2022-04-28 10:55:02,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1882324952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:02,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:02,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:55:02,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102544804] [2022-04-28 10:55:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:55:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:02,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:55:02,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:02,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:02,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:55:02,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:55:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:55:02,337 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:02,521 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 10:55:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:55:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:55:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 10:55:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 10:55:02,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 10:55:02,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:02,575 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:55:02,576 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 10:55:02,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 10:55:02,577 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:55:02,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:55:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 10:55:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-28 10:55:02,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:55:02,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:55:02,591 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:55:02,591 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:55:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:02,594 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 10:55:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 10:55:02,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:02,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:02,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 10:55:02,595 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 10:55:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:02,598 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 10:55:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 10:55:02,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:02,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:02,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:55:02,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:55:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:55:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 10:55:02,601 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-28 10:55:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:55:02,602 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 10:55:02,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:02,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 10:55:02,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 10:55:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:55:02,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:02,647 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:55:02,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:55:02,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:55:02,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:02,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:02,864 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-28 10:55:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:02,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1268967531] [2022-04-28 10:55:02,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:55:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 2 times [2022-04-28 10:55:02,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:02,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219143524] [2022-04-28 10:55:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:02,880 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:55:02,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662526354] [2022-04-28 10:55:02,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:55:02,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:55:02,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:02,883 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 10:55:02,888 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 10:55:02,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:55:02,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:55:02,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:55:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:02,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:55:11,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-28 10:55:11,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {533#true} is VALID [2022-04-28 10:55:11,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-28 10:55:11,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-28 10:55:11,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-28 10:55:11,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {533#true} is VALID [2022-04-28 10:55:11,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {533#true} is VALID [2022-04-28 10:55:11,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {559#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:55:11,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {563#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:55:11,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {563#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {563#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:55:11,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {563#(not (= |assume_abort_if_not_#in~cond| 0))} {533#true} #68#return; {570#(<= 1 main_~y~0)} is VALID [2022-04-28 10:55:11,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:55:11,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:55:11,618 INFO L272 TraceCheckUtils]: 13: Hoare triple {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {533#true} is VALID [2022-04-28 10:55:11,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:55:11,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:55:11,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:55:13,628 WARN L284 TraceCheckUtils]: 17: Hoare quadruple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {595#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 10:55:13,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {599#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 10:55:13,630 INFO L272 TraceCheckUtils]: 19: Hoare triple {599#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:55:13,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:55:13,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-28 10:55:13,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-28 10:55:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:55:13,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:55:52,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-28 10:55:52,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-28 10:55:52,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:55:52,522 INFO L272 TraceCheckUtils]: 19: Hoare triple {623#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:55:52,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {623#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:55:52,524 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} {533#true} #70#return; {627#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 10:55:52,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:55:52,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:55:52,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:55:52,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {533#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {533#true} is VALID [2022-04-28 10:55:52,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#true} assume !false; {533#true} is VALID [2022-04-28 10:55:52,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {533#true} is VALID [2022-04-28 10:55:52,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {533#true} {533#true} #68#return; {533#true} is VALID [2022-04-28 10:55:52,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-28 10:55:52,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-04-28 10:55:52,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-04-28 10:55:52,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {533#true} is VALID [2022-04-28 10:55:52,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {533#true} is VALID [2022-04-28 10:55:52,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-28 10:55:52,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-28 10:55:52,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-28 10:55:52,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {533#true} is VALID [2022-04-28 10:55:52,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-28 10:55:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:55:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:55:52,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219143524] [2022-04-28 10:55:52,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:55:52,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662526354] [2022-04-28 10:55:52,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662526354] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:55:52,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:55:52,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-28 10:55:52,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:55:52,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1268967531] [2022-04-28 10:55:52,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1268967531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:52,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:52,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:55:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213134519] [2022-04-28 10:55:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:55:52,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 10:55:52,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:55:52,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:54,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:54,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:55:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:55:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:55:54,557 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:59,142 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-28 10:55:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:55:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 10:55:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:55:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-28 10:55:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-28 10:55:59,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-28 10:56:01,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:01,199 INFO L225 Difference]: With dead ends: 46 [2022-04-28 10:56:01,199 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 10:56:01,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:56:01,203 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:56:01,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 88 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:56:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 10:56:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-28 10:56:01,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:56:01,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:01,232 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:01,232 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:01,235 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 10:56:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-28 10:56:01,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:01,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:01,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 10:56:01,236 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 10:56:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:01,238 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-28 10:56:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-28 10:56:01,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:01,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:01,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:56:01,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:56:01,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-04-28 10:56:01,242 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2022-04-28 10:56:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:56:01,242 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-04-28 10:56:01,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:01,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 51 transitions. [2022-04-28 10:56:03,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 10:56:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:56:03,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:56:03,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:56:03,328 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 10:56:03,515 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,SelfDestructingSolverStorable2 [2022-04-28 10:56:03,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:56:03,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:56:03,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-28 10:56:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:03,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217739191] [2022-04-28 10:56:08,746 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:56:08,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:56:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 2 times [2022-04-28 10:56:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:56:08,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391936080] [2022-04-28 10:56:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:56:08,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:56:08,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:56:08,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1935883959] [2022-04-28 10:56:08,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:56:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:56:08,762 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 10:56:08,787 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 10:56:08,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:56:08,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:56:08,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:56:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:56:08,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:56:09,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-28 10:56:09,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {957#true} is VALID [2022-04-28 10:56:09,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 10:56:09,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-28 10:56:09,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-28 10:56:09,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {957#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {957#true} is VALID [2022-04-28 10:56:09,234 INFO L272 TraceCheckUtils]: 6: Hoare triple {957#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {957#true} is VALID [2022-04-28 10:56:09,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 10:56:09,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 10:56:09,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 10:56:09,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-28 10:56:09,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 10:56:09,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 10:56:09,236 INFO L272 TraceCheckUtils]: 13: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {957#true} is VALID [2022-04-28 10:56:09,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 10:56:09,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 10:56:09,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 10:56:09,237 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {957#true} {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #70#return; {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 10:56:09,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 10:56:09,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {995#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 10:56:09,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !false; {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 10:56:09,244 INFO L272 TraceCheckUtils]: 21: Hoare triple {1020#(and (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:09,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:09,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-28 10:56:09,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-28 10:56:09,246 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 10:56:09,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:56:24,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-28 10:56:24,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-28 10:56:24,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:24,165 INFO L272 TraceCheckUtils]: 21: Hoare triple {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:24,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:56:24,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1047#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:56:24,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 10:56:24,181 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {957#true} {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} #70#return; {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 10:56:24,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 10:56:24,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 10:56:24,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 10:56:24,182 INFO L272 TraceCheckUtils]: 13: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {957#true} is VALID [2022-04-28 10:56:24,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !false; {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 10:56:24,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {957#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1054#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-28 10:56:24,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-28 10:56:24,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 10:56:24,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-28 10:56:24,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-28 10:56:24,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {957#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {957#true} is VALID [2022-04-28 10:56:24,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {957#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {957#true} is VALID [2022-04-28 10:56:24,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-28 10:56:24,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-28 10:56:24,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-28 10:56:24,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {957#true} is VALID [2022-04-28 10:56:24,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-28 10:56:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:56:24,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:56:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391936080] [2022-04-28 10:56:24,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:56:24,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935883959] [2022-04-28 10:56:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935883959] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:56:24,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:56:24,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-28 10:56:24,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:56:24,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217739191] [2022-04-28 10:56:24,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217739191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:24,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:24,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:56:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748645378] [2022-04-28 10:56:24,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:56:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 10:56:24,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:56:24,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:24,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:24,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:56:24,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:56:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:56:24,218 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:24,590 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 10:56:24,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:56:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 10:56:24,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:56:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:56:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:56:24,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:56:24,668 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 10:56:24,670 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:56:24,670 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:56:24,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:56:24,671 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:56:24,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:56:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:56:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 10:56:24,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:56:24,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:24,725 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:24,725 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:24,730 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 10:56:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 10:56:24,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:24,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:24,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 10:56:24,733 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 46 states. [2022-04-28 10:56:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:24,741 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 10:56:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 10:56:24,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:24,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:24,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:56:24,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:56:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-28 10:56:24,748 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-28 10:56:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:56:24,749 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-28 10:56:24,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:24,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-28 10:56:26,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-28 10:56:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:56:26,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:56:26,955 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:56:26,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:56:27,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:27,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:56:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:56:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 1 times [2022-04-28 10:56:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235278403] [2022-04-28 10:56:27,157 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:56:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 2 times [2022-04-28 10:56:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:56:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606226543] [2022-04-28 10:56:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:56:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:56:27,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:56:27,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [741252794] [2022-04-28 10:56:27,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:56:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:56:27,187 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 10:56:27,215 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 10:56:27,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:56:27,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:56:27,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:56:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:56:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:56:27,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2022-04-28 10:56:27,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1396#true} is VALID [2022-04-28 10:56:27,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-28 10:56:27,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1396#true} #76#return; {1396#true} is VALID [2022-04-28 10:56:27,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {1396#true} call #t~ret6 := main(); {1396#true} is VALID [2022-04-28 10:56:27,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {1396#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1396#true} is VALID [2022-04-28 10:56:27,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {1396#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1396#true} is VALID [2022-04-28 10:56:27,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {1396#true} ~cond := #in~cond; {1422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:56:27,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {1422#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:27,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {1426#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1426#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:27,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1426#(not (= |assume_abort_if_not_#in~cond| 0))} {1396#true} #68#return; {1433#(<= 1 main_~y~0)} is VALID [2022-04-28 10:56:27,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {1433#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1437#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:27,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {1437#(<= 1 main_~b~0)} assume !false; {1437#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:27,397 INFO L272 TraceCheckUtils]: 13: Hoare triple {1437#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1396#true} is VALID [2022-04-28 10:56:27,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-28 10:56:27,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-28 10:56:27,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-28 10:56:27,398 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1396#true} {1437#(<= 1 main_~b~0)} #70#return; {1437#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:27,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {1437#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 10:56:27,399 INFO L272 TraceCheckUtils]: 19: Hoare triple {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1396#true} is VALID [2022-04-28 10:56:27,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-28 10:56:27,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-28 10:56:27,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-28 10:56:27,400 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1396#true} {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} #72#return; {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 10:56:27,400 INFO L272 TraceCheckUtils]: 24: Hoare triple {1459#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:27,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:27,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1397#false} is VALID [2022-04-28 10:56:27,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2022-04-28 10:56:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:56:27,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:56:27,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:56:27,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606226543] [2022-04-28 10:56:27,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:56:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741252794] [2022-04-28 10:56:27,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741252794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:27,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:27,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:56:27,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:56:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235278403] [2022-04-28 10:56:27,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235278403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:27,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:27,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:56:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581695465] [2022-04-28 10:56:27,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:56:27,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-28 10:56:27,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:56:27,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:27,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:27,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:56:27,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:56:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:56:27,423 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:27,785 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-28 10:56:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:56:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-28 10:56:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:56:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 10:56:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 10:56:27,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 10:56:27,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:27,828 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:56:27,828 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:56:27,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:56:27,829 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:56:27,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 138 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:56:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:56:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-28 10:56:27,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:56:27,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:27,873 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:27,873 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:27,875 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 10:56:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 10:56:27,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:27,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:27,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 10:56:27,876 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-28 10:56:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:27,878 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 10:56:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 10:56:27,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:27,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:27,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:56:27,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:56:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:56:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 10:56:27,881 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 28 [2022-04-28 10:56:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:56:27,881 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 10:56:27,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:27,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 10:56:30,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 10:56:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:56:30,104 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:56:30,105 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:56:30,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 10:56:30,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:30,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:56:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:56:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 1 times [2022-04-28 10:56:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:30,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026108147] [2022-04-28 10:56:36,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:56:36,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:56:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 2 times [2022-04-28 10:56:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:56:36,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700238642] [2022-04-28 10:56:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:56:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:56:36,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:56:36,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438750599] [2022-04-28 10:56:36,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:56:36,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:36,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:56:36,120 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 10:56:36,148 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 10:56:36,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:56:36,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:56:36,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:56:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:56:36,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:56:36,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {1806#true} call ULTIMATE.init(); {1806#true} is VALID [2022-04-28 10:56:36,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1806#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1806#true} is VALID [2022-04-28 10:56:36,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-28 10:56:36,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1806#true} {1806#true} #76#return; {1806#true} is VALID [2022-04-28 10:56:36,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {1806#true} call #t~ret6 := main(); {1806#true} is VALID [2022-04-28 10:56:36,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {1806#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1806#true} is VALID [2022-04-28 10:56:36,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {1806#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1806#true} is VALID [2022-04-28 10:56:36,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {1806#true} ~cond := #in~cond; {1832#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:56:36,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {1832#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1836#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:36,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {1836#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1836#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:36,702 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1836#(not (= |assume_abort_if_not_#in~cond| 0))} {1806#true} #68#return; {1843#(<= 1 main_~y~0)} is VALID [2022-04-28 10:56:36,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {1843#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1847#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:36,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(<= 1 main_~b~0)} assume !false; {1847#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:36,703 INFO L272 TraceCheckUtils]: 13: Hoare triple {1847#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1806#true} is VALID [2022-04-28 10:56:36,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-28 10:56:36,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-28 10:56:36,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-28 10:56:36,704 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1806#true} {1847#(<= 1 main_~b~0)} #70#return; {1847#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:36,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {1847#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:56:36,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:56:36,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !false; {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:56:36,707 INFO L272 TraceCheckUtils]: 21: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1806#true} is VALID [2022-04-28 10:56:36,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-28 10:56:36,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-28 10:56:36,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-28 10:56:36,708 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1806#true} {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #70#return; {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:56:36,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {1869#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {1807#false} is VALID [2022-04-28 10:56:36,708 INFO L272 TraceCheckUtils]: 27: Hoare triple {1807#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1807#false} is VALID [2022-04-28 10:56:36,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {1807#false} ~cond := #in~cond; {1807#false} is VALID [2022-04-28 10:56:36,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#false} assume 0 == ~cond; {1807#false} is VALID [2022-04-28 10:56:36,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2022-04-28 10:56:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:56:36,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:56:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:56:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700238642] [2022-04-28 10:56:36,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:56:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438750599] [2022-04-28 10:56:36,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438750599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:36,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:56:36,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:56:36,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026108147] [2022-04-28 10:56:36,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026108147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:36,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:56:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2190976] [2022-04-28 10:56:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:56:36,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-28 10:56:36,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:56:36,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:36,734 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 10:56:36,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:56:36,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:36,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:56:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:56:36,736 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:37,005 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-28 10:56:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:56:37,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-28 10:56:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:56:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 10:56:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 10:56:37,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-28 10:56:37,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:37,059 INFO L225 Difference]: With dead ends: 58 [2022-04-28 10:56:37,060 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:56:37,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:56:37,063 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:56:37,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 109 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:56:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:56:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 10:56:37,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:56:37,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:56:37,114 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:56:37,114 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:56:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:37,118 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 10:56:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 10:56:37,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:37,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:37,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 51 states. [2022-04-28 10:56:37,119 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 51 states. [2022-04-28 10:56:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:37,121 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-28 10:56:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-28 10:56:37,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:37,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:37,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:56:37,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:56:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 10:56:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-28 10:56:37,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 31 [2022-04-28 10:56:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:56:37,125 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-28 10:56:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:56:37,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-28 10:56:39,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 10:56:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:56:39,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:56:39,356 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:56:39,372 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 10:56:39,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:39,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:56:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:56:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 212948645, now seen corresponding path program 1 times [2022-04-28 10:56:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:39,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673937367] [2022-04-28 10:56:45,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:56:45,613 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:56:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash 212948645, now seen corresponding path program 2 times [2022-04-28 10:56:45,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:56:45,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399466890] [2022-04-28 10:56:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:56:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:56:45,624 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:56:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177689449] [2022-04-28 10:56:45,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:56:45,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:45,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:56:45,631 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 10:56:45,637 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 10:56:45,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:56:45,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:56:45,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:56:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:56:45,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:56:55,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-28 10:56:55,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2229#true} is VALID [2022-04-28 10:56:55,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 10:56:55,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-28 10:56:55,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-28 10:56:55,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} #68#return; {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {2229#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2229#true} is VALID [2022-04-28 10:56:55,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#true} assume !false; {2229#true} is VALID [2022-04-28 10:56:55,863 INFO L272 TraceCheckUtils]: 13: Hoare triple {2229#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2229#true} is VALID [2022-04-28 10:56:55,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-28 10:56:55,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-28 10:56:55,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 10:56:55,863 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2229#true} {2229#true} #70#return; {2229#true} is VALID [2022-04-28 10:56:55,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#true} assume !!(0 != ~a~0 && 0 != ~b~0); {2288#(not (= main_~a~0 0))} is VALID [2022-04-28 10:56:55,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2288#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2288#(not (= main_~a~0 0))} is VALID [2022-04-28 10:56:55,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {2288#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2288#(not (= main_~a~0 0))} is VALID [2022-04-28 10:56:55,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {2288#(not (= main_~a~0 0))} is VALID [2022-04-28 10:56:55,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {2288#(not (= main_~a~0 0))} assume !false; {2288#(not (= main_~a~0 0))} is VALID [2022-04-28 10:56:55,866 INFO L272 TraceCheckUtils]: 23: Hoare triple {2288#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2229#true} is VALID [2022-04-28 10:56:55,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#true} ~cond := #in~cond; {2307#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:55,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {2307#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:56:55,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:56:57,869 WARN L284 TraceCheckUtils]: 27: Hoare quadruple {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} {2288#(not (= main_~a~0 0))} #70#return; {2318#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-28 10:56:57,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {2318#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {2322#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:56:57,871 INFO L272 TraceCheckUtils]: 29: Hoare triple {2322#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:57,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {2326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:57,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {2330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-28 10:56:57,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-28 10:56:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:56:57,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:57:22,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-28 10:57:22,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {2330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-28 10:57:22,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {2326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:22,490 INFO L272 TraceCheckUtils]: 29: Hoare triple {2322#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2326#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:57:22,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {2349#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {2322#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:57:22,492 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} {2229#true} #70#return; {2349#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 10:57:22,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:22,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:22,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#true} ~cond := #in~cond; {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:57:22,493 INFO L272 TraceCheckUtils]: 23: Hoare triple {2229#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2229#true} is VALID [2022-04-28 10:57:22,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {2229#true} assume !false; {2229#true} is VALID [2022-04-28 10:57:22,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {2229#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {2229#true} is VALID [2022-04-28 10:57:22,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {2229#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2229#true} is VALID [2022-04-28 10:57:22,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {2229#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2229#true} is VALID [2022-04-28 10:57:22,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#true} assume !!(0 != ~a~0 && 0 != ~b~0); {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2229#true} {2229#true} #70#return; {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L272 TraceCheckUtils]: 13: Hoare triple {2229#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#true} assume !false; {2229#true} is VALID [2022-04-28 10:57:22,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {2229#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} #68#return; {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-28 10:57:22,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-28 10:57:22,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-28 10:57:22,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2229#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2229#true} is VALID [2022-04-28 10:57:22,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-28 10:57:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:57:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:57:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399466890] [2022-04-28 10:57:22,496 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:57:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177689449] [2022-04-28 10:57:22,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177689449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:57:22,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:57:22,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 10:57:22,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:57:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673937367] [2022-04-28 10:57:22,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673937367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:57:22,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:57:22,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:57:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125837598] [2022-04-28 10:57:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:57:22,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-04-28 10:57:22,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:57:22,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:57:24,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:57:24,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:57:24,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:57:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:57:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:57:24,527 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:57:29,285 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 10:57:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:57:29,907 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-28 10:57:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:57:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-04-28 10:57:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:57:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:57:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 10:57:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:57:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 10:57:29,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 10:57:31,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:57:31,958 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:57:31,958 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:57:31,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:57:31,959 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:57:31,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 10:57:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:57:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-04-28 10:57:32,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:57:32,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:57:32,007 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:57:32,007 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:57:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:57:32,010 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-28 10:57:32,010 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-28 10:57:32,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:57:32,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:57:32,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 64 states. [2022-04-28 10:57:32,011 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 64 states. [2022-04-28 10:57:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:57:32,013 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-28 10:57:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-28 10:57:32,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:57:32,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:57:32,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:57:32,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:57:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 10:57:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 10:57:32,016 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 33 [2022-04-28 10:57:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:57:32,016 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-28 10:57:32,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:57:32,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-28 10:57:38,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 69 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:57:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-28 10:57:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:57:38,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:57:38,205 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:57:38,221 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 10:57:38,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:57:38,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:57:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:57:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 471114083, now seen corresponding path program 1 times [2022-04-28 10:57:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:57:38,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006819252] [2022-04-28 10:57:44,462 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:57:44,462 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:57:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 471114083, now seen corresponding path program 2 times [2022-04-28 10:57:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:57:44,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600501432] [2022-04-28 10:57:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:57:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:57:44,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:57:44,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664933707] [2022-04-28 10:57:44,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:57:44,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:57:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:57:44,476 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 10:57:44,485 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 10:57:44,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:57:44,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:57:44,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:57:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:57:44,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:57:55,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2022-04-28 10:57:55,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {2819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2819#true} is VALID [2022-04-28 10:57:55,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-28 10:57:55,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #76#return; {2819#true} is VALID [2022-04-28 10:57:55,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret6 := main(); {2819#true} is VALID [2022-04-28 10:57:55,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {2819#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2819#true} is VALID [2022-04-28 10:57:55,022 INFO L272 TraceCheckUtils]: 6: Hoare triple {2819#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2819#true} is VALID [2022-04-28 10:57:55,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {2819#true} ~cond := #in~cond; {2845#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:57:55,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2849#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:57:55,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {2849#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2849#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:57:55,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2849#(not (= |assume_abort_if_not_#in~cond| 0))} {2819#true} #68#return; {2856#(<= 1 main_~y~0)} is VALID [2022-04-28 10:57:55,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {2856#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:55,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:55,025 INFO L272 TraceCheckUtils]: 13: Hoare triple {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2819#true} is VALID [2022-04-28 10:57:55,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {2819#true} ~cond := #in~cond; {2819#true} is VALID [2022-04-28 10:57:55,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#true} assume !(0 == ~cond); {2819#true} is VALID [2022-04-28 10:57:55,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-28 10:57:55,026 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2819#true} {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:55,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:55,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:55,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:55,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {2860#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {2891#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 10:57:55,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {2891#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} assume !false; {2891#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 10:57:55,028 INFO L272 TraceCheckUtils]: 23: Hoare triple {2891#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2819#true} is VALID [2022-04-28 10:57:55,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {2819#true} ~cond := #in~cond; {2901#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:55,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {2901#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:55,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:57,031 WARN L284 TraceCheckUtils]: 27: Hoare quadruple {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} {2891#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} #70#return; {2912#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-28 10:57:57,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {2912#(and (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {2916#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-28 10:57:57,033 INFO L272 TraceCheckUtils]: 29: Hoare triple {2916#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:57:57,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {2920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:57,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {2924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2820#false} is VALID [2022-04-28 10:57:57,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2022-04-28 10:57:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:57:57,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:58:35,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2022-04-28 10:58:35,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {2924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2820#false} is VALID [2022-04-28 10:58:35,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {2920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:35,671 INFO L272 TraceCheckUtils]: 29: Hoare triple {2940#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2920#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:35,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {2944#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {2940#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:58:35,673 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} {2819#true} #70#return; {2944#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 10:58:35,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:58:35,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {2957#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2905#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:58:35,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {2819#true} ~cond := #in~cond; {2957#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:58:35,674 INFO L272 TraceCheckUtils]: 23: Hoare triple {2819#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2819#true} is VALID [2022-04-28 10:58:35,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {2819#true} assume !false; {2819#true} is VALID [2022-04-28 10:58:35,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2819#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {2819#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {2819#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {2819#true} assume !!(0 != ~a~0 && 0 != ~b~0); {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2819#true} {2819#true} #70#return; {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#true} assume !(0 == ~cond); {2819#true} is VALID [2022-04-28 10:58:35,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2819#true} ~cond := #in~cond; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L272 TraceCheckUtils]: 13: Hoare triple {2819#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {2819#true} assume !false; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {2819#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2819#true} {2819#true} #68#return; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {2819#true} assume !(0 == ~cond); {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {2819#true} ~cond := #in~cond; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L272 TraceCheckUtils]: 6: Hoare triple {2819#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {2819#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2819#true} is VALID [2022-04-28 10:58:35,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret6 := main(); {2819#true} is VALID [2022-04-28 10:58:35,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #76#return; {2819#true} is VALID [2022-04-28 10:58:35,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-28 10:58:35,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {2819#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2819#true} is VALID [2022-04-28 10:58:35,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2022-04-28 10:58:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:58:35,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:35,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600501432] [2022-04-28 10:58:35,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:35,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664933707] [2022-04-28 10:58:35,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664933707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:58:35,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:58:35,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 10:58:35,678 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:35,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006819252] [2022-04-28 10:58:35,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006819252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:35,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:35,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:58:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570521908] [2022-04-28 10:58:35,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:35,679 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 10:58:35,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:35,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:37,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:37,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:58:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:58:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:58:37,709 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:46,308 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-04-28 10:58:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:58:46,309 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-28 10:58:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-04-28 10:58:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-04-28 10:58:46,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 63 transitions. [2022-04-28 10:58:50,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 61 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:50,377 INFO L225 Difference]: With dead ends: 81 [2022-04-28 10:58:50,377 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 10:58:50,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:58:50,378 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:50,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 10:58:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 10:58:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2022-04-28 10:58:50,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:50,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:58:50,429 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:58:50,429 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:58:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:50,432 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-04-28 10:58:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-04-28 10:58:50,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:50,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:50,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-28 10:58:50,433 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-28 10:58:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:50,437 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-04-28 10:58:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-04-28 10:58:50,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:50,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:50,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:50,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:50,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 10:58:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-04-28 10:58:50,440 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 33 [2022-04-28 10:58:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:50,441 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-04-28 10:58:50,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:50,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 83 transitions. [2022-04-28 10:58:58,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 79 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-28 10:58:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:58:58,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:58,707 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:58,723 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 10:58:58,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:58,908 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:58,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash 694423764, now seen corresponding path program 1 times [2022-04-28 10:58:58,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:58,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443063916] [2022-04-28 10:59:03,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:03,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash 694423764, now seen corresponding path program 2 times [2022-04-28 10:59:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:03,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378621649] [2022-04-28 10:59:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:03,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:03,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:03,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431955324] [2022-04-28 10:59:03,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:03,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:03,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:03,609 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:59:03,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:59:03,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:03,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:03,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 10:59:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:03,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:03,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {3490#true} call ULTIMATE.init(); {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {3490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3490#true} {3490#true} #76#return; {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {3490#true} call #t~ret6 := main(); {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {3490#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {3490#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3490#true} is VALID [2022-04-28 10:59:03,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3490#true} {3490#true} #68#return; {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {3490#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {3490#true} assume !false; {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L272 TraceCheckUtils]: 13: Hoare triple {3490#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-28 10:59:03,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-28 10:59:03,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-28 10:59:03,786 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3490#true} {3490#true} #70#return; {3490#true} is VALID [2022-04-28 10:59:03,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {3490#true} assume !!(0 != ~a~0 && 0 != ~b~0); {3549#(not (= main_~a~0 0))} is VALID [2022-04-28 10:59:03,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {3549#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3549#(not (= main_~a~0 0))} is VALID [2022-04-28 10:59:03,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {3549#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3549#(not (= main_~a~0 0))} is VALID [2022-04-28 10:59:03,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {3549#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3549#(not (= main_~a~0 0))} is VALID [2022-04-28 10:59:03,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {3549#(not (= main_~a~0 0))} assume !false; {3549#(not (= main_~a~0 0))} is VALID [2022-04-28 10:59:03,788 INFO L272 TraceCheckUtils]: 23: Hoare triple {3549#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3490#true} is VALID [2022-04-28 10:59:03,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-28 10:59:03,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-28 10:59:03,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-28 10:59:03,788 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3490#true} {3549#(not (= main_~a~0 0))} #70#return; {3549#(not (= main_~a~0 0))} is VALID [2022-04-28 10:59:03,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {3549#(not (= main_~a~0 0))} assume !(0 != ~a~0 && 0 != ~b~0); {3580#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-28 10:59:03,789 INFO L272 TraceCheckUtils]: 29: Hoare triple {3580#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {3490#true} is VALID [2022-04-28 10:59:03,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-28 10:59:03,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-28 10:59:03,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-28 10:59:03,790 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3490#true} {3580#(and (= main_~b~0 0) (not (= main_~a~0 0)))} #72#return; {3580#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-28 10:59:03,790 INFO L272 TraceCheckUtils]: 34: Hoare triple {3580#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {3599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:03,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {3599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3603#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:03,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {3603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3491#false} is VALID [2022-04-28 10:59:03,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {3491#false} assume !false; {3491#false} is VALID [2022-04-28 10:59:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:59:03,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:59:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378621649] [2022-04-28 10:59:03,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431955324] [2022-04-28 10:59:03,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431955324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:03,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:03,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:59:03,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:03,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443063916] [2022-04-28 10:59:03,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443063916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:03,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:03,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:59:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213621259] [2022-04-28 10:59:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:03,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 10:59:03,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:03,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 10:59:03,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:03,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:59:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:59:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:59:03,820 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 10:59:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:04,022 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-28 10:59:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:59:04,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 10:59:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 10:59:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 10:59:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 10:59:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 10:59:04,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 10:59:04,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:04,062 INFO L225 Difference]: With dead ends: 75 [2022-04-28 10:59:04,062 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 10:59:04,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:59:04,063 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:04,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:59:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 10:59:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 10:59:04,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:04,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:04,127 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:04,127 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:04,129 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-28 10:59:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-28 10:59:04,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:04,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:04,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-28 10:59:04,130 INFO L87 Difference]: Start difference. First operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 67 states. [2022-04-28 10:59:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:04,132 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-28 10:59:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-28 10:59:04,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:04,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:04,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:04,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 49 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:59:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-28 10:59:04,135 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 38 [2022-04-28 10:59:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:04,135 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-28 10:59:04,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 10:59:04,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 86 transitions. [2022-04-28 10:59:14,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 81 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-28 10:59:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:59:14,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:14,409 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:14,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:59:14,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 10:59:14,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash -893924138, now seen corresponding path program 1 times [2022-04-28 10:59:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:14,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181438839] [2022-04-28 10:59:20,242 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:20,242 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -893924138, now seen corresponding path program 2 times [2022-04-28 10:59:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:20,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586568663] [2022-04-28 10:59:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:20,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:20,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1125932543] [2022-04-28 10:59:20,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:20,255 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:59:20,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:59:20,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:20,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:20,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:59:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:20,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:20,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-28 10:59:20,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-28 10:59:20,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #76#return; {4029#true} is VALID [2022-04-28 10:59:20,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret6 := main(); {4029#true} is VALID [2022-04-28 10:59:20,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4029#true} is VALID [2022-04-28 10:59:20,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {4029#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {4029#true} ~cond := #in~cond; {4055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:59:20,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {4055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4059#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:59:20,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {4059#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4059#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:59:20,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4059#(not (= |assume_abort_if_not_#in~cond| 0))} {4029#true} #68#return; {4066#(<= 1 main_~y~0)} is VALID [2022-04-28 10:59:20,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {4066#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4070#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:20,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {4070#(<= 1 main_~b~0)} assume !false; {4070#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:20,554 INFO L272 TraceCheckUtils]: 13: Hoare triple {4070#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,555 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4029#true} {4070#(<= 1 main_~b~0)} #70#return; {4070#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:20,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {4070#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {4070#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:20,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {4070#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4070#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:20,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {4070#(<= 1 main_~b~0)} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4070#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:20,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {4070#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4101#(<= 0 main_~b~0)} is VALID [2022-04-28 10:59:20,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {4101#(<= 0 main_~b~0)} assume !false; {4101#(<= 0 main_~b~0)} is VALID [2022-04-28 10:59:20,557 INFO L272 TraceCheckUtils]: 23: Hoare triple {4101#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,559 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4029#true} {4101#(<= 0 main_~b~0)} #70#return; {4101#(<= 0 main_~b~0)} is VALID [2022-04-28 10:59:20,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {4101#(<= 0 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {4123#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 10:59:20,559 INFO L272 TraceCheckUtils]: 29: Hoare triple {4123#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,560 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4029#true} {4123#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} #72#return; {4123#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 10:59:20,562 INFO L272 TraceCheckUtils]: 34: Hoare triple {4123#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:20,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:20,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {4146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-28 10:59:20,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-28 10:59:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:59:20,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:20,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-28 10:59:20,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {4146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-28 10:59:20,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:20,769 INFO L272 TraceCheckUtils]: 34: Hoare triple {4162#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:20,769 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4029#true} {4162#(= (* main_~b~0 main_~a~0) 0)} #72#return; {4162#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 10:59:20,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,770 INFO L272 TraceCheckUtils]: 29: Hoare triple {4162#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {4029#true} assume !(0 != ~a~0 && 0 != ~b~0); {4162#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 10:59:20,771 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4029#true} {4029#true} #70#return; {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L272 TraceCheckUtils]: 23: Hoare triple {4029#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {4029#true} assume !false; {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {4029#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {4029#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {4029#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4029#true} is VALID [2022-04-28 10:59:20,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4029#true} is VALID [2022-04-28 10:59:20,773 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4029#true} {4029#true} #70#return; {4029#true} is VALID [2022-04-28 10:59:20,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,774 INFO L272 TraceCheckUtils]: 13: Hoare triple {4029#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#true} assume !false; {4029#true} is VALID [2022-04-28 10:59:20,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4029#true} {4029#true} #68#return; {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {4029#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {4029#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4029#true} is VALID [2022-04-28 10:59:20,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret6 := main(); {4029#true} is VALID [2022-04-28 10:59:20,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #76#return; {4029#true} is VALID [2022-04-28 10:59:20,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-28 10:59:20,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4029#true} is VALID [2022-04-28 10:59:20,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-28 10:59:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:59:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:20,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586568663] [2022-04-28 10:59:20,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:20,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125932543] [2022-04-28 10:59:20,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125932543] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:59:20,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:59:20,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 10:59:20,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:20,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181438839] [2022-04-28 10:59:20,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181438839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:20,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:20,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:59:20,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165414642] [2022-04-28 10:59:20,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:20,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-28 10:59:20,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:20,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:59:20,805 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 10:59:20,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:59:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:59:20,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:59:20,806 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:59:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:21,138 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-04-28 10:59:21,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:59:21,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-28 10:59:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:59:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:59:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:59:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-28 10:59:21,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-28 10:59:21,173 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 10:59:21,174 INFO L225 Difference]: With dead ends: 73 [2022-04-28 10:59:21,174 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:59:21,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:59:21,175 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:21,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 105 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:59:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:59:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-04-28 10:59:21,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:21,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:59:21,222 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:59:21,222 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:59:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:21,225 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-28 10:59:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-28 10:59:21,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:21,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:21,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 59 states. [2022-04-28 10:59:21,227 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 59 states. [2022-04-28 10:59:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:21,228 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-28 10:59:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-28 10:59:21,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:21,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:21,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:21,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:59:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 10:59:21,233 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 38 [2022-04-28 10:59:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:21,233 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 10:59:21,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:59:21,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 10:59:27,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 55 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 10:59:27,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:59:27,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:27,443 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:27,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:59:27,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:59:27,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1791170484, now seen corresponding path program 1 times [2022-04-28 10:59:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:27,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046134626] [2022-04-28 10:59:37,759 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:37,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1791170484, now seen corresponding path program 2 times [2022-04-28 10:59:37,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:37,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301974325] [2022-04-28 10:59:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:37,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:37,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636437677] [2022-04-28 10:59:37,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:37,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:37,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:37,783 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:59:37,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 10:59:37,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:37,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:37,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:59:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:37,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:48,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {4627#true} call ULTIMATE.init(); {4627#true} is VALID [2022-04-28 10:59:48,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {4627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4627#true} is VALID [2022-04-28 10:59:48,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 10:59:48,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4627#true} {4627#true} #76#return; {4627#true} is VALID [2022-04-28 10:59:48,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {4627#true} call #t~ret6 := main(); {4627#true} is VALID [2022-04-28 10:59:48,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {4627#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4627#true} is VALID [2022-04-28 10:59:48,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {4627#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4627#true} {4627#true} #68#return; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {4627#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {4627#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 10:59:48,013 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {4627#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L272 TraceCheckUtils]: 21: Hoare triple {4627#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 10:59:48,014 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-28 10:59:48,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4710#(not (= main_~b~0 0))} is VALID [2022-04-28 10:59:48,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {4710#(not (= main_~b~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4710#(not (= main_~b~0 0))} is VALID [2022-04-28 10:59:48,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {4710#(not (= main_~b~0 0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {4710#(not (= main_~b~0 0))} is VALID [2022-04-28 10:59:48,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {4710#(not (= main_~b~0 0))} assume !false; {4710#(not (= main_~b~0 0))} is VALID [2022-04-28 10:59:48,016 INFO L272 TraceCheckUtils]: 30: Hoare triple {4710#(not (= main_~b~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4627#true} is VALID [2022-04-28 10:59:48,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {4627#true} ~cond := #in~cond; {4726#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:48,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {4726#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:48,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:50,020 WARN L284 TraceCheckUtils]: 34: Hoare quadruple {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} {4710#(not (= main_~b~0 0))} #70#return; {4737#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} is UNKNOWN [2022-04-28 10:59:50,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {4737#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {4741#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 10:59:50,021 INFO L272 TraceCheckUtils]: 36: Hoare triple {4741#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:50,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:50,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4628#false} is VALID [2022-04-28 10:59:50,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {4628#false} assume !false; {4628#false} is VALID [2022-04-28 10:59:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 10:59:50,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:00:16,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {4628#false} assume !false; {4628#false} is VALID [2022-04-28 11:00:16,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4628#false} is VALID [2022-04-28 11:00:16,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:00:16,171 INFO L272 TraceCheckUtils]: 36: Hoare triple {4741#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:00:16,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {4768#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {4741#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 11:00:16,174 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} {4627#true} #70#return; {4768#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 11:00:16,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:00:16,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {4781#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4730#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {4627#true} ~cond := #in~cond; {4781#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:00:16,176 INFO L272 TraceCheckUtils]: 30: Hoare triple {4627#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {4627#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {4627#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 11:00:16,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L272 TraceCheckUtils]: 21: Hoare triple {4627#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {4627#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 11:00:16,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L272 TraceCheckUtils]: 13: Hoare triple {4627#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {4627#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4627#true} {4627#true} #68#return; {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-28 11:00:16,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {4627#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {4627#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {4627#true} call #t~ret6 := main(); {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4627#true} {4627#true} #76#return; {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {4627#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {4627#true} call ULTIMATE.init(); {4627#true} is VALID [2022-04-28 11:00:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 11:00:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:00:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301974325] [2022-04-28 11:00:16,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:00:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636437677] [2022-04-28 11:00:16,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636437677] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:00:16,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:00:16,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 11:00:16,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:00:16,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046134626] [2022-04-28 11:00:16,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046134626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:00:16,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:00:16,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:00:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147524796] [2022-04-28 11:00:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:00:16,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 11:00:16,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:00:16,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:00:18,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:00:18,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:00:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:00:18,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:00:18,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:00:18,216 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:00:21,542 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 11:00:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:00:24,229 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-04-28 11:00:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:00:24,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 11:00:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:00:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:00:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 11:00:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:00:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-28 11:00:24,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-28 11:00:26,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:00:26,267 INFO L225 Difference]: With dead ends: 70 [2022-04-28 11:00:26,267 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 11:00:26,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:00:26,268 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:00:26,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 11:00:26,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 11:00:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2022-04-28 11:00:26,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:00:26,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:00:26,305 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:00:26,305 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:00:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:00:26,306 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 11:00:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 11:00:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:00:26,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:00:26,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 65 states. [2022-04-28 11:00:26,307 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 65 states. [2022-04-28 11:00:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:00:26,309 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 11:00:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 11:00:26,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:00:26,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:00:26,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:00:26,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:00:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:00:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 11:00:26,311 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 40 [2022-04-28 11:00:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:00:26,311 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 11:00:26,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 11:00:26,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-28 11:00:30,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:00:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 11:00:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 11:00:30,511 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:00:30,511 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:00:30,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 11:00:30,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 11:00:30,712 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:00:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:00:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -304375484, now seen corresponding path program 1 times [2022-04-28 11:00:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:00:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589937018] [2022-04-28 11:00:42,831 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:00:42,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:00:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -304375484, now seen corresponding path program 2 times [2022-04-28 11:00:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:00:42,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716269739] [2022-04-28 11:00:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:00:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:00:42,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:00:42,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868876154] [2022-04-28 11:00:42,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:00:42,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:00:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:00:42,848 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:00:42,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 11:00:42,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:00:42,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:00:42,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:00:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:00:42,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:00:54,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {5237#true} call ULTIMATE.init(); {5237#true} is VALID [2022-04-28 11:00:54,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {5237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5237#true} is VALID [2022-04-28 11:00:54,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:00:54,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5237#true} {5237#true} #76#return; {5237#true} is VALID [2022-04-28 11:00:54,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {5237#true} call #t~ret6 := main(); {5237#true} is VALID [2022-04-28 11:00:54,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {5237#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5237#true} is VALID [2022-04-28 11:00:54,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {5237#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:00:54,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {5237#true} ~cond := #in~cond; {5263#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:00:54,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {5263#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:00:54,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {5267#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:00:54,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5267#(not (= |assume_abort_if_not_#in~cond| 0))} {5237#true} #68#return; {5274#(<= 1 main_~y~0)} is VALID [2022-04-28 11:00:54,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {5274#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,218 INFO L272 TraceCheckUtils]: 13: Hoare triple {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:00:54,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-28 11:00:54,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-28 11:00:54,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:00:54,219 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5237#true} {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {5278#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !false; {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,221 INFO L272 TraceCheckUtils]: 21: Hoare triple {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:00:54,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-28 11:00:54,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-28 11:00:54,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:00:54,222 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5237#true} {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} #70#return; {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {5303#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5334#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {5334#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} assume !false; {5334#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:54,225 INFO L272 TraceCheckUtils]: 31: Hoare triple {5334#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:00:54,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {5237#true} ~cond := #in~cond; {5344#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:00:54,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {5344#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:00:54,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:00:56,229 WARN L284 TraceCheckUtils]: 35: Hoare quadruple {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} {5334#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} #70#return; {5355#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-28 11:00:56,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {5355#(and (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {5359#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:00:56,231 INFO L272 TraceCheckUtils]: 37: Hoare triple {5359#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:00:56,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {5363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:00:56,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5238#false} is VALID [2022-04-28 11:00:56,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-04-28 11:00:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:00:56,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:01:21,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-04-28 11:01:21,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5238#false} is VALID [2022-04-28 11:01:21,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {5363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:01:21,541 INFO L272 TraceCheckUtils]: 37: Hoare triple {5383#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:01:21,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {5387#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5383#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 11:01:21,543 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} {5237#true} #70#return; {5387#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 11:01:21,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:01:21,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {5400#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5348#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:01:21,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {5237#true} ~cond := #in~cond; {5400#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:01:21,544 INFO L272 TraceCheckUtils]: 31: Hoare triple {5237#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:01:21,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {5237#true} assume !false; {5237#true} is VALID [2022-04-28 11:01:21,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {5237#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {5237#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {5237#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {5237#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5237#true} {5237#true} #70#return; {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L272 TraceCheckUtils]: 21: Hoare triple {5237#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {5237#true} assume !false; {5237#true} is VALID [2022-04-28 11:01:21,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {5237#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {5237#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5237#true} {5237#true} #70#return; {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L272 TraceCheckUtils]: 13: Hoare triple {5237#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {5237#true} assume !false; {5237#true} is VALID [2022-04-28 11:01:21,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {5237#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5237#true} {5237#true} #68#return; {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L272 TraceCheckUtils]: 6: Hoare triple {5237#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {5237#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {5237#true} call #t~ret6 := main(); {5237#true} is VALID [2022-04-28 11:01:21,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5237#true} {5237#true} #76#return; {5237#true} is VALID [2022-04-28 11:01:21,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-28 11:01:21,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {5237#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5237#true} is VALID [2022-04-28 11:01:21,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {5237#true} call ULTIMATE.init(); {5237#true} is VALID [2022-04-28 11:01:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 11:01:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:01:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716269739] [2022-04-28 11:01:21,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:01:21,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868876154] [2022-04-28 11:01:21,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868876154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:01:21,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:01:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 17 [2022-04-28 11:01:21,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:01:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589937018] [2022-04-28 11:01:21,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589937018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:01:21,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:01:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:01:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549665301] [2022-04-28 11:01:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:01:21,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 11:01:21,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:01:21,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:01:23,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:01:23,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:01:23,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:01:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:01:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:01:23,588 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:01:27,037 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 11:01:36,093 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 11:01:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:01:36,855 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-28 11:01:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 11:01:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 11:01:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:01:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:01:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-04-28 11:01:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:01:36,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-04-28 11:01:36,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 67 transitions. [2022-04-28 11:01:42,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 64 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 11:01:42,934 INFO L225 Difference]: With dead ends: 62 [2022-04-28 11:01:42,934 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 11:01:42,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:01:42,935 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 30 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:01:42,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 197 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 11:01:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 11:01:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-04-28 11:01:42,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:01:42,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:01:42,988 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:01:42,988 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:01:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:01:42,989 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-28 11:01:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-04-28 11:01:42,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:01:42,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:01:42,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 57 states. [2022-04-28 11:01:42,990 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 57 states. [2022-04-28 11:01:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:01:42,991 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-28 11:01:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-04-28 11:01:42,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:01:42,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:01:42,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:01:42,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:01:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:01:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-28 11:01:42,993 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 41 [2022-04-28 11:01:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:01:42,993 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-28 11:01:42,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:01:42,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-28 11:01:49,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 55 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 11:01:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-28 11:01:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 11:01:49,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:01:49,279 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:01:49,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 11:01:49,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:01:49,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:01:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:01:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1695567937, now seen corresponding path program 1 times [2022-04-28 11:01:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:01:49,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897894689] [2022-04-28 11:01:59,601 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:01:59,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:01:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1695567937, now seen corresponding path program 2 times [2022-04-28 11:01:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:01:59,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571117050] [2022-04-28 11:01:59,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:01:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:01:59,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:01:59,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386967158] [2022-04-28 11:01:59,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:01:59,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:01:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:01:59,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:01:59,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 11:01:59,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:01:59,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:01:59,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:01:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:01:59,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:02:00,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {5843#true} call ULTIMATE.init(); {5843#true} is VALID [2022-04-28 11:02:00,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {5843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5843#true} is VALID [2022-04-28 11:02:00,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5843#true} {5843#true} #76#return; {5843#true} is VALID [2022-04-28 11:02:00,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {5843#true} call #t~ret6 := main(); {5843#true} is VALID [2022-04-28 11:02:00,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {5843#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5843#true} is VALID [2022-04-28 11:02:00,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {5843#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5843#true} {5843#true} #68#return; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {5843#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#true} assume !false; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L272 TraceCheckUtils]: 13: Hoare triple {5843#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,139 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5843#true} {5843#true} #70#return; {5843#true} is VALID [2022-04-28 11:02:00,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {5843#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5902#(not (= main_~b~0 0))} is VALID [2022-04-28 11:02:00,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {5902#(not (= main_~b~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5902#(not (= main_~b~0 0))} is VALID [2022-04-28 11:02:00,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {5902#(not (= main_~b~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5902#(not (= main_~b~0 0))} is VALID [2022-04-28 11:02:00,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {5902#(not (= main_~b~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !false; {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,142 INFO L272 TraceCheckUtils]: 23: Hoare triple {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,142 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5843#true} {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} #70#return; {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {5912#(and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L272 TraceCheckUtils]: 33: Hoare triple {5844#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {5844#false} ~cond := #in~cond; {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {5844#false} assume !(0 == ~cond); {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {5844#false} assume true; {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5844#false} {5844#false} #70#return; {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {5844#false} assume !(0 != ~a~0 && 0 != ~b~0); {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L272 TraceCheckUtils]: 39: Hoare triple {5844#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {5844#false} ~cond := #in~cond; {5844#false} is VALID [2022-04-28 11:02:00,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {5844#false} assume 0 == ~cond; {5844#false} is VALID [2022-04-28 11:02:00,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-28 11:02:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:02:00,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:02:00,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-28 11:02:00,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {5844#false} assume 0 == ~cond; {5844#false} is VALID [2022-04-28 11:02:00,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {5844#false} ~cond := #in~cond; {5844#false} is VALID [2022-04-28 11:02:00,506 INFO L272 TraceCheckUtils]: 39: Hoare triple {5844#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5844#false} is VALID [2022-04-28 11:02:00,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {5844#false} assume !(0 != ~a~0 && 0 != ~b~0); {5844#false} is VALID [2022-04-28 11:02:00,507 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5843#true} {5844#false} #70#return; {5844#false} is VALID [2022-04-28 11:02:00,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,507 INFO L272 TraceCheckUtils]: 33: Hoare triple {5844#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-28 11:02:00,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {5844#false} is VALID [2022-04-28 11:02:00,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5937#(and (not (= (mod main_~b~0 2) 0)) (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:02:00,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} assume !!(0 != ~a~0 && 0 != ~b~0); {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} is VALID [2022-04-28 11:02:00,510 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5843#true} {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} #70#return; {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} is VALID [2022-04-28 11:02:00,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,511 INFO L272 TraceCheckUtils]: 23: Hoare triple {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} assume !false; {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} is VALID [2022-04-28 11:02:00,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {5843#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {6016#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~a~0 2) 0) (< 0 (+ main_~b~0 1))))} is VALID [2022-04-28 11:02:00,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {5843#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5843#true} is VALID [2022-04-28 11:02:00,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {5843#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5843#true} is VALID [2022-04-28 11:02:00,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {5843#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5843#true} {5843#true} #70#return; {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L272 TraceCheckUtils]: 13: Hoare triple {5843#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#true} assume !false; {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {5843#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5843#true} is VALID [2022-04-28 11:02:00,515 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5843#true} {5843#true} #68#return; {5843#true} is VALID [2022-04-28 11:02:00,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {5843#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {5843#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {5843#true} call #t~ret6 := main(); {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5843#true} {5843#true} #76#return; {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {5843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {5843#true} call ULTIMATE.init(); {5843#true} is VALID [2022-04-28 11:02:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:02:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:02:00,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571117050] [2022-04-28 11:02:00,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:02:00,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386967158] [2022-04-28 11:02:00,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386967158] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 11:02:00,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:02:00,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-04-28 11:02:00,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:02:00,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897894689] [2022-04-28 11:02:00,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897894689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:00,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:00,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 11:02:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155619645] [2022-04-28 11:02:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:02:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2022-04-28 11:02:00,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:02:00,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:02:00,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:00,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 11:02:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:00,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 11:02:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:02:00,558 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:02:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:00,783 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2022-04-28 11:02:00,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 11:02:00,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2022-04-28 11:02:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:02:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:02:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 11:02:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:02:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-28 11:02:00,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-28 11:02:00,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:00,828 INFO L225 Difference]: With dead ends: 91 [2022-04-28 11:02:00,828 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 11:02:00,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:02:00,829 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:02:00,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:02:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 11:02:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-04-28 11:02:00,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:02:00,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:00,916 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:00,916 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:00,917 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-04-28 11:02:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-04-28 11:02:00,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:00,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:00,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 62 states. [2022-04-28 11:02:00,918 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 62 states. [2022-04-28 11:02:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:00,919 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-04-28 11:02:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-04-28 11:02:00,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:00,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:00,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:02:00,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:02:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 11:02:00,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 43 [2022-04-28 11:02:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:02:00,921 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-28 11:02:00,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 11:02:00,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-28 11:02:09,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 65 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 11:02:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 11:02:09,233 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:02:09,233 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:02:09,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:02:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:02:09,435 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:02:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:02:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1476713219, now seen corresponding path program 3 times [2022-04-28 11:02:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36105089] [2022-04-28 11:02:15,485 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:02:15,485 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:02:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1476713219, now seen corresponding path program 4 times [2022-04-28 11:02:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:02:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117153334] [2022-04-28 11:02:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:02:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:02:15,497 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:02:15,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793753992] [2022-04-28 11:02:15,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:02:15,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:02:15,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:02:15,500 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:02:15,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 11:02:15,546 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:02:15,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:02:15,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 11:02:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:15,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:02:15,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {6522#true} call ULTIMATE.init(); {6522#true} is VALID [2022-04-28 11:02:15,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {6522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6522#true} is VALID [2022-04-28 11:02:15,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:15,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6522#true} {6522#true} #76#return; {6522#true} is VALID [2022-04-28 11:02:15,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {6522#true} call #t~ret6 := main(); {6522#true} is VALID [2022-04-28 11:02:15,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {6522#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6522#true} is VALID [2022-04-28 11:02:15,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {6522#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:15,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {6522#true} ~cond := #in~cond; {6548#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:02:15,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {6548#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6552#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:15,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6552#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:15,995 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6552#(not (= |assume_abort_if_not_#in~cond| 0))} {6522#true} #68#return; {6559#(<= 1 main_~y~0)} is VALID [2022-04-28 11:02:15,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {6559#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6563#(<= 1 main_~b~0)} is VALID [2022-04-28 11:02:15,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {6563#(<= 1 main_~b~0)} assume !false; {6563#(<= 1 main_~b~0)} is VALID [2022-04-28 11:02:15,996 INFO L272 TraceCheckUtils]: 13: Hoare triple {6563#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:15,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-28 11:02:15,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-28 11:02:15,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:15,997 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6522#true} {6563#(<= 1 main_~b~0)} #70#return; {6563#(<= 1 main_~b~0)} is VALID [2022-04-28 11:02:15,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {6563#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {6563#(<= 1 main_~b~0)} is VALID [2022-04-28 11:02:15,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {6563#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6588#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} is VALID [2022-04-28 11:02:16,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {6588#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6592#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (or (not (= (mod main_~b~0 2) 0)) (< main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:02:16,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {6592#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (or (not (= (mod main_~b~0 2) 0)) (< main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !false; {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,003 INFO L272 TraceCheckUtils]: 23: Hoare triple {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:16,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-28 11:02:16,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-28 11:02:16,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:16,004 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6522#true} {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} #70#return; {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {6596#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {6618#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (not (= main_~b~0 0)) (not (= main_~a~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {6618#(and (or (not (= 0 (mod (+ main_~b~0 1) 2))) (< (+ main_~a~0 1) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (not (= main_~b~0 0)) (not (= main_~a~0 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6622#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (< (+ main_~a~0 1) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {6622#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (< (+ main_~a~0 1) 0) (<= 0 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6622#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (< (+ main_~a~0 1) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {6622#(and (not (= (mod main_~b~0 2) 0)) (not (= (mod (+ main_~a~0 1) 2) 0)) (< (+ main_~a~0 1) 0) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6523#false} is VALID [2022-04-28 11:02:16,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {6523#false} assume !false; {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L272 TraceCheckUtils]: 33: Hoare triple {6523#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {6523#false} ~cond := #in~cond; {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 35: Hoare triple {6523#false} assume !(0 == ~cond); {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {6523#false} assume true; {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6523#false} {6523#false} #70#return; {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {6523#false} assume !(0 != ~a~0 && 0 != ~b~0); {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L272 TraceCheckUtils]: 39: Hoare triple {6523#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#false} ~cond := #in~cond; {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#false} assume 0 == ~cond; {6523#false} is VALID [2022-04-28 11:02:16,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#false} assume !false; {6523#false} is VALID [2022-04-28 11:02:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:02:16,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:02:16,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#false} assume !false; {6523#false} is VALID [2022-04-28 11:02:16,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#false} assume 0 == ~cond; {6523#false} is VALID [2022-04-28 11:02:16,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#false} ~cond := #in~cond; {6523#false} is VALID [2022-04-28 11:02:16,883 INFO L272 TraceCheckUtils]: 39: Hoare triple {6523#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6523#false} is VALID [2022-04-28 11:02:16,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {6523#false} is VALID [2022-04-28 11:02:16,884 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6522#true} {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #70#return; {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-28 11:02:16,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:16,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-28 11:02:16,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-28 11:02:16,885 INFO L272 TraceCheckUtils]: 33: Hoare triple {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:16,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-28 11:02:16,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {6696#(or (= (mod main_~a~0 2) 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6674#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-28 11:02:16,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {6696#(or (= (mod main_~a~0 2) 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6696#(or (= (mod main_~a~0 2) 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} is VALID [2022-04-28 11:02:16,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {6696#(or (= (mod main_~a~0 2) 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6696#(or (= (mod main_~a~0 2) 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} is VALID [2022-04-28 11:02:16,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {6696#(or (= (mod main_~a~0 2) 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} is VALID [2022-04-28 11:02:16,890 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6522#true} {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} #70#return; {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} is VALID [2022-04-28 11:02:16,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:16,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-28 11:02:16,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-28 11:02:16,890 INFO L272 TraceCheckUtils]: 23: Hoare triple {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:16,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} assume !false; {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} is VALID [2022-04-28 11:02:16,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {6728#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (not (= (+ (- 2) main_~b~0) 0)) (not (= (+ (- 2) main_~a~0) 0))) (= (mod (+ main_~a~0 1) 2) 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6706#(or (= (mod main_~a~0 2) 0) (= main_~b~0 0) (and (not (= (+ (- 1) main_~b~0) 0)) (not (= (+ (- 1) main_~a~0) 0))))} is VALID [2022-04-28 11:02:16,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {6728#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (not (= (+ (- 2) main_~b~0) 0)) (not (= (+ (- 2) main_~a~0) 0))) (= (mod (+ main_~a~0 1) 2) 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6728#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (not (= (+ (- 2) main_~b~0) 0)) (not (= (+ (- 2) main_~a~0) 0))) (= (mod (+ main_~a~0 1) 2) 0))} is VALID [2022-04-28 11:02:16,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6728#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (not (= (+ (- 2) main_~b~0) 0)) (not (= (+ (- 2) main_~a~0) 0))) (= (mod (+ main_~a~0 1) 2) 0))} is VALID [2022-04-28 11:02:16,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,894 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6522#true} {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} #70#return; {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:16,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-28 11:02:16,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-28 11:02:16,895 INFO L272 TraceCheckUtils]: 13: Hoare triple {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:16,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !false; {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {6760#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6735#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 11:02:16,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6552#(not (= |assume_abort_if_not_#in~cond| 0))} {6522#true} #68#return; {6760#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} is VALID [2022-04-28 11:02:16,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {6552#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6552#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:16,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {6773#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {6552#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:16,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {6522#true} ~cond := #in~cond; {6773#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 11:02:16,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {6522#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6522#true} is VALID [2022-04-28 11:02:16,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {6522#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6522#true} is VALID [2022-04-28 11:02:16,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {6522#true} call #t~ret6 := main(); {6522#true} is VALID [2022-04-28 11:02:16,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6522#true} {6522#true} #76#return; {6522#true} is VALID [2022-04-28 11:02:16,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-28 11:02:16,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {6522#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6522#true} is VALID [2022-04-28 11:02:16,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {6522#true} call ULTIMATE.init(); {6522#true} is VALID [2022-04-28 11:02:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:02:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:02:16,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117153334] [2022-04-28 11:02:16,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:02:16,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793753992] [2022-04-28 11:02:16,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793753992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:02:16,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:02:16,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-04-28 11:02:16,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:02:16,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36105089] [2022-04-28 11:02:16,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36105089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:16,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:16,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:02:16,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634172100] [2022-04-28 11:02:16,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:02:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-28 11:02:16,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:02:16,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:02:16,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:16,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:02:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:02:16,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:02:16,934 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:02:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:17,738 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2022-04-28 11:02:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:02:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-28 11:02:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:02:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:02:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-28 11:02:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:02:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-28 11:02:17,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-28 11:02:17,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:17,804 INFO L225 Difference]: With dead ends: 88 [2022-04-28 11:02:17,804 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 11:02:17,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-04-28 11:02:17,805 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:02:17,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 11:02:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 11:02:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-28 11:02:17,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:02:17,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:17,893 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:17,893 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:17,895 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-04-28 11:02:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-28 11:02:17,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:17,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:17,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-28 11:02:17,895 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-28 11:02:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:17,898 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-04-28 11:02:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-28 11:02:17,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:17,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:17,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:02:17,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:02:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:02:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 11:02:17,900 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 43 [2022-04-28 11:02:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:02:17,900 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-28 11:02:17,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:02:17,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-28 11:02:26,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 65 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 11:02:26,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:02:26,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:02:26,187 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:02:26,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 11:02:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:02:26,391 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:02:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:02:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -253681627, now seen corresponding path program 3 times [2022-04-28 11:02:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600631052] [2022-04-28 11:02:38,490 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:02:38,490 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:02:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash -253681627, now seen corresponding path program 4 times [2022-04-28 11:02:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:02:38,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140563771] [2022-04-28 11:02:38,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:02:38,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:02:38,503 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:02:38,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2615780] [2022-04-28 11:02:38,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:02:38,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:02:38,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:02:38,512 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:02:38,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 11:02:38,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:02:38,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:02:38,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 11:02:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:38,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:02:53,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {7227#true} call ULTIMATE.init(); {7227#true} is VALID [2022-04-28 11:02:53,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {7227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7227#true} is VALID [2022-04-28 11:02:53,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:02:53,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7227#true} {7227#true} #76#return; {7227#true} is VALID [2022-04-28 11:02:53,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {7227#true} call #t~ret6 := main(); {7227#true} is VALID [2022-04-28 11:02:53,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {7227#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7227#true} is VALID [2022-04-28 11:02:53,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {7227#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:02:53,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {7227#true} ~cond := #in~cond; {7253#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:02:53,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {7253#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7257#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:53,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {7257#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7257#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:02:53,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7257#(not (= |assume_abort_if_not_#in~cond| 0))} {7227#true} #68#return; {7264#(<= 1 main_~y~0)} is VALID [2022-04-28 11:02:53,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {7264#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,865 INFO L272 TraceCheckUtils]: 13: Hoare triple {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:02:53,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:02:53,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:02:53,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:02:53,866 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7227#true} {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {7268#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} assume !false; {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,868 INFO L272 TraceCheckUtils]: 21: Hoare triple {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:02:53,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:02:53,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:02:53,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:02:53,869 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7227#true} {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} #70#return; {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {7293#(and (<= (div (- main_~y~0) (- 2)) main_~b~0) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !false; {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,871 INFO L272 TraceCheckUtils]: 29: Hoare triple {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:02:53,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:02:53,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:02:53,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:02:53,872 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7227#true} {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} #70#return; {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,873 INFO L290 TraceCheckUtils]: 35: Hoare triple {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:53,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {7318#(and (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7349#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} is VALID [2022-04-28 11:02:53,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {7349#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} assume !false; {7349#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} is VALID [2022-04-28 11:02:53,875 INFO L272 TraceCheckUtils]: 39: Hoare triple {7349#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:02:53,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {7227#true} ~cond := #in~cond; {7359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:53,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {7359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:53,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:55,879 WARN L284 TraceCheckUtils]: 43: Hoare quadruple {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} {7349#(and (<= 1 main_~y~0) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} #70#return; {7370#(and (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} is UNKNOWN [2022-04-28 11:02:55,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {7370#(and (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))) (< (div (* (- 1) (div (* (- 1) main_~y~0) (- 2))) (- 2)) (+ main_~b~0 2)))} assume !(0 != ~a~0 && 0 != ~b~0); {7374#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-28 11:02:55,881 INFO L272 TraceCheckUtils]: 45: Hoare triple {7374#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:02:55,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {7378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:55,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {7382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7228#false} is VALID [2022-04-28 11:02:55,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {7228#false} assume !false; {7228#false} is VALID [2022-04-28 11:02:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 11:02:55,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:03:28,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {7228#false} assume !false; {7228#false} is VALID [2022-04-28 11:03:28,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {7382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7228#false} is VALID [2022-04-28 11:03:28,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {7378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:03:28,398 INFO L272 TraceCheckUtils]: 45: Hoare triple {7398#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:03:28,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {7402#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {7398#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 11:03:28,405 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} {7227#true} #70#return; {7402#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 11:03:28,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:03:28,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {7415#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:03:28,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {7227#true} ~cond := #in~cond; {7415#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:03:28,406 INFO L272 TraceCheckUtils]: 39: Hoare triple {7227#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:03:28,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-28 11:03:28,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {7227#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {7227#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {7227#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {7227#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7227#true} {7227#true} #70#return; {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L272 TraceCheckUtils]: 29: Hoare triple {7227#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-28 11:03:28,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {7227#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {7227#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7227#true} {7227#true} #70#return; {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L272 TraceCheckUtils]: 21: Hoare triple {7227#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {7227#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {7227#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7227#true} is VALID [2022-04-28 11:03:28,408 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7227#true} {7227#true} #70#return; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L272 TraceCheckUtils]: 13: Hoare triple {7227#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {7227#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7227#true} {7227#true} #68#return; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-28 11:03:28,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {7227#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {7227#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {7227#true} call #t~ret6 := main(); {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7227#true} {7227#true} #76#return; {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {7227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {7227#true} call ULTIMATE.init(); {7227#true} is VALID [2022-04-28 11:03:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-28 11:03:28,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:03:28,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140563771] [2022-04-28 11:03:28,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:03:28,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2615780] [2022-04-28 11:03:28,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2615780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:03:28,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:03:28,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-28 11:03:28,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:03:28,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600631052] [2022-04-28 11:03:28,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600631052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:03:28,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:03:28,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:03:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628289869] [2022-04-28 11:03:28,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:03:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-28 11:03:28,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:03:28,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:03:30,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:03:30,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:03:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:03:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:03:30,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:03:30,457 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:03:34,362 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 11:03:40,066 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 11:03:46,598 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 11:03:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:03:47,160 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-04-28 11:03:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 11:03:47,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-28 11:03:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:03:47,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:03:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2022-04-28 11:03:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:03:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2022-04-28 11:03:47,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 75 transitions. [2022-04-28 11:03:55,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 71 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 11:03:55,276 INFO L225 Difference]: With dead ends: 90 [2022-04-28 11:03:55,276 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 11:03:55,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-04-28 11:03:55,276 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:03:55,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 137 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 243 Invalid, 3 Unknown, 0 Unchecked, 9.8s Time] [2022-04-28 11:03:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 11:03:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2022-04-28 11:03:55,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:03:55,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 64 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:03:55,438 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 64 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:03:55,438 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 64 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:03:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:03:55,440 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2022-04-28 11:03:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2022-04-28 11:03:55,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:03:55,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:03:55,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-28 11:03:55,441 INFO L87 Difference]: Start difference. First operand has 64 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 85 states. [2022-04-28 11:03:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:03:55,443 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2022-04-28 11:03:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2022-04-28 11:03:55,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:03:55,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:03:55,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:03:55,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:03:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 11:03:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-04-28 11:03:55,445 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 49 [2022-04-28 11:03:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:03:55,445 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-04-28 11:03:55,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:03:55,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 83 transitions. [2022-04-28 11:04:07,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 77 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:07,834 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-28 11:04:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 11:04:07,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:04:07,834 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:04:07,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 11:04:08,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:08,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:04:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:04:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1751157664, now seen corresponding path program 1 times [2022-04-28 11:04:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851485626] [2022-04-28 11:04:26,178 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:04:26,179 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:04:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1751157664, now seen corresponding path program 2 times [2022-04-28 11:04:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:04:26,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145568648] [2022-04-28 11:04:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:04:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:04:26,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:04:26,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443933074] [2022-04-28 11:04:26,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:04:26,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:26,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:04:26,191 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:04:26,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 11:04:26,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:04:26,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:04:26,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:04:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:04:26,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:04:38,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-28 11:04:38,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8030#true} is VALID [2022-04-28 11:04:38,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:04:38,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #76#return; {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret6 := main(); {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {8030#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {8030#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:04:38,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8030#true} {8030#true} #68#return; {8030#true} is VALID [2022-04-28 11:04:38,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {8030#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8068#(= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:04:38,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {8068#(= main_~b~0 main_~y~0)} assume !false; {8068#(= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:04:38,496 INFO L272 TraceCheckUtils]: 13: Hoare triple {8068#(= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:04:38,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:04:38,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:04:38,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:04:38,497 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8030#true} {8068#(= main_~b~0 main_~y~0)} #70#return; {8068#(= main_~b~0 main_~y~0)} is VALID [2022-04-28 11:04:38,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {8068#(= main_~b~0 main_~y~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {8090#(and (= main_~b~0 main_~y~0) (not (= main_~b~0 0)))} is VALID [2022-04-28 11:04:38,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {8090#(and (= main_~b~0 main_~y~0) (not (= main_~b~0 0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8090#(and (= main_~b~0 main_~y~0) (not (= main_~b~0 0)))} is VALID [2022-04-28 11:04:38,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {8090#(and (= main_~b~0 main_~y~0) (not (= main_~b~0 0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8090#(and (= main_~b~0 main_~y~0) (not (= main_~b~0 0)))} is VALID [2022-04-28 11:04:38,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {8090#(and (= main_~b~0 main_~y~0) (not (= main_~b~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} assume !false; {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,501 INFO L272 TraceCheckUtils]: 23: Hoare triple {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:04:38,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:04:38,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:04:38,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:04:38,502 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8030#true} {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} #70#return; {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {8100#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (<= main_~y~0 (+ main_~b~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {8122#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (not (= main_~b~0 0)) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {8122#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (not (= main_~b~0 0)) (<= main_~y~0 (+ main_~b~0 1)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} assume !false; {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,505 INFO L272 TraceCheckUtils]: 31: Hoare triple {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:04:38,505 INFO L290 TraceCheckUtils]: 32: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:04:38,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:04:38,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:04:38,506 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8030#true} {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} #70#return; {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} is VALID [2022-04-28 11:04:38,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {8126#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 1)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8157#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)))} is VALID [2022-04-28 11:04:38,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {8157#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)))} assume !false; {8157#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)))} is VALID [2022-04-28 11:04:38,510 INFO L272 TraceCheckUtils]: 41: Hoare triple {8157#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:04:38,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {8030#true} ~cond := #in~cond; {8167#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:04:38,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {8167#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:04:38,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:04:40,514 WARN L284 TraceCheckUtils]: 45: Hoare quadruple {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} {8157#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)))} #70#return; {8178#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-28 11:04:40,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {8178#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (< 0 (+ main_~b~0 1)) (< (div (+ 2 (* (- 1) main_~y~0)) (- 2)) (+ main_~b~0 2)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {8182#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))} is VALID [2022-04-28 11:04:40,516 INFO L272 TraceCheckUtils]: 47: Hoare triple {8182#(and (<= 0 main_~y~0) (<= 1 (mod main_~y~0 2)) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:04:40,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:04:40,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {8190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8031#false} is VALID [2022-04-28 11:04:40,516 INFO L290 TraceCheckUtils]: 50: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-28 11:04:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 11:04:40,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:05:07,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-28 11:05:07,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {8190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8031#false} is VALID [2022-04-28 11:05:07,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:07,131 INFO L272 TraceCheckUtils]: 47: Hoare triple {8206#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:07,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {8210#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {8206#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 11:05:07,133 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} {8030#true} #70#return; {8210#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 11:05:07,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:07,134 INFO L290 TraceCheckUtils]: 43: Hoare triple {8223#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8171#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {8030#true} ~cond := #in~cond; {8223#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:05:07,135 INFO L272 TraceCheckUtils]: 41: Hoare triple {8030#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {8030#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {8030#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {8030#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {8030#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8030#true} {8030#true} #70#return; {8030#true} is VALID [2022-04-28 11:05:07,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L272 TraceCheckUtils]: 31: Hoare triple {8030#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {8030#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {8030#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8030#true} {8030#true} #70#return; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:05:07,136 INFO L272 TraceCheckUtils]: 23: Hoare triple {8030#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {8030#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {8030#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {8030#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {8030#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8030#true} {8030#true} #70#return; {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:05:07,137 INFO L272 TraceCheckUtils]: 13: Hoare triple {8030#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {8030#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8030#true} {8030#true} #68#return; {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {8030#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {8030#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret6 := main(); {8030#true} is VALID [2022-04-28 11:05:07,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #76#return; {8030#true} is VALID [2022-04-28 11:05:07,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-28 11:05:07,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8030#true} is VALID [2022-04-28 11:05:07,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-28 11:05:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 11:05:07,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:05:07,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145568648] [2022-04-28 11:05:07,139 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:05:07,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443933074] [2022-04-28 11:05:07,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443933074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:05:07,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:05:07,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 17 [2022-04-28 11:05:07,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:05:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851485626] [2022-04-28 11:05:07,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851485626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:05:07,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:05:07,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:05:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155381875] [2022-04-28 11:05:07,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:05:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-28 11:05:07,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:05:07,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:05:09,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:09,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:05:09,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:05:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:05:09,188 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:05:14,452 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 11:05:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:19,432 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2022-04-28 11:05:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 11:05:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-28 11:05:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:05:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:05:19,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 11:05:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:05:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-28 11:05:19,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-28 11:05:25,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 71 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:25,525 INFO L225 Difference]: With dead ends: 99 [2022-04-28 11:05:25,525 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 11:05:25,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:05:25,526 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:05:25,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 11:05:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 11:05:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-04-28 11:05:25,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:05:25,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 71 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:05:25,727 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 71 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:05:25,727 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 71 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:05:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:25,729 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2022-04-28 11:05:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-04-28 11:05:25,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:25,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:25,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-28 11:05:25,730 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 94 states. [2022-04-28 11:05:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:25,732 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2022-04-28 11:05:25,732 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-04-28 11:05:25,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:25,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:25,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:05:25,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:05:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 11:05:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-04-28 11:05:25,734 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 51 [2022-04-28 11:05:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:05:25,734 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-04-28 11:05:25,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 11:05:25,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 93 transitions. [2022-04-28 11:05:40,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 86 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-28 11:05:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 11:05:40,221 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:05:40,221 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:05:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 11:05:40,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 11:05:40,423 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:05:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:05:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1773789918, now seen corresponding path program 5 times [2022-04-28 11:05:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:40,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37548397] [2022-04-28 11:05:52,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:05:52,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:05:52,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1773789918, now seen corresponding path program 6 times [2022-04-28 11:05:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:05:52,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95461247] [2022-04-28 11:05:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:05:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:05:52,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:05:52,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331439067] [2022-04-28 11:05:52,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:05:52,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:05:52,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:05:52,120 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:05:52,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 11:05:52,164 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:05:52,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:05:52,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:05:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:05:52,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:06:02,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {8892#true} call ULTIMATE.init(); {8892#true} is VALID [2022-04-28 11:06:02,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {8892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8892#true} is VALID [2022-04-28 11:06:02,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8892#true} {8892#true} #76#return; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {8892#true} call #t~ret6 := main(); {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {8892#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {8892#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8892#true} {8892#true} #68#return; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {8892#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8892#true} is VALID [2022-04-28 11:06:02,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L272 TraceCheckUtils]: 13: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {8892#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8892#true} is VALID [2022-04-28 11:06:02,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L272 TraceCheckUtils]: 23: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {8892#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L272 TraceCheckUtils]: 31: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:02,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {8892#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:02,406 INFO L272 TraceCheckUtils]: 41: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:02,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {8892#true} ~cond := #in~cond; {9023#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:06:02,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {9023#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:06:02,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:06:04,411 WARN L284 TraceCheckUtils]: 45: Hoare quadruple {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} {8892#true} #70#return; {9034#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-28 11:06:04,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {9034#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {9038#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 11:06:04,413 INFO L272 TraceCheckUtils]: 47: Hoare triple {9038#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:06:04,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {9042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:06:04,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {9046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8893#false} is VALID [2022-04-28 11:06:04,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {8893#false} assume !false; {8893#false} is VALID [2022-04-28 11:06:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 11:06:04,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:06:28,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {8893#false} assume !false; {8893#false} is VALID [2022-04-28 11:06:28,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {9046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8893#false} is VALID [2022-04-28 11:06:28,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {9042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:06:28,125 INFO L272 TraceCheckUtils]: 47: Hoare triple {9038#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9042#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:06:28,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {9065#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {9038#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 11:06:28,128 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} {8892#true} #70#return; {9065#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 11:06:28,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:06:28,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {9078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9027#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {8892#true} ~cond := #in~cond; {9078#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:06:28,129 INFO L272 TraceCheckUtils]: 41: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {8892#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-28 11:06:28,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L272 TraceCheckUtils]: 31: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {8892#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L272 TraceCheckUtils]: 23: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:28,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {8892#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {8892#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L272 TraceCheckUtils]: 13: Hoare triple {8892#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {8892#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8892#true} {8892#true} #68#return; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-28 11:06:28,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {8892#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {8892#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {8892#true} call #t~ret6 := main(); {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8892#true} {8892#true} #76#return; {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {8892#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {8892#true} call ULTIMATE.init(); {8892#true} is VALID [2022-04-28 11:06:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-28 11:06:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:06:28,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95461247] [2022-04-28 11:06:28,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:06:28,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331439067] [2022-04-28 11:06:28,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331439067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:06:28,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:06:28,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:06:28,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:06:28,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37548397] [2022-04-28 11:06:28,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37548397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:06:28,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:06:28,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:06:28,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62114332] [2022-04-28 11:06:28,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:06:28,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-04-28 11:06:28,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:06:28,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:06:30,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:30,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:06:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:06:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:06:30,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:06:30,161 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:06:32,883 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 11:06:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:36,048 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-28 11:06:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:06:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-04-28 11:06:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:06:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:06:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 11:06:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:06:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-28 11:06:36,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-28 11:06:38,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:38,086 INFO L225 Difference]: With dead ends: 71 [2022-04-28 11:06:38,086 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:06:38,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:06:38,087 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:06:38,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 11:06:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:06:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:06:38,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:06:38,088 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 11:06:38,088 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 11:06:38,088 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 11:06:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:38,088 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:06:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:06:38,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:06:38,089 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 11:06:38,089 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 11:06:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:38,089 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:06:38,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:06:38,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:38,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:06:38,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:06:38,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:06:38,089 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 11:06:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:06:38,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-04-28 11:06:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:06:38,090 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:06:38,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 11:06:38,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:06:38,090 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 11:06:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:06:38,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:38,092 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:06:38,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 11:06:38,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:06:38,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:07:56,396 WARN L232 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 124 DAG size of output: 34 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:08:20,353 WARN L232 SmtUtils]: Spent 23.95s on a formula simplification. DAG size of input: 117 DAG size of output: 24 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:09:25,343 WARN L232 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 114 DAG size of output: 24 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)