/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-34549b5 [2022-04-08 10:52:05,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:52:05,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:52:05,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:52:05,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:52:05,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:52:05,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:52:05,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:52:05,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:52:05,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:52:05,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:52:05,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:52:05,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:52:05,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:52:05,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:52:05,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:52:05,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:52:05,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:52:05,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:52:05,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:52:05,880 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:52:05,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:52:05,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:52:05,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:52:05,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:52:05,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:52:05,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:52:05,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:52:05,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:52:05,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:52:05,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:52:05,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:52:05,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:52:05,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:52:05,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:52:05,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:52:05,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:52:05,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:52:05,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:52:05,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:52:05,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:52:05,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:52:05,892 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:52:05,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:52:05,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:52:05,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:52:05,899 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:52:05,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:52:05,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:52:05,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:52:05,901 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:52:05,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:52:05,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:52:05,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:52:05,902 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:52:05,902 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:52:05,902 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:52:05,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:52:05,902 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:52:05,902 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-08 10:52:06,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:52:06,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:52:06,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:52:06,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:52:06,084 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:52:06,085 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-08 10:52:06,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50156f05/d00822e2f15a4e9ca1bdfe0939959159/FLAGf05e564a2 [2022-04-08 10:52:06,478 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:52:06,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-08 10:52:06,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50156f05/d00822e2f15a4e9ca1bdfe0939959159/FLAGf05e564a2 [2022-04-08 10:52:06,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d50156f05/d00822e2f15a4e9ca1bdfe0939959159 [2022-04-08 10:52:06,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:52:06,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:52:06,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:52:06,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:52:06,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:52:06,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15eed8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06, skipping insertion in model container [2022-04-08 10:52:06,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:52:06,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:52:06,667 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-08 10:52:06,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:52:06,693 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:52:06,703 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-08 10:52:06,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:52:06,720 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:52:06,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06 WrapperNode [2022-04-08 10:52:06,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:52:06,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:52:06,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:52:06,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:52:06,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:52:06,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:52:06,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:52:06,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:52:06,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (1/1) ... [2022-04-08 10:52:06,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:52:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:52:06,774 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-08 10:52:06,776 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-08 10:52:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:52:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:52:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:52:06,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:52:06,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:52:06,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:52:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:52:06,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:52:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:52:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:52:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:52:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:52:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:52:06,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:52:06,860 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:52:06,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:52:07,019 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:52:07,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:52:07,023 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:52:07,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:52:07 BoogieIcfgContainer [2022-04-08 10:52:07,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:52:07,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:52:07,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:52:07,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:52:07,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:52:06" (1/3) ... [2022-04-08 10:52:07,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589c92fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:52:07, skipping insertion in model container [2022-04-08 10:52:07,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:52:06" (2/3) ... [2022-04-08 10:52:07,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589c92fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:52:07, skipping insertion in model container [2022-04-08 10:52:07,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:52:07" (3/3) ... [2022-04-08 10:52:07,042 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-08 10:52:07,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:52:07,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:52:07,074 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:52:07,079 INFO L340 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 [2022-04-08 10:52:07,079 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:52:07,091 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-08 10:52:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:52:07,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:52:07,101 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:52:07,102 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:52:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:52:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-08 10:52:07,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:07,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461734101] [2022-04-08 10:52:07,118 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:52:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 2 times [2022-04-08 10:52:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:52:07,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528085665] [2022-04-08 10:52:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:52:07,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:52:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:52:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:07,253 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-08 10:52:07,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 10:52:07,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-08 10:52:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:52:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:07,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 10:52:07,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 10:52:07,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 10:52:07,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-08 10:52:07,267 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-08 10:52:07,267 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-08 10:52:07,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 10:52:07,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-08 10:52:07,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-08 10:52:07,268 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-08 10:52:07,268 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-08 10:52:07,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 10:52:07,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 10:52:07,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 10:52:07,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-08 10:52:07,271 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-08 10:52:07,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-08 10:52:07,271 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-08 10:52:07,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 10:52:07,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 10:52:07,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 10:52:07,272 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-08 10:52:07,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:52:07,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528085665] [2022-04-08 10:52:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528085665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:07,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:52:07,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:52:07,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461734101] [2022-04-08 10:52:07,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461734101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:07,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:07,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:52:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639604270] [2022-04-08 10:52:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:52:07,280 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-08 10:52:07,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:52:07,283 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-08 10:52:07,301 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-08 10:52:07,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:52:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:52:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:52:07,337 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-08 10:52:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:07,464 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-08 10:52:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:52:07,464 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-08 10:52:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:52:07,465 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-08 10:52:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-08 10:52:07,471 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-08 10:52:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-08 10:52:07,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-08 10:52:07,553 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-08 10:52:07,562 INFO L225 Difference]: With dead ends: 53 [2022-04-08 10:52:07,562 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:52:07,564 INFO L912 BasicCegarLoop]: 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-08 10:52:07,566 INFO L913 BasicCegarLoop]: 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-08 10:52:07,566 INFO L914 BasicCegarLoop]: 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-08 10:52:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:52:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 10:52:07,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:52:07,588 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-08 10:52:07,588 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-08 10:52:07,588 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-08 10:52:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:07,591 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 10:52:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 10:52:07,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:07,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:07,592 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-08 10:52:07,592 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-08 10:52:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:07,595 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-08 10:52:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 10:52:07,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:07,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:07,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:52:07,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:52:07,596 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-08 10:52:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-08 10:52:07,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-08 10:52:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:52:07,598 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-08 10:52:07,599 INFO L479 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-08 10:52:07,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-08 10:52:07,629 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-08 10:52:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-08 10:52:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:52:07,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:52:07,630 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:52:07,631 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:52:07,631 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:52:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:52:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-08 10:52:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:07,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [290347885] [2022-04-08 10:52:07,634 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:52:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 2 times [2022-04-08 10:52:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:52:07,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337592197] [2022-04-08 10:52:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:52:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:52:07,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:52:07,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386962705] [2022-04-08 10:52:07,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:52:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:52:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:52:07,666 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-08 10:52:07,691 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-08 10:52:07,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:52:07,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:52:07,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:52:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:07,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:52:07,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-08 10:52:07,912 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-08 10:52:07,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 10:52:07,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #76#return; {256#true} is VALID [2022-04-08 10:52:07,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret6 := main(); {256#true} is VALID [2022-04-08 10:52:07,912 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-08 10:52:07,913 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-08 10:52:07,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-08 10:52:07,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-08 10:52:07,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-08 10:52:07,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #68#return; {256#true} is VALID [2022-04-08 10:52:07,916 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-08 10:52:07,916 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-08 10:52:07,917 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-08 10:52:07,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:07,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-08 10:52:07,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-08 10:52:07,919 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-08 10:52:07,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:52:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:52:07,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337592197] [2022-04-08 10:52:07,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:52:07,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386962705] [2022-04-08 10:52:07,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386962705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:07,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:07,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:52:07,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:52:07,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [290347885] [2022-04-08 10:52:07,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [290347885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:07,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:07,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:52:07,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655402525] [2022-04-08 10:52:07,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:52:07,923 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-08 10:52:07,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:52:07,924 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-08 10:52:07,935 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-08 10:52:07,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:52:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:07,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:52:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:52:07,936 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-08 10:52:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:08,074 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 10:52:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:52:08,074 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-08 10:52:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:52:08,074 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-08 10:52:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 10:52:08,095 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-08 10:52:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-08 10:52:08,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-08 10:52:08,146 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-08 10:52:08,149 INFO L225 Difference]: With dead ends: 40 [2022-04-08 10:52:08,149 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 10:52:08,151 INFO L912 BasicCegarLoop]: 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-08 10:52:08,153 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:52:08,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:52:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 10:52:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-08 10:52:08,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:52:08,169 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-08 10:52:08,170 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-08 10:52:08,170 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-08 10:52:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:08,176 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 10:52:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 10:52:08,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:08,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:08,180 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-08 10:52:08,180 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-08 10:52:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:08,189 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 10:52:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 10:52:08,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:08,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:08,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:52:08,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:52:08,190 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-08 10:52:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-08 10:52:08,192 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-08 10:52:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:52:08,192 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-08 10:52:08,192 INFO L479 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-08 10:52:08,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-08 10:52:08,247 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-08 10:52:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-08 10:52:08,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:52:08,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:52:08,248 INFO L499 BasicCegarLoop]: 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-08 10:52:08,267 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-08 10:52:08,464 WARN L460 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-08 10:52:08,464 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:52:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:52:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-08 10:52:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884917100] [2022-04-08 10:52:08,466 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:52:08,466 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 2 times [2022-04-08 10:52:08,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:52:08,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993119335] [2022-04-08 10:52:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:52:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:52:08,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:52:08,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273185744] [2022-04-08 10:52:08,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:52:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:52:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:52:08,479 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-08 10:52:08,482 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-08 10:52:08,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:52:08,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:52:08,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:52:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:08,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:52:17,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-08 10:52:17,170 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-08 10:52:17,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-08 10:52:17,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-08 10:52:17,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-08 10:52:17,171 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-08 10:52:17,171 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-08 10:52:17,171 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-08 10:52:17,172 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-08 10:52:17,172 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-08 10:52:17,173 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-08 10:52:17,174 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-08 10:52:17,174 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-08 10:52:17,175 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-08 10:52:17,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:17,175 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-08 10:52:17,176 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-08 10:52:19,180 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-08 10:52:19,181 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-08 10:52:19,182 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-08 10:52:19,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:19,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-08 10:52:19,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-08 10:52:19,184 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-08 10:52:19,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:52:33,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-08 10:52:33,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-08 10:52:33,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:33,823 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-08 10:52:33,824 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-08 10:52:33,825 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-08 10:52:33,825 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-08 10:52:33,826 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-08 10:52:33,826 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-08 10:52:33,826 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-08 10:52:33,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#true} assume !false; {533#true} is VALID [2022-04-08 10:52:33,827 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-08 10:52:33,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {533#true} {533#true} #68#return; {533#true} is VALID [2022-04-08 10:52:33,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-08 10:52:33,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-04-08 10:52:33,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-04-08 10:52:33,827 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-08 10:52:33,827 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-08 10:52:33,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-08 10:52:33,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-08 10:52:33,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-08 10:52:33,828 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-08 10:52:33,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-08 10:52:33,828 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-08 10:52:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:52:33,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993119335] [2022-04-08 10:52:33,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:52:33,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273185744] [2022-04-08 10:52:33,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273185744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:52:33,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:52:33,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-08 10:52:33,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:52:33,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884917100] [2022-04-08 10:52:33,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884917100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:33,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:33,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:52:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542495147] [2022-04-08 10:52:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:52:33,830 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-08 10:52:33,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:52:33,830 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-08 10:52:35,848 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-08 10:52:35,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:52:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:52:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:52:35,849 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-08 10:52:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:40,303 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-08 10:52:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:52:40,303 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-08 10:52:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:52:40,303 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-08 10:52:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-08 10:52:40,305 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-08 10:52:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-08 10:52:40,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-08 10:52:42,357 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-08 10:52:42,359 INFO L225 Difference]: With dead ends: 46 [2022-04-08 10:52:42,359 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 10:52:42,361 INFO L912 BasicCegarLoop]: 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-08 10:52:42,362 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:52:42,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 88 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 10:52:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 10:52:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-08 10:52:42,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:52:42,391 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-08 10:52:42,391 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-08 10:52:42,391 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-08 10:52:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:42,393 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-08 10:52:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-08 10:52:42,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:42,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:42,394 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-08 10:52:42,394 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-08 10:52:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:42,396 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-08 10:52:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-08 10:52:42,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:42,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:42,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:52:42,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:52:42,397 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-08 10:52:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-04-08 10:52:42,398 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2022-04-08 10:52:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:52:42,398 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-04-08 10:52:42,398 INFO L479 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-08 10:52:42,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 51 transitions. [2022-04-08 10:52:44,467 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-08 10:52:44,468 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-08 10:52:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:52:44,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:52:44,468 INFO L499 BasicCegarLoop]: 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-08 10:52:44,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:52:44,669 WARN L460 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-08 10:52:44,669 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:52:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:52:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-08 10:52:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [231470608] [2022-04-08 10:52:50,272 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:52:50,272 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:52:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 2 times [2022-04-08 10:52:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:52:50,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378235312] [2022-04-08 10:52:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:52:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:52:50,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:52:50,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630291770] [2022-04-08 10:52:50,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:52:50,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:52:50,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:52:50,284 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-08 10:52:50,285 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-08 10:52:50,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:52:50,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:52:50,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:52:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:52:50,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:52:50,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-08 10:52:50,646 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-08 10:52:50,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-08 10:52:50,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-08 10:52:50,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-08 10:52:50,647 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-08 10:52:50,647 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-08 10:52:50,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-08 10:52:50,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-08 10:52:50,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-08 10:52:50,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-08 10:52:50,648 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-08 10:52:50,648 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-08 10:52:50,648 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-08 10:52:50,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-08 10:52:50,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-08 10:52:50,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-08 10:52:50,649 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-08 10:52:50,650 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-08 10:52:50,651 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-08 10:52:50,651 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-08 10:52:50,655 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-08 10:52:50,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:50,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-08 10:52:50,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-08 10:52:50,656 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-08 10:52:50,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:53:05,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {958#false} assume !false; {958#false} is VALID [2022-04-08 10:53:05,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {958#false} is VALID [2022-04-08 10:53:05,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:05,745 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-08 10:53:05,746 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-08 10:53:05,759 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-08 10:53:05,763 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-08 10:53:05,763 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-08 10:53:05,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-08 10:53:05,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-08 10:53:05,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-08 10:53:05,764 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-08 10:53:05,765 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-08 10:53:05,767 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-08 10:53:05,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {957#true} {957#true} #68#return; {957#true} is VALID [2022-04-08 10:53:05,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-08 10:53:05,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} assume !(0 == ~cond); {957#true} is VALID [2022-04-08 10:53:05,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} ~cond := #in~cond; {957#true} is VALID [2022-04-08 10:53:05,768 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-08 10:53:05,768 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-08 10:53:05,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {957#true} call #t~ret6 := main(); {957#true} is VALID [2022-04-08 10:53:05,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {957#true} {957#true} #76#return; {957#true} is VALID [2022-04-08 10:53:05,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} assume true; {957#true} is VALID [2022-04-08 10:53:05,768 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-08 10:53:05,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {957#true} call ULTIMATE.init(); {957#true} is VALID [2022-04-08 10:53:05,769 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-08 10:53:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:53:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378235312] [2022-04-08 10:53:05,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:53:05,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630291770] [2022-04-08 10:53:05,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630291770] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:53:05,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:53:05,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-08 10:53:05,770 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:53:05,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [231470608] [2022-04-08 10:53:05,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [231470608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:05,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:05,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:53:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184418221] [2022-04-08 10:53:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:53:05,770 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-08 10:53:05,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:53:05,771 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-08 10:53:05,795 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-08 10:53:05,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:53:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:53:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:53:05,797 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-08 10:53:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:06,067 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-08 10:53:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:53:06,067 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-08 10:53:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:53:06,067 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-08 10:53:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:53:06,068 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-08 10:53:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:53:06,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 10:53:06,129 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-08 10:53:06,130 INFO L225 Difference]: With dead ends: 48 [2022-04-08 10:53:06,131 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 10:53:06,131 INFO L912 BasicCegarLoop]: 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-08 10:53:06,131 INFO L913 BasicCegarLoop]: 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-08 10:53:06,132 INFO L914 BasicCegarLoop]: 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-08 10:53:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 10:53:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 10:53:06,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:53:06,170 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-08 10:53:06,170 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-08 10:53:06,170 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-08 10:53:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:06,172 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-08 10:53:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 10:53:06,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:53:06,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:53:06,173 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-08 10:53:06,173 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-08 10:53:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:06,174 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-08 10:53:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 10:53:06,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:53:06,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:53:06,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:53:06,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:53:06,175 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-08 10:53:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-04-08 10:53:06,176 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 25 [2022-04-08 10:53:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:53:06,176 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-04-08 10:53:06,176 INFO L479 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-08 10:53:06,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 54 transitions. [2022-04-08 10:53:08,345 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-08 10:53:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-04-08 10:53:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:53:08,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:53:08,346 INFO L499 BasicCegarLoop]: 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-08 10:53:08,366 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-08 10:53:08,564 WARN L460 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-08 10:53:08,564 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:53:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:53:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 1 times [2022-04-08 10:53:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:08,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1353517759] [2022-04-08 10:53:08,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:53:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 2 times [2022-04-08 10:53:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:53:08,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435890456] [2022-04-08 10:53:08,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:53:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:53:08,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:53:08,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902215632] [2022-04-08 10:53:08,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:53:08,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:53:08,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:53:08,609 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-08 10:53:08,651 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-08 10:53:08,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:53:08,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:53:08,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:53:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:53:08,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:53:08,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {1396#true} call ULTIMATE.init(); {1396#true} is VALID [2022-04-08 10:53:08,833 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-08 10:53:08,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-08 10:53:08,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1396#true} {1396#true} #76#return; {1396#true} is VALID [2022-04-08 10:53:08,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {1396#true} call #t~ret6 := main(); {1396#true} is VALID [2022-04-08 10:53:08,834 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-08 10:53:08,834 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-08 10:53:08,834 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-08 10:53:08,834 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-08 10:53:08,835 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-08 10:53:08,835 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-08 10:53:08,836 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-08 10:53:08,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {1437#(<= 1 main_~b~0)} assume !false; {1437#(<= 1 main_~b~0)} is VALID [2022-04-08 10:53:08,836 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-08 10:53:08,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-08 10:53:08,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-08 10:53:08,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-08 10:53:08,837 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1396#true} {1437#(<= 1 main_~b~0)} #70#return; {1437#(<= 1 main_~b~0)} is VALID [2022-04-08 10:53:08,837 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-08 10:53:08,837 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-08 10:53:08,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {1396#true} ~cond := #in~cond; {1396#true} is VALID [2022-04-08 10:53:08,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {1396#true} assume !(0 == ~cond); {1396#true} is VALID [2022-04-08 10:53:08,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {1396#true} assume true; {1396#true} is VALID [2022-04-08 10:53:08,838 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-08 10:53:08,839 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-08 10:53:08,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {1478#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1482#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:08,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {1482#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1397#false} is VALID [2022-04-08 10:53:08,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#false} assume !false; {1397#false} is VALID [2022-04-08 10:53:08,840 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-08 10:53:08,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:53:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:53:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435890456] [2022-04-08 10:53:08,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:53:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902215632] [2022-04-08 10:53:08,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902215632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:08,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:53:08,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:53:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1353517759] [2022-04-08 10:53:08,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1353517759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:08,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:08,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:53:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120399910] [2022-04-08 10:53:08,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:53:08,841 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-08 10:53:08,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:53:08,842 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-08 10:53:08,862 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-08 10:53:08,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:53:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:53:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:53:08,863 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-08 10:53:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:09,232 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-08 10:53:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:53:09,232 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-08 10:53:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:53:09,233 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-08 10:53:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 10:53:09,234 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-08 10:53:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-08 10:53:09,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-08 10:53:09,281 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-08 10:53:09,282 INFO L225 Difference]: With dead ends: 60 [2022-04-08 10:53:09,282 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 10:53:09,282 INFO L912 BasicCegarLoop]: 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-08 10:53:09,283 INFO L913 BasicCegarLoop]: 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-08 10:53:09,283 INFO L914 BasicCegarLoop]: 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-08 10:53:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 10:53:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2022-04-08 10:53:09,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:53:09,312 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-08 10:53:09,312 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-08 10:53:09,312 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-08 10:53:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:09,314 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-08 10:53:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-08 10:53:09,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:53:09,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:53:09,314 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-08 10:53:09,314 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-08 10:53:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:09,316 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-08 10:53:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-08 10:53:09,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:53:09,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:53:09,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:53:09,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:53:09,316 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-08 10:53:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-08 10:53:09,318 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 28 [2022-04-08 10:53:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:53:09,318 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-08 10:53:09,318 INFO L479 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-08 10:53:09,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-08 10:53:11,500 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-08 10:53:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-08 10:53:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:53:11,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:53:11,501 INFO L499 BasicCegarLoop]: 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-08 10:53:11,517 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-08 10:53:11,701 WARN L460 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-08 10:53:11,702 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:53:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:53:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 1 times [2022-04-08 10:53:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:11,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1103609206] [2022-04-08 10:53:17,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:53:17,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:53:17,750 INFO L85 PathProgramCache]: Analyzing trace with hash -171609494, now seen corresponding path program 2 times [2022-04-08 10:53:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:53:17,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034179823] [2022-04-08 10:53:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:53:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:53:17,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:53:17,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188783038] [2022-04-08 10:53:17,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:53:17,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:53:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:53:17,784 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-08 10:53:17,785 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-08 10:53:17,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:53:17,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:53:17,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:53:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:53:17,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:53:18,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {1806#true} call ULTIMATE.init(); {1806#true} is VALID [2022-04-08 10:53:18,322 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-08 10:53:18,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-08 10:53:18,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1806#true} {1806#true} #76#return; {1806#true} is VALID [2022-04-08 10:53:18,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {1806#true} call #t~ret6 := main(); {1806#true} is VALID [2022-04-08 10:53:18,323 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-08 10:53:18,323 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-08 10:53:18,324 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-08 10:53:18,324 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-08 10:53:18,325 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-08 10:53:18,325 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-08 10:53:18,326 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-08 10:53:18,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(<= 1 main_~b~0)} assume !false; {1847#(<= 1 main_~b~0)} is VALID [2022-04-08 10:53:18,326 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-08 10:53:18,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-08 10:53:18,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-08 10:53:18,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-08 10:53:18,327 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1806#true} {1847#(<= 1 main_~b~0)} #70#return; {1847#(<= 1 main_~b~0)} is VALID [2022-04-08 10:53:18,328 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-08 10:53:18,329 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-08 10:53:18,330 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-08 10:53:18,330 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-08 10:53:18,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {1806#true} ~cond := #in~cond; {1806#true} is VALID [2022-04-08 10:53:18,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {1806#true} assume !(0 == ~cond); {1806#true} is VALID [2022-04-08 10:53:18,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {1806#true} assume true; {1806#true} is VALID [2022-04-08 10:53:18,331 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-08 10:53:18,331 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-08 10:53:18,332 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-08 10:53:18,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {1807#false} ~cond := #in~cond; {1807#false} is VALID [2022-04-08 10:53:18,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {1807#false} assume 0 == ~cond; {1807#false} is VALID [2022-04-08 10:53:18,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {1807#false} assume !false; {1807#false} is VALID [2022-04-08 10:53:18,332 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-08 10:53:18,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:53:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:53:18,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034179823] [2022-04-08 10:53:18,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:53:18,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188783038] [2022-04-08 10:53:18,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188783038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:18,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:18,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:53:18,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:53:18,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1103609206] [2022-04-08 10:53:18,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1103609206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:18,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:18,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:53:18,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791710042] [2022-04-08 10:53:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:53:18,334 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-08 10:53:18,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:53:18,334 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-08 10:53:18,359 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-08 10:53:18,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:53:18,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:53:18,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:53:18,361 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-08 10:53:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:18,679 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-08 10:53:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:53:18,679 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-08 10:53:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:53:18,680 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-08 10:53:18,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 10:53:18,681 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-08 10:53:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 10:53:18,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-08 10:53:18,726 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-08 10:53:18,727 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:53:18,727 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 10:53:18,728 INFO L912 BasicCegarLoop]: 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-08 10:53:18,728 INFO L913 BasicCegarLoop]: 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-08 10:53:18,729 INFO L914 BasicCegarLoop]: 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-08 10:53:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 10:53:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 10:53:18,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:53:18,763 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-08 10:53:18,763 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-08 10:53:18,763 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-08 10:53:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:18,765 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-08 10:53:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-08 10:53:18,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:53:18,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:53:18,765 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-08 10:53:18,766 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-08 10:53:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:18,767 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2022-04-08 10:53:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-04-08 10:53:18,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:53:18,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:53:18,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:53:18,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:53:18,768 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-08 10:53:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-08 10:53:18,769 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 31 [2022-04-08 10:53:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:53:18,769 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-08 10:53:18,769 INFO L479 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-08 10:53:18,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-08 10:53:20,977 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-08 10:53:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-08 10:53:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:53:20,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:53:20,978 INFO L499 BasicCegarLoop]: 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-08 10:53:21,001 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-08 10:53:21,179 WARN L460 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-08 10:53:21,180 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:53:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:53:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash 212948645, now seen corresponding path program 1 times [2022-04-08 10:53:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:21,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977337064] [2022-04-08 10:53:27,236 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:53:27,236 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:53:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash 212948645, now seen corresponding path program 2 times [2022-04-08 10:53:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:53:27,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866956925] [2022-04-08 10:53:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:53:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:53:27,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:53:27,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [347051511] [2022-04-08 10:53:27,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:53:27,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:53:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:53:27,246 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-08 10:53:27,252 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-08 10:53:27,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:53:27,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:53:27,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:53:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:53:27,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:53:37,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-08 10:53:37,154 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-08 10:53:37,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 10:53:37,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-08 10:53:37,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-08 10:53:37,158 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-08 10:53:37,158 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-08 10:53:37,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-08 10:53:37,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-08 10:53:37,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 10:53:37,158 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} #68#return; {2229#true} is VALID [2022-04-08 10:53:37,158 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-08 10:53:37,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#true} assume !false; {2229#true} is VALID [2022-04-08 10:53:37,159 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-08 10:53:37,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-08 10:53:37,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-08 10:53:37,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 10:53:37,159 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2229#true} {2229#true} #70#return; {2229#true} is VALID [2022-04-08 10:53:37,159 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-08 10:53:37,160 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-08 10:53:37,167 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-08 10:53:37,172 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-08 10:53:37,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {2288#(not (= main_~a~0 0))} assume !false; {2288#(not (= main_~a~0 0))} is VALID [2022-04-08 10:53:37,172 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-08 10:53:37,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#true} ~cond := #in~cond; {2307#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:37,173 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-08 10:53:37,173 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-08 10:53:39,175 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-08 10:53:39,176 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-08 10:53:39,177 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-08 10:53:39,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {2326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:39,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {2330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-08 10:53:39,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-08 10:53:39,177 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-08 10:53:39,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:53:52,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {2230#false} assume !false; {2230#false} is VALID [2022-04-08 10:53:52,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {2330#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2230#false} is VALID [2022-04-08 10:53:52,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {2326#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2330#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:53:52,301 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-08 10:53:52,302 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-08 10:53:52,303 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-08 10:53:52,303 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-08 10:53:52,303 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-08 10:53:52,304 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-08 10:53:52,304 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-08 10:53:52,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {2229#true} assume !false; {2229#true} is VALID [2022-04-08 10:53:52,304 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-08 10:53:52,304 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-08 10:53:52,304 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-08 10:53:52,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#true} assume !!(0 != ~a~0 && 0 != ~b~0); {2229#true} is VALID [2022-04-08 10:53:52,304 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2229#true} {2229#true} #70#return; {2229#true} is VALID [2022-04-08 10:53:52,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 10:53:52,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-08 10:53:52,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-08 10:53:52,305 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-08 10:53:52,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#true} assume !false; {2229#true} is VALID [2022-04-08 10:53:52,305 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-08 10:53:52,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2229#true} {2229#true} #68#return; {2229#true} is VALID [2022-04-08 10:53:52,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 10:53:52,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {2229#true} assume !(0 == ~cond); {2229#true} is VALID [2022-04-08 10:53:52,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2229#true} ~cond := #in~cond; {2229#true} is VALID [2022-04-08 10:53:52,305 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-08 10:53:52,305 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-08 10:53:52,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#true} call #t~ret6 := main(); {2229#true} is VALID [2022-04-08 10:53:52,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#true} {2229#true} #76#return; {2229#true} is VALID [2022-04-08 10:53:52,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#true} assume true; {2229#true} is VALID [2022-04-08 10:53:52,306 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-08 10:53:52,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2229#true} call ULTIMATE.init(); {2229#true} is VALID [2022-04-08 10:53:52,306 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-08 10:53:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:53:52,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866956925] [2022-04-08 10:53:52,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:53:52,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347051511] [2022-04-08 10:53:52,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347051511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:53:52,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:53:52,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-08 10:53:52,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:53:52,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977337064] [2022-04-08 10:53:52,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977337064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:53:52,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:53:52,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:53:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697608227] [2022-04-08 10:53:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:53:52,308 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-08 10:53:52,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:53:52,308 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-08 10:53:54,333 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-08 10:53:54,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:53:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:53:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:53:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:53:54,334 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-08 10:53:57,379 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-08 10:53:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:53:59,983 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-08 10:53:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:53:59,983 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-08 10:53:59,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:53:59,984 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-08 10:53:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 10:53:59,985 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-08 10:53:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-08 10:53:59,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-08 10:54:02,031 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-08 10:54:02,032 INFO L225 Difference]: With dead ends: 66 [2022-04-08 10:54:02,032 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:54:02,033 INFO L912 BasicCegarLoop]: 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-08 10:54:02,034 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:54:02,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 10:54:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:54:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-04-08 10:54:02,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:54:02,077 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-08 10:54:02,077 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-08 10:54:02,078 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-08 10:54:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:02,079 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 10:54:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 10:54:02,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:54:02,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:54:02,080 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-08 10:54:02,080 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-08 10:54:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:02,081 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-04-08 10:54:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 10:54:02,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:54:02,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:54:02,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:54:02,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:54:02,082 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-08 10:54:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-08 10:54:02,083 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 33 [2022-04-08 10:54:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:54:02,083 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-08 10:54:02,084 INFO L479 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-08 10:54:02,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-08 10:54:08,295 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-08 10:54:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-08 10:54:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:54:08,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:54:08,295 INFO L499 BasicCegarLoop]: 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-08 10:54:08,312 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-08 10:54:08,506 WARN L460 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-08 10:54:08,508 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:54:08,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:54:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash 471114083, now seen corresponding path program 1 times [2022-04-08 10:54:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:54:08,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9504061] [2022-04-08 10:54:14,557 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:54:14,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:54:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash 471114083, now seen corresponding path program 2 times [2022-04-08 10:54:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:54:14,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670114320] [2022-04-08 10:54:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:54:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:54:14,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:54:14,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283745197] [2022-04-08 10:54:14,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:54:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:54:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:54:14,568 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-08 10:54:14,569 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-08 10:54:14,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:54:14,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:54:14,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:54:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:54:14,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:54:25,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2022-04-08 10:54:25,132 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-08 10:54:25,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-08 10:54:25,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #76#return; {2819#true} is VALID [2022-04-08 10:54:25,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret6 := main(); {2819#true} is VALID [2022-04-08 10:54:25,132 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-08 10:54:25,132 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-08 10:54:25,133 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-08 10:54:25,133 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-08 10:54:25,133 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-08 10:54:25,134 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-08 10:54:25,134 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-08 10:54:25,134 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-08 10:54:25,134 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-08 10:54:25,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {2819#true} ~cond := #in~cond; {2819#true} is VALID [2022-04-08 10:54:25,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#true} assume !(0 == ~cond); {2819#true} is VALID [2022-04-08 10:54:25,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-08 10:54:25,135 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-08 10:54:25,135 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-08 10:54:25,136 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-08 10:54:25,136 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-08 10:54:25,137 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-08 10:54:25,137 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-08 10:54:25,137 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-08 10:54:25,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {2819#true} ~cond := #in~cond; {2901#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:25,138 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-08 10:54:25,138 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-08 10:54:27,140 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-08 10:54:27,142 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-08 10:54:27,142 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-08 10:54:27,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {2920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:27,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {2924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2820#false} is VALID [2022-04-08 10:54:27,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2022-04-08 10:54:27,143 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-08 10:54:27,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:54:38,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2022-04-08 10:54:38,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {2924#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2820#false} is VALID [2022-04-08 10:54:38,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {2920#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2924#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:54:38,859 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-08 10:54:38,860 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-08 10:54:38,861 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-08 10:54:38,862 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-08 10:54:38,862 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-08 10:54:38,862 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-08 10:54:38,863 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-08 10:54:38,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {2819#true} assume !false; {2819#true} is VALID [2022-04-08 10:54:38,863 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-08 10:54:38,863 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-08 10:54:38,863 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-08 10:54:38,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {2819#true} assume !!(0 != ~a~0 && 0 != ~b~0); {2819#true} is VALID [2022-04-08 10:54:38,863 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2819#true} {2819#true} #70#return; {2819#true} is VALID [2022-04-08 10:54:38,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-08 10:54:38,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#true} assume !(0 == ~cond); {2819#true} is VALID [2022-04-08 10:54:38,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {2819#true} ~cond := #in~cond; {2819#true} is VALID [2022-04-08 10:54:38,864 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-08 10:54:38,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {2819#true} assume !false; {2819#true} is VALID [2022-04-08 10:54:38,864 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-08 10:54:38,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2819#true} {2819#true} #68#return; {2819#true} is VALID [2022-04-08 10:54:38,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-08 10:54:38,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {2819#true} assume !(0 == ~cond); {2819#true} is VALID [2022-04-08 10:54:38,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {2819#true} ~cond := #in~cond; {2819#true} is VALID [2022-04-08 10:54:38,864 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-08 10:54:38,864 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-08 10:54:38,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret6 := main(); {2819#true} is VALID [2022-04-08 10:54:38,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #76#return; {2819#true} is VALID [2022-04-08 10:54:38,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2022-04-08 10:54:38,865 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-08 10:54:38,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2022-04-08 10:54:38,865 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-08 10:54:38,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:54:38,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670114320] [2022-04-08 10:54:38,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:54:38,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283745197] [2022-04-08 10:54:38,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283745197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:54:38,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:54:38,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-08 10:54:38,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:54:38,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9504061] [2022-04-08 10:54:38,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9504061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:54:38,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:54:38,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:54:38,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684086277] [2022-04-08 10:54:38,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:54:38,866 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-08 10:54:38,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:54:38,867 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-08 10:54:40,897 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-08 10:54:40,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:54:40,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:54:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:54:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:54:40,898 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-08 10:54:43,835 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-08 10:54:47,270 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-08 10:54:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:50,509 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-04-08 10:54:50,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:54:50,510 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-08 10:54:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:54:50,510 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-08 10:54:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-04-08 10:54:50,511 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-08 10:54:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-04-08 10:54:50,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 63 transitions. [2022-04-08 10:54:54,575 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-08 10:54:54,577 INFO L225 Difference]: With dead ends: 81 [2022-04-08 10:54:54,577 INFO L226 Difference]: Without dead ends: 79 [2022-04-08 10:54:54,577 INFO L912 BasicCegarLoop]: 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-08 10:54:54,577 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:54:54,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 278 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-04-08 10:54:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-08 10:54:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2022-04-08 10:54:54,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:54:54,625 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-08 10:54:54,625 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-08 10:54:54,626 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-08 10:54:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:54,628 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-04-08 10:54:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-04-08 10:54:54,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:54:54,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:54:54,629 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-08 10:54:54,629 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-08 10:54:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:54:54,631 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-04-08 10:54:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-04-08 10:54:54,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:54:54,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:54:54,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:54:54,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:54:54,632 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-08 10:54:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-04-08 10:54:54,634 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 33 [2022-04-08 10:54:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:54:54,634 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-04-08 10:54:54,634 INFO L479 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-08 10:54:54,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 83 transitions. [2022-04-08 10:55:02,897 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-08 10:55:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 10:55:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:55:02,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:02,898 INFO L499 BasicCegarLoop]: 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-08 10:55:02,914 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-08 10:55:03,111 WARN L460 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-08 10:55:03,112 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash 694423764, now seen corresponding path program 1 times [2022-04-08 10:55:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2084911992] [2022-04-08 10:55:09,157 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:09,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash 694423764, now seen corresponding path program 2 times [2022-04-08 10:55:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:09,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808160116] [2022-04-08 10:55:09,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:09,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:09,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19387029] [2022-04-08 10:55:09,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:09,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:09,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:09,170 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-08 10:55:09,171 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-08 10:55:09,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:09,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:09,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 10:55:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:09,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:09,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {3490#true} call ULTIMATE.init(); {3490#true} is VALID [2022-04-08 10:55:09,308 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-08 10:55:09,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-08 10:55:09,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3490#true} {3490#true} #76#return; {3490#true} is VALID [2022-04-08 10:55:09,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {3490#true} call #t~ret6 := main(); {3490#true} is VALID [2022-04-08 10:55:09,309 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-08 10:55:09,309 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-08 10:55:09,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-08 10:55:09,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-08 10:55:09,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-08 10:55:09,309 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3490#true} {3490#true} #68#return; {3490#true} is VALID [2022-04-08 10:55:09,309 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-08 10:55:09,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {3490#true} assume !false; {3490#true} is VALID [2022-04-08 10:55:09,309 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-08 10:55:09,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-08 10:55:09,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-08 10:55:09,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-08 10:55:09,309 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3490#true} {3490#true} #70#return; {3490#true} is VALID [2022-04-08 10:55:09,310 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-08 10:55:09,310 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-08 10:55:09,310 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-08 10:55:09,310 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-08 10:55:09,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {3549#(not (= main_~a~0 0))} assume !false; {3549#(not (= main_~a~0 0))} is VALID [2022-04-08 10:55:09,311 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-08 10:55:09,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-08 10:55:09,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-08 10:55:09,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-08 10:55:09,312 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-08 10:55:09,312 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-08 10:55:09,312 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-08 10:55:09,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {3490#true} ~cond := #in~cond; {3490#true} is VALID [2022-04-08 10:55:09,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {3490#true} assume !(0 == ~cond); {3490#true} is VALID [2022-04-08 10:55:09,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {3490#true} assume true; {3490#true} is VALID [2022-04-08 10:55:09,313 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-08 10:55:09,313 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-08 10:55:09,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {3599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3603#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:09,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {3603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3491#false} is VALID [2022-04-08 10:55:09,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {3491#false} assume !false; {3491#false} is VALID [2022-04-08 10:55:09,314 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-08 10:55:09,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:55:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808160116] [2022-04-08 10:55:09,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19387029] [2022-04-08 10:55:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19387029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:09,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:09,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:55:09,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:09,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2084911992] [2022-04-08 10:55:09,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2084911992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:09,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:09,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:55:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371404532] [2022-04-08 10:55:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:09,315 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-08 10:55:09,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:09,316 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-08 10:55:09,336 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-08 10:55:09,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:55:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:55:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:55:09,337 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-08 10:55:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:09,538 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-08 10:55:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:55:09,539 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-08 10:55:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:09,539 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-08 10:55:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 10:55:09,540 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-08 10:55:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-08 10:55:09,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-08 10:55:09,575 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-08 10:55:09,577 INFO L225 Difference]: With dead ends: 75 [2022-04-08 10:55:09,577 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 10:55:09,577 INFO L912 BasicCegarLoop]: 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-08 10:55:09,577 INFO L913 BasicCegarLoop]: 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-08 10:55:09,578 INFO L914 BasicCegarLoop]: 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-08 10:55:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 10:55:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-08 10:55:09,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:09,631 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-08 10:55:09,631 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-08 10:55:09,631 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-08 10:55:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:09,633 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-08 10:55:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-08 10:55:09,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:09,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:09,634 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-08 10:55:09,634 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-08 10:55:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:09,635 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-04-08 10:55:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-08 10:55:09,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:09,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:09,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:09,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:09,636 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-08 10:55:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-08 10:55:09,637 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 38 [2022-04-08 10:55:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:09,638 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-08 10:55:09,638 INFO L479 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-08 10:55:09,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 86 transitions. [2022-04-08 10:55:19,906 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-08 10:55:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-08 10:55:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:55:19,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:19,907 INFO L499 BasicCegarLoop]: 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-08 10:55:19,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 10:55:20,114 WARN L460 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-08 10:55:20,114 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -893924138, now seen corresponding path program 1 times [2022-04-08 10:55:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:20,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295762555] [2022-04-08 10:55:26,175 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:26,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash -893924138, now seen corresponding path program 2 times [2022-04-08 10:55:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091884143] [2022-04-08 10:55:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:26,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:26,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304821415] [2022-04-08 10:55:26,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:26,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:26,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:26,186 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-08 10:55:26,208 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-08 10:55:26,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:26,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:26,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:55:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:26,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:26,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-08 10:55:26,557 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-08 10:55:26,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #76#return; {4029#true} is VALID [2022-04-08 10:55:26,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret6 := main(); {4029#true} is VALID [2022-04-08 10:55:26,557 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-08 10:55:26,557 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-08 10:55:26,563 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-08 10:55:26,563 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-08 10:55:26,563 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-08 10:55:26,564 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-08 10:55:26,564 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-08 10:55:26,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {4070#(<= 1 main_~b~0)} assume !false; {4070#(<= 1 main_~b~0)} is VALID [2022-04-08 10:55:26,565 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-08 10:55:26,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,566 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4029#true} {4070#(<= 1 main_~b~0)} #70#return; {4070#(<= 1 main_~b~0)} is VALID [2022-04-08 10:55:26,566 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-08 10:55:26,566 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-08 10:55:26,567 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-08 10:55:26,568 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-08 10:55:26,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {4101#(<= 0 main_~b~0)} assume !false; {4101#(<= 0 main_~b~0)} is VALID [2022-04-08 10:55:26,568 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-08 10:55:26,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,569 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4029#true} {4101#(<= 0 main_~b~0)} #70#return; {4101#(<= 0 main_~b~0)} is VALID [2022-04-08 10:55:26,569 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-08 10:55:26,570 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-08 10:55:26,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,570 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-08 10:55:26,572 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-08 10:55:26,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:26,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {4146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-08 10:55:26,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-08 10:55:26,573 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-08 10:55:26,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:55:26,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {4030#false} assume !false; {4030#false} is VALID [2022-04-08 10:55:26,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {4146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4030#false} is VALID [2022-04-08 10:55:26,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {4142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:26,785 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-08 10:55:26,785 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-08 10:55:26,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,786 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-08 10:55:26,787 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-08 10:55:26,787 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4029#true} {4029#true} #70#return; {4029#true} is VALID [2022-04-08 10:55:26,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,788 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-08 10:55:26,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {4029#true} assume !false; {4029#true} is VALID [2022-04-08 10:55:26,788 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-08 10:55:26,788 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-08 10:55:26,788 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-08 10:55:26,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4029#true} is VALID [2022-04-08 10:55:26,788 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4029#true} {4029#true} #70#return; {4029#true} is VALID [2022-04-08 10:55:26,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,788 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-08 10:55:26,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#true} assume !false; {4029#true} is VALID [2022-04-08 10:55:26,789 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-08 10:55:26,789 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4029#true} {4029#true} #68#return; {4029#true} is VALID [2022-04-08 10:55:26,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {4029#true} assume !(0 == ~cond); {4029#true} is VALID [2022-04-08 10:55:26,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {4029#true} ~cond := #in~cond; {4029#true} is VALID [2022-04-08 10:55:26,789 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-08 10:55:26,789 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-08 10:55:26,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {4029#true} call #t~ret6 := main(); {4029#true} is VALID [2022-04-08 10:55:26,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4029#true} {4029#true} #76#return; {4029#true} is VALID [2022-04-08 10:55:26,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {4029#true} assume true; {4029#true} is VALID [2022-04-08 10:55:26,789 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-08 10:55:26,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {4029#true} call ULTIMATE.init(); {4029#true} is VALID [2022-04-08 10:55:26,790 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-08 10:55:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:55:26,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091884143] [2022-04-08 10:55:26,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:55:26,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304821415] [2022-04-08 10:55:26,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304821415] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:55:26,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:55:26,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-08 10:55:26,791 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:55:26,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295762555] [2022-04-08 10:55:26,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295762555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:55:26,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:55:26,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:55:26,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660111374] [2022-04-08 10:55:26,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:55:26,791 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-08 10:55:26,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:55:26,792 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-08 10:55:26,815 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-08 10:55:26,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:55:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:26,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:55:26,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:55:26,816 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-08 10:55:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:27,187 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-04-08 10:55:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:55:27,187 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-08 10:55:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:55:27,188 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-08 10:55:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:55:27,189 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-08 10:55:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:55:27,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 10:55:27,225 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-08 10:55:27,226 INFO L225 Difference]: With dead ends: 73 [2022-04-08 10:55:27,226 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:55:27,226 INFO L912 BasicCegarLoop]: 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-08 10:55:27,227 INFO L913 BasicCegarLoop]: 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-08 10:55:27,227 INFO L914 BasicCegarLoop]: 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-08 10:55:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:55:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2022-04-08 10:55:27,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:55:27,267 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-08 10:55:27,267 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-08 10:55:27,267 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-08 10:55:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:27,269 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-08 10:55:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-08 10:55:27,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:27,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:27,269 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-08 10:55:27,269 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-08 10:55:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:55:27,270 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-08 10:55:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-04-08 10:55:27,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:55:27,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:55:27,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:55:27,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:55:27,271 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-08 10:55:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-08 10:55:27,272 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 38 [2022-04-08 10:55:27,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:55:27,272 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-08 10:55:27,272 INFO L479 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-08 10:55:27,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-08 10:55:33,484 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-08 10:55:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-08 10:55:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:55:33,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:55:33,484 INFO L499 BasicCegarLoop]: 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-08 10:55:33,500 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-08 10:55:33,698 WARN L460 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-08 10:55:33,699 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:55:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:55:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1791170484, now seen corresponding path program 1 times [2022-04-08 10:55:33,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:55:33,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1215512885] [2022-04-08 10:55:45,800 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:55:45,801 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:55:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1791170484, now seen corresponding path program 2 times [2022-04-08 10:55:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:55:45,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949835735] [2022-04-08 10:55:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:55:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:55:45,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:55:45,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153042964] [2022-04-08 10:55:45,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:55:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:55:45,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:55:45,810 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-08 10:55:45,813 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-08 10:55:45,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:55:45,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:55:45,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:55:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:55:45,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:55:56,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {4627#true} call ULTIMATE.init(); {4627#true} is VALID [2022-04-08 10:55:56,013 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-08 10:55:56,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:55:56,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4627#true} {4627#true} #76#return; {4627#true} is VALID [2022-04-08 10:55:56,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {4627#true} call #t~ret6 := main(); {4627#true} is VALID [2022-04-08 10:55:56,014 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-08 10:55:56,014 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-08 10:55:56,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-08 10:55:56,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-08 10:55:56,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:55:56,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4627#true} {4627#true} #68#return; {4627#true} is VALID [2022-04-08 10:55:56,014 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-08 10:55:56,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-08 10:55:56,014 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-08 10:55:56,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-08 10:55:56,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-08 10:55:56,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:55:56,015 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-08 10:55:56,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4627#true} is VALID [2022-04-08 10:55:56,015 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-08 10:55:56,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-08 10:55:56,015 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-08 10:55:56,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-08 10:55:56,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-08 10:55:56,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:55:56,015 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-08 10:55:56,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-08 10:55:56,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-08 10:55:56,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-08 10:55:56,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-08 10:55:56,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-08 10:55:56,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {4627#true} ~cond := #in~cond; {4726#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:55:56,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-08 10:55:56,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-08 10:55:58,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-08 10:55:58,021 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-08 10:55:58,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-08 10:55:58,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-08 10:55:58,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4628#false} is VALID [2022-04-08 10:55:58,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {4628#false} assume !false; {4628#false} is VALID [2022-04-08 10:55:58,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-08 10:55:58,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:56:25,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {4628#false} assume !false; {4628#false} is VALID [2022-04-08 10:56:25,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4628#false} is VALID [2022-04-08 10:56:25,456 INFO L290 TraceCheckUtils]: 37: Hoare triple {4745#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4749#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:56:25,456 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-08 10:56:25,457 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-08 10:56:25,459 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-08 10:56:25,459 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-08 10:56:25,459 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-08 10:56:25,460 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-08 10:56:25,460 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-08 10:56:25,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-08 10:56:25,460 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-08 10:56:25,460 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-08 10:56:25,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4627#true} is VALID [2022-04-08 10:56:25,460 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-08 10:56:25,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:56:25,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-08 10:56:25,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-08 10:56:25,460 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-08 10:56:25,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-08 10:56:25,461 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-08 10:56:25,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {4627#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4627#true} {4627#true} #70#return; {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-08 10:56:25,461 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-08 10:56:25,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {4627#true} assume !false; {4627#true} is VALID [2022-04-08 10:56:25,461 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-08 10:56:25,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4627#true} {4627#true} #68#return; {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {4627#true} assume !(0 == ~cond); {4627#true} is VALID [2022-04-08 10:56:25,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {4627#true} ~cond := #in~cond; {4627#true} is VALID [2022-04-08 10:56:25,461 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-08 10:56:25,462 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-08 10:56:25,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {4627#true} call #t~ret6 := main(); {4627#true} is VALID [2022-04-08 10:56:25,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4627#true} {4627#true} #76#return; {4627#true} is VALID [2022-04-08 10:56:25,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {4627#true} assume true; {4627#true} is VALID [2022-04-08 10:56:25,462 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-08 10:56:25,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {4627#true} call ULTIMATE.init(); {4627#true} is VALID [2022-04-08 10:56:25,462 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-08 10:56:25,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:56:25,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949835735] [2022-04-08 10:56:25,462 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:56:25,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153042964] [2022-04-08 10:56:25,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153042964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:56:25,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:56:25,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-08 10:56:25,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:56:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1215512885] [2022-04-08 10:56:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1215512885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:56:25,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:56:25,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:56:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519783748] [2022-04-08 10:56:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:56:25,463 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-08 10:56:25,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:56:25,464 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-08 10:56:27,501 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-08 10:56:27,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:56:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:56:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:56:27,503 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-08 10:56:30,709 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-08 10:56:33,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:33,785 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2022-04-08 10:56:33,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:56:33,785 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-08 10:56:33,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:56:33,785 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-08 10:56:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 10:56:33,786 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-08 10:56:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-08 10:56:33,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-08 10:56:35,820 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-08 10:56:35,821 INFO L225 Difference]: With dead ends: 70 [2022-04-08 10:56:35,821 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:56:35,821 INFO L912 BasicCegarLoop]: 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-08 10:56:35,822 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:56:35,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 10:56:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:56:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2022-04-08 10:56:35,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:56:35,851 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-08 10:56:35,852 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-08 10:56:35,852 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-08 10:56:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:35,853 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 10:56:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-08 10:56:35,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:35,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:35,853 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-08 10:56:35,853 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-08 10:56:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:56:35,855 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 10:56:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-08 10:56:35,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:56:35,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:56:35,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:56:35,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:56:35,855 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-08 10:56:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-08 10:56:35,856 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 40 [2022-04-08 10:56:35,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:56:35,856 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-08 10:56:35,856 INFO L479 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-08 10:56:35,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-08 10:56:40,050 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-08 10:56:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-08 10:56:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:56:40,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:56:40,051 INFO L499 BasicCegarLoop]: 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-08 10:56:40,069 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-08 10:56:40,251 WARN L460 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-08 10:56:40,251 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:56:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:56:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -304375484, now seen corresponding path program 1 times [2022-04-08 10:56:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:56:40,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1088301084] [2022-04-08 10:56:52,345 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:56:52,345 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:56:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash -304375484, now seen corresponding path program 2 times [2022-04-08 10:56:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:56:52,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073437498] [2022-04-08 10:56:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:56:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:56:52,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:56:52,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894312256] [2022-04-08 10:56:52,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:56:52,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:56:52,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:56:52,375 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-08 10:56:52,376 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-08 10:56:52,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:56:52,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:56:52,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:56:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:56:52,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:03,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {5237#true} call ULTIMATE.init(); {5237#true} is VALID [2022-04-08 10:57:03,618 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-08 10:57:03,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:03,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5237#true} {5237#true} #76#return; {5237#true} is VALID [2022-04-08 10:57:03,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {5237#true} call #t~ret6 := main(); {5237#true} is VALID [2022-04-08 10:57:03,618 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-08 10:57:03,618 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-08 10:57:03,618 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-08 10:57:03,619 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-08 10:57:03,619 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-08 10:57:03,620 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-08 10:57:03,620 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-08 10:57:03,620 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-08 10:57:03,620 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-08 10:57:03,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-08 10:57:03,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-08 10:57:03,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:03,621 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-08 10:57:03,621 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-08 10:57:03,623 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-08 10:57:03,623 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-08 10:57:03,623 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-08 10:57:03,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-08 10:57:03,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-08 10:57:03,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:03,624 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-08 10:57:03,624 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-08 10:57:03,625 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-08 10:57:03,625 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-08 10:57:03,626 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-08 10:57:03,626 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-08 10:57:03,627 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-08 10:57:03,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {5237#true} ~cond := #in~cond; {5344#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:03,627 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-08 10:57:03,627 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-08 10:57:05,630 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-08 10:57:05,631 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-08 10:57:05,632 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-08 10:57:05,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {5363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5238#false} is VALID [2022-04-08 10:57:05,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-04-08 10:57:05,633 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-08 10:57:05,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:20,204 INFO L290 TraceCheckUtils]: 40: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-04-08 10:57:20,204 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5238#false} is VALID [2022-04-08 10:57:20,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {5363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:57:20,205 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-08 10:57:20,206 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-08 10:57:20,208 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-08 10:57:20,208 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-08 10:57:20,208 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-08 10:57:20,209 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-08 10:57:20,209 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-08 10:57:20,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {5237#true} assume !false; {5237#true} is VALID [2022-04-08 10:57:20,209 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-08 10:57:20,209 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-08 10:57:20,209 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-08 10:57:20,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {5237#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5237#true} is VALID [2022-04-08 10:57:20,209 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5237#true} {5237#true} #70#return; {5237#true} is VALID [2022-04-08 10:57:20,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:20,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-08 10:57:20,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-08 10:57:20,209 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-08 10:57:20,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {5237#true} assume !false; {5237#true} is VALID [2022-04-08 10:57:20,210 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-08 10:57:20,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {5237#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5237#true} {5237#true} #70#return; {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-08 10:57:20,210 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-08 10:57:20,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {5237#true} assume !false; {5237#true} is VALID [2022-04-08 10:57:20,210 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-08 10:57:20,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5237#true} {5237#true} #68#return; {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {5237#true} assume !(0 == ~cond); {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {5237#true} ~cond := #in~cond; {5237#true} is VALID [2022-04-08 10:57:20,210 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-08 10:57:20,210 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-08 10:57:20,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {5237#true} call #t~ret6 := main(); {5237#true} is VALID [2022-04-08 10:57:20,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5237#true} {5237#true} #76#return; {5237#true} is VALID [2022-04-08 10:57:20,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-08 10:57:20,211 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-08 10:57:20,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {5237#true} call ULTIMATE.init(); {5237#true} is VALID [2022-04-08 10:57:20,211 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-08 10:57:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073437498] [2022-04-08 10:57:20,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894312256] [2022-04-08 10:57:20,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894312256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:57:20,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:57:20,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 17 [2022-04-08 10:57:20,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:20,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1088301084] [2022-04-08 10:57:20,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1088301084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:20,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:20,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:57:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32197961] [2022-04-08 10:57:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:20,212 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-08 10:57:20,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:20,212 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-08 10:57:22,241 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-08 10:57:22,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:57:22,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:22,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:57:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:57:22,242 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-08 10:57:25,217 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-08 10:57:32,273 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 10:57:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:33,022 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-08 10:57:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:57:33,022 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-08 10:57:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:33,023 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-08 10:57:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-04-08 10:57:33,023 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-08 10:57:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-04-08 10:57:33,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 67 transitions. [2022-04-08 10:57:39,097 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-08 10:57:39,098 INFO L225 Difference]: With dead ends: 62 [2022-04-08 10:57:39,098 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 10:57:39,099 INFO L912 BasicCegarLoop]: 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-08 10:57:39,099 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:39,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 106 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 198 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-08 10:57:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 10:57:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-04-08 10:57:39,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:39,143 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-08 10:57:39,143 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-08 10:57:39,143 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-08 10:57:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:39,144 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-08 10:57:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-04-08 10:57:39,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:39,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:39,144 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-08 10:57:39,144 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-08 10:57:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:39,145 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-08 10:57:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-04-08 10:57:39,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:39,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:39,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:39,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:39,146 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-08 10:57:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2022-04-08 10:57:39,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 41 [2022-04-08 10:57:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:39,147 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2022-04-08 10:57:39,147 INFO L479 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-08 10:57:39,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 58 transitions. [2022-04-08 10:57:45,379 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-08 10:57:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2022-04-08 10:57:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:57:45,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:57:45,379 INFO L499 BasicCegarLoop]: 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-08 10:57:45,395 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-08 10:57:45,580 WARN L460 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-08 10:57:45,580 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:57:45,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:57:45,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1695567937, now seen corresponding path program 1 times [2022-04-08 10:57:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:45,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772985916] [2022-04-08 10:57:57,675 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:57:57,675 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:57:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1695567937, now seen corresponding path program 2 times [2022-04-08 10:57:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:57:57,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301956640] [2022-04-08 10:57:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:57:57,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:57:57,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:57:57,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652750691] [2022-04-08 10:57:57,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:57:57,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:57:57,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:57:57,688 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-08 10:57:57,695 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-08 10:57:57,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:57:57,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:57:57,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:57:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:57:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:57:58,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {5843#true} call ULTIMATE.init(); {5843#true} is VALID [2022-04-08 10:57:58,150 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-08 10:57:58,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5843#true} {5843#true} #76#return; {5843#true} is VALID [2022-04-08 10:57:58,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {5843#true} call #t~ret6 := main(); {5843#true} is VALID [2022-04-08 10:57:58,150 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-08 10:57:58,150 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-08 10:57:58,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5843#true} {5843#true} #68#return; {5843#true} is VALID [2022-04-08 10:57:58,150 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-08 10:57:58,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#true} assume !false; {5843#true} is VALID [2022-04-08 10:57:58,151 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-08 10:57:58,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,151 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5843#true} {5843#true} #70#return; {5843#true} is VALID [2022-04-08 10:57:58,151 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-08 10:57:58,151 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-08 10:57:58,152 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-08 10:57:58,153 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-08 10:57:58,153 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-08 10:57:58,153 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-08 10:57:58,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,154 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-08 10:57:58,154 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-08 10:57:58,155 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-08 10:57:58,155 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-08 10:57:58,156 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-08 10:57:58,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-08 10:57:58,156 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-08 10:57:58,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {5844#false} ~cond := #in~cond; {5844#false} is VALID [2022-04-08 10:57:58,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {5844#false} assume !(0 == ~cond); {5844#false} is VALID [2022-04-08 10:57:58,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {5844#false} assume true; {5844#false} is VALID [2022-04-08 10:57:58,157 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5844#false} {5844#false} #70#return; {5844#false} is VALID [2022-04-08 10:57:58,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {5844#false} assume !(0 != ~a~0 && 0 != ~b~0); {5844#false} is VALID [2022-04-08 10:57:58,157 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-08 10:57:58,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {5844#false} ~cond := #in~cond; {5844#false} is VALID [2022-04-08 10:57:58,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {5844#false} assume 0 == ~cond; {5844#false} is VALID [2022-04-08 10:57:58,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-08 10:57:58,158 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-08 10:57:58,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:57:58,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-08 10:57:58,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {5844#false} assume 0 == ~cond; {5844#false} is VALID [2022-04-08 10:57:58,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {5844#false} ~cond := #in~cond; {5844#false} is VALID [2022-04-08 10:57:58,515 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-08 10:57:58,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {5844#false} assume !(0 != ~a~0 && 0 != ~b~0); {5844#false} is VALID [2022-04-08 10:57:58,515 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5843#true} {5844#false} #70#return; {5844#false} is VALID [2022-04-08 10:57:58,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,516 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-08 10:57:58,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {5844#false} assume !false; {5844#false} is VALID [2022-04-08 10:57:58,532 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-08 10:57:58,535 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-08 10:57:58,536 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-08 10:57:58,536 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-08 10:57:58,537 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-08 10:57:58,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,537 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-08 10:57:58,538 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-08 10:57:58,539 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-08 10:57:58,539 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-08 10:57:58,539 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-08 10:57:58,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {5843#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5843#true} is VALID [2022-04-08 10:57:58,539 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5843#true} {5843#true} #70#return; {5843#true} is VALID [2022-04-08 10:57:58,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,539 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-08 10:57:58,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {5843#true} assume !false; {5843#true} is VALID [2022-04-08 10:57:58,539 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-08 10:57:58,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5843#true} {5843#true} #68#return; {5843#true} is VALID [2022-04-08 10:57:58,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {5843#true} assume !(0 == ~cond); {5843#true} is VALID [2022-04-08 10:57:58,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {5843#true} ~cond := #in~cond; {5843#true} is VALID [2022-04-08 10:57:58,540 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-08 10:57:58,540 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-08 10:57:58,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {5843#true} call #t~ret6 := main(); {5843#true} is VALID [2022-04-08 10:57:58,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5843#true} {5843#true} #76#return; {5843#true} is VALID [2022-04-08 10:57:58,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {5843#true} assume true; {5843#true} is VALID [2022-04-08 10:57:58,540 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-08 10:57:58,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {5843#true} call ULTIMATE.init(); {5843#true} is VALID [2022-04-08 10:57:58,540 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-08 10:57:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:57:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301956640] [2022-04-08 10:57:58,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:57:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652750691] [2022-04-08 10:57:58,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652750691] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:57:58,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 10:57:58,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-04-08 10:57:58,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:57:58,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772985916] [2022-04-08 10:57:58,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772985916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:57:58,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:57:58,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:57:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385285469] [2022-04-08 10:57:58,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:57:58,542 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-08 10:57:58,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:57:58,542 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-08 10:57:58,567 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-08 10:57:58,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 10:57:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:57:58,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 10:57:58,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:57:58,568 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-08 10:57:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:58,831 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2022-04-08 10:57:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 10:57:58,831 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-08 10:57:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:57:58,831 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-08 10:57:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 10:57:58,832 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-08 10:57:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 10:57:58,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-08 10:57:58,871 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-08 10:57:58,872 INFO L225 Difference]: With dead ends: 91 [2022-04-08 10:57:58,872 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 10:57:58,872 INFO L912 BasicCegarLoop]: 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-08 10:57:58,873 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:57:58,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:57:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 10:57:58,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-04-08 10:57:58,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:57:58,935 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-08 10:57:58,935 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-08 10:57:58,935 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-08 10:57:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:58,936 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-04-08 10:57:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-04-08 10:57:58,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:58,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:58,936 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-08 10:57:58,936 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-08 10:57:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:57:58,937 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-04-08 10:57:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-04-08 10:57:58,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:57:58,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:57:58,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:57:58,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:57:58,938 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-08 10:57:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-08 10:57:58,939 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 43 [2022-04-08 10:57:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:57:58,939 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-08 10:57:58,939 INFO L479 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-08 10:57:58,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-08 10:58:07,263 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-08 10:58:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 10:58:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:58:07,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:58:07,264 INFO L499 BasicCegarLoop]: 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-08 10:58:07,281 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-08 10:58:07,464 WARN L460 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-08 10:58:07,464 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:58:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:58:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1476713219, now seen corresponding path program 3 times [2022-04-08 10:58:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143288330] [2022-04-08 10:58:13,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:58:13,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:58:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1476713219, now seen corresponding path program 4 times [2022-04-08 10:58:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:58:13,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678298635] [2022-04-08 10:58:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:58:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:58:13,535 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:58:13,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072922604] [2022-04-08 10:58:13,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:58:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:58:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:58:13,536 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-08 10:58:13,537 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-08 10:58:13,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:58:13,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:58:13,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:58:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:58:13,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:58:14,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {6522#true} call ULTIMATE.init(); {6522#true} is VALID [2022-04-08 10:58:14,014 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-08 10:58:14,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6522#true} {6522#true} #76#return; {6522#true} is VALID [2022-04-08 10:58:14,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {6522#true} call #t~ret6 := main(); {6522#true} is VALID [2022-04-08 10:58:14,014 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-08 10:58:14,014 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-08 10:58:14,015 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-08 10:58:14,015 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-08 10:58:14,015 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-08 10:58:14,016 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-08 10:58:14,016 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-08 10:58:14,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {6563#(<= 1 main_~b~0)} assume !false; {6563#(<= 1 main_~b~0)} is VALID [2022-04-08 10:58:14,016 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-08 10:58:14,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-08 10:58:14,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-08 10:58:14,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,018 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6522#true} {6563#(<= 1 main_~b~0)} #70#return; {6563#(<= 1 main_~b~0)} is VALID [2022-04-08 10:58:14,018 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-08 10:58:14,019 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-08 10:58:14,019 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-08 10:58:14,020 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-08 10:58:14,021 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-08 10:58:14,021 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-08 10:58:14,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-08 10:58:14,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-08 10:58:14,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,022 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-08 10:58:14,022 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-08 10:58:14,023 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-08 10:58:14,024 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-08 10:58:14,024 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-08 10:58:14,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {6523#false} assume !false; {6523#false} is VALID [2022-04-08 10:58:14,025 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-08 10:58:14,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {6523#false} ~cond := #in~cond; {6523#false} is VALID [2022-04-08 10:58:14,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {6523#false} assume !(0 == ~cond); {6523#false} is VALID [2022-04-08 10:58:14,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {6523#false} assume true; {6523#false} is VALID [2022-04-08 10:58:14,025 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6523#false} {6523#false} #70#return; {6523#false} is VALID [2022-04-08 10:58:14,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {6523#false} assume !(0 != ~a~0 && 0 != ~b~0); {6523#false} is VALID [2022-04-08 10:58:14,025 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-08 10:58:14,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#false} ~cond := #in~cond; {6523#false} is VALID [2022-04-08 10:58:14,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#false} assume 0 == ~cond; {6523#false} is VALID [2022-04-08 10:58:14,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#false} assume !false; {6523#false} is VALID [2022-04-08 10:58:14,025 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-08 10:58:14,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:58:14,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#false} assume !false; {6523#false} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#false} assume 0 == ~cond; {6523#false} is VALID [2022-04-08 10:58:14,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#false} ~cond := #in~cond; {6523#false} is VALID [2022-04-08 10:58:14,843 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-08 10:58:14,843 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-08 10:58:14,844 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-08 10:58:14,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-08 10:58:14,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-08 10:58:14,844 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-08 10:58:14,844 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-08 10:58:14,846 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-08 10:58:14,846 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-08 10:58:14,847 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-08 10:58:14,847 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-08 10:58:14,848 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-08 10:58:14,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-08 10:58:14,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-08 10:58:14,848 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-08 10:58:14,849 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-08 10:58:14,850 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-08 10:58:14,851 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-08 10:58:14,851 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-08 10:58:14,852 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-08 10:58:14,852 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-08 10:58:14,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {6522#true} assume !(0 == ~cond); {6522#true} is VALID [2022-04-08 10:58:14,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {6522#true} ~cond := #in~cond; {6522#true} is VALID [2022-04-08 10:58:14,852 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-08 10:58:14,853 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-08 10:58:14,853 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-08 10:58:14,854 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-08 10:58:14,854 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-08 10:58:14,854 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-08 10:58:14,855 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-08 10:58:14,855 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-08 10:58:14,855 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-08 10:58:14,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {6522#true} call #t~ret6 := main(); {6522#true} is VALID [2022-04-08 10:58:14,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6522#true} {6522#true} #76#return; {6522#true} is VALID [2022-04-08 10:58:14,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {6522#true} assume true; {6522#true} is VALID [2022-04-08 10:58:14,855 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-08 10:58:14,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {6522#true} call ULTIMATE.init(); {6522#true} is VALID [2022-04-08 10:58:14,855 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-08 10:58:14,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:58:14,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678298635] [2022-04-08 10:58:14,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:58:14,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072922604] [2022-04-08 10:58:14,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072922604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:58:14,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:58:14,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2022-04-08 10:58:14,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:58:14,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143288330] [2022-04-08 10:58:14,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143288330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:58:14,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:58:14,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:58:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23606923] [2022-04-08 10:58:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:58:14,857 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-08 10:58:14,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:58:14,857 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-08 10:58:14,887 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-08 10:58:14,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:58:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:58:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:58:14,887 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-08 10:58:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:15,654 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2022-04-08 10:58:15,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:58:15,654 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-08 10:58:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:58:15,655 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-08 10:58:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-08 10:58:15,655 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-08 10:58:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-08 10:58:15,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-08 10:58:15,713 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-08 10:58:15,714 INFO L225 Difference]: With dead ends: 88 [2022-04-08 10:58:15,714 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 10:58:15,715 INFO L912 BasicCegarLoop]: 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-08 10:58:15,715 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:58:15,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:58:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 10:58:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-08 10:58:15,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:58:15,826 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-08 10:58:15,827 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-08 10:58:15,827 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-08 10:58:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:15,828 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-04-08 10:58:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-08 10:58:15,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:15,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:15,828 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-08 10:58:15,828 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-08 10:58:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:58:15,829 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-04-08 10:58:15,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-08 10:58:15,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:58:15,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:58:15,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:58:15,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:58:15,830 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-08 10:58:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-08 10:58:15,831 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 43 [2022-04-08 10:58:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:58:15,831 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-08 10:58:15,831 INFO L479 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-08 10:58:15,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-08 10:58:24,113 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-08 10:58:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 10:58:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 10:58:24,114 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:58:24,114 INFO L499 BasicCegarLoop]: 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-08 10:58:24,130 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-08 10:58:24,314 WARN L460 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-08 10:58:24,316 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:58:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:58:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash -253681627, now seen corresponding path program 3 times [2022-04-08 10:58:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:58:24,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676550383] [2022-04-08 10:58:36,410 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:58:36,411 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:58:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash -253681627, now seen corresponding path program 4 times [2022-04-08 10:58:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:58:36,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531734453] [2022-04-08 10:58:36,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:58:36,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:58:36,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:58:36,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658368463] [2022-04-08 10:58:36,420 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:58:36,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:58:36,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:58:36,421 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-08 10:58:36,435 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-08 10:58:36,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:58:36,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:58:36,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:58:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:58:36,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:58:47,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {7227#true} call ULTIMATE.init(); {7227#true} is VALID [2022-04-08 10:58:47,407 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-08 10:58:47,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:58:47,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7227#true} {7227#true} #76#return; {7227#true} is VALID [2022-04-08 10:58:47,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {7227#true} call #t~ret6 := main(); {7227#true} is VALID [2022-04-08 10:58:47,407 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-08 10:58:47,407 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-08 10:58:47,408 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-08 10:58:47,408 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-08 10:58:47,408 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-08 10:58:47,409 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-08 10:58:47,409 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-08 10:58:47,409 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-08 10:58:47,409 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-08 10:58:47,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:58:47,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:58:47,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:58:47,410 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-08 10:58:47,410 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-08 10:58:47,412 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-08 10:58:47,412 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-08 10:58:47,412 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-08 10:58:47,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:58:47,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:58:47,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:58:47,413 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-08 10:58:47,413 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-08 10:58:47,414 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-08 10:58:47,415 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-08 10:58:47,415 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-08 10:58:47,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:58:47,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:58:47,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:58:47,415 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-08 10:58:47,416 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-08 10:58:47,416 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-08 10:58:47,417 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-08 10:58:47,418 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-08 10:58:47,418 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-08 10:58:47,418 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-08 10:58:47,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {7227#true} ~cond := #in~cond; {7359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:58:47,419 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-08 10:58:47,419 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-08 10:58:49,422 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-08 10:58:49,424 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-08 10:58:49,424 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-08 10:58:49,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {7378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:58:49,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {7382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7228#false} is VALID [2022-04-08 10:58:49,425 INFO L290 TraceCheckUtils]: 48: Hoare triple {7228#false} assume !false; {7228#false} is VALID [2022-04-08 10:58:49,425 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-08 10:58:49,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:59:13,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {7228#false} assume !false; {7228#false} is VALID [2022-04-08 10:59:13,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {7382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7228#false} is VALID [2022-04-08 10:59:13,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {7378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:59:13,300 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-08 10:59:13,301 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-08 10:59:13,303 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-08 10:59:13,303 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-08 10:59:13,304 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-08 10:59:13,304 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-08 10:59:13,304 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-08 10:59:13,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-08 10:59:13,304 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-08 10:59:13,304 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-08 10:59:13,304 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-08 10:59:13,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {7227#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7227#true} is VALID [2022-04-08 10:59:13,304 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7227#true} {7227#true} #70#return; {7227#true} is VALID [2022-04-08 10:59:13,304 INFO L290 TraceCheckUtils]: 32: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:59:13,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:59:13,305 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-08 10:59:13,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-08 10:59:13,305 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-08 10:59:13,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {7227#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7227#true} {7227#true} #70#return; {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:59:13,305 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-08 10:59:13,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-08 10:59:13,305 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-08 10:59:13,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {7227#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7227#true} {7227#true} #70#return; {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:59:13,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:59:13,306 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-08 10:59:13,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {7227#true} assume !false; {7227#true} is VALID [2022-04-08 10:59:13,306 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-08 10:59:13,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7227#true} {7227#true} #68#return; {7227#true} is VALID [2022-04-08 10:59:13,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:59:13,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {7227#true} assume !(0 == ~cond); {7227#true} is VALID [2022-04-08 10:59:13,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {7227#true} ~cond := #in~cond; {7227#true} is VALID [2022-04-08 10:59:13,306 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-08 10:59:13,306 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-08 10:59:13,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {7227#true} call #t~ret6 := main(); {7227#true} is VALID [2022-04-08 10:59:13,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7227#true} {7227#true} #76#return; {7227#true} is VALID [2022-04-08 10:59:13,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {7227#true} assume true; {7227#true} is VALID [2022-04-08 10:59:13,306 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-08 10:59:13,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {7227#true} call ULTIMATE.init(); {7227#true} is VALID [2022-04-08 10:59:13,306 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-08 10:59:13,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:59:13,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531734453] [2022-04-08 10:59:13,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:59:13,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658368463] [2022-04-08 10:59:13,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658368463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:59:13,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:59:13,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-08 10:59:13,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:59:13,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676550383] [2022-04-08 10:59:13,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676550383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:59:13,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:59:13,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:59:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508743024] [2022-04-08 10:59:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:59:13,308 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-08 10:59:13,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:59:13,308 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-08 10:59:15,344 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-08 10:59:15,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:59:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:59:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:59:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:59:15,345 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-08 10:59:19,094 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-08 10:59:25,515 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-08 10:59:31,123 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-08 10:59:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:31,597 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-04-08 10:59:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:59:31,597 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-08 10:59:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:59:31,597 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-08 10:59:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2022-04-08 10:59:31,598 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-08 10:59:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 75 transitions. [2022-04-08 10:59:31,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 75 transitions. [2022-04-08 10:59:39,694 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-08 10:59:39,696 INFO L225 Difference]: With dead ends: 90 [2022-04-08 10:59:39,696 INFO L226 Difference]: Without dead ends: 85 [2022-04-08 10:59:39,696 INFO L912 BasicCegarLoop]: 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-08 10:59:39,697 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:59:39,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 137 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 243 Invalid, 3 Unknown, 0 Unchecked, 9.7s Time] [2022-04-08 10:59:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-08 10:59:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2022-04-08 10:59:39,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:59:39,846 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-08 10:59:39,846 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-08 10:59:39,847 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-08 10:59:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:39,848 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2022-04-08 10:59:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2022-04-08 10:59:39,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:59:39,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:59:39,848 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-08 10:59:39,849 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-08 10:59:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:59:39,850 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2022-04-08 10:59:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2022-04-08 10:59:39,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:59:39,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:59:39,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:59:39,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:59:39,850 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-08 10:59:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-04-08 10:59:39,851 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 49 [2022-04-08 10:59:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:59:39,852 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-04-08 10:59:39,852 INFO L479 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-08 10:59:39,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 83 transitions. [2022-04-08 10:59:52,262 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-08 10:59:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-04-08 10:59:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 10:59:52,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:59:52,263 INFO L499 BasicCegarLoop]: 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-08 10:59:52,279 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-08 10:59:52,475 WARN L460 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-08 10:59:52,475 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:59:52,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:59:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1751157664, now seen corresponding path program 1 times [2022-04-08 10:59:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:59:52,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715073745] [2022-04-08 11:00:10,610 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:00:10,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:00:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1751157664, now seen corresponding path program 2 times [2022-04-08 11:00:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:00:10,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000097633] [2022-04-08 11:00:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:00:10,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:00:10,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:00:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1321502547] [2022-04-08 11:00:10,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 11:00:10,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:00:10,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:00:10,621 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-08 11:00:10,622 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-08 11:00:10,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 11:00:10,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:00:10,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 11:00:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:00:10,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:00:22,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-08 11:00:22,969 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-08 11:00:22,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:22,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #76#return; {8030#true} is VALID [2022-04-08 11:00:22,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret6 := main(); {8030#true} is VALID [2022-04-08 11:00:22,969 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-08 11:00:22,969 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-08 11:00:22,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:22,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:22,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:22,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8030#true} {8030#true} #68#return; {8030#true} is VALID [2022-04-08 11:00:22,970 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-08 11:00:22,970 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-08 11:00:22,970 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-08 11:00:22,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:22,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:22,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:22,971 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-08 11:00:22,971 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-08 11:00:22,972 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-08 11:00:22,972 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-08 11:00:22,974 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-08 11:00:22,974 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-08 11:00:22,974 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-08 11:00:22,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:22,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:22,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:22,975 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-08 11:00:22,975 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-08 11:00:22,976 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-08 11:00:22,977 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-08 11:00:22,977 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-08 11:00:22,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:22,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:22,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:22,978 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-08 11:00:22,978 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-08 11:00:22,979 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-08 11:00:22,979 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-08 11:00:22,980 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-08 11:00:22,980 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-08 11:00:22,981 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-08 11:00:22,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {8030#true} ~cond := #in~cond; {8167#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:00:22,981 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-08 11:00:22,981 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-08 11:00:24,984 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-08 11:00:24,986 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-08 11:00:24,986 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-08 11:00:24,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:00:24,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {8190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8031#false} is VALID [2022-04-08 11:00:24,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-08 11:00:24,987 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-08 11:00:24,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:00:38,058 INFO L290 TraceCheckUtils]: 50: Hoare triple {8031#false} assume !false; {8031#false} is VALID [2022-04-08 11:00:38,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {8190#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8031#false} is VALID [2022-04-08 11:00:38,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {8186#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8190#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:00:38,068 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-08 11:00:38,069 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-08 11:00:38,072 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-08 11:00:38,072 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-08 11:00:38,073 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-08 11:00:38,073 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-08 11:00:38,073 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-08 11:00:38,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-08 11:00:38,073 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-08 11:00:38,074 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-08 11:00:38,074 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-08 11:00:38,074 INFO L290 TraceCheckUtils]: 36: Hoare triple {8030#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8030#true} is VALID [2022-04-08 11:00:38,074 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8030#true} {8030#true} #70#return; {8030#true} is VALID [2022-04-08 11:00:38,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:38,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:38,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:38,074 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-08 11:00:38,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-08 11:00:38,074 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-08 11:00:38,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {8030#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8030#true} is VALID [2022-04-08 11:00:38,074 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8030#true} {8030#true} #70#return; {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:38,075 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-08 11:00:38,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-08 11:00:38,075 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-08 11:00:38,075 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-08 11:00:38,075 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-08 11:00:38,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {8030#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8030#true} {8030#true} #70#return; {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:38,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:38,075 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-08 11:00:38,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {8030#true} assume !false; {8030#true} is VALID [2022-04-08 11:00:38,076 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-08 11:00:38,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8030#true} {8030#true} #68#return; {8030#true} is VALID [2022-04-08 11:00:38,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:38,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {8030#true} assume !(0 == ~cond); {8030#true} is VALID [2022-04-08 11:00:38,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {8030#true} ~cond := #in~cond; {8030#true} is VALID [2022-04-08 11:00:38,076 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-08 11:00:38,076 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-08 11:00:38,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {8030#true} call #t~ret6 := main(); {8030#true} is VALID [2022-04-08 11:00:38,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8030#true} {8030#true} #76#return; {8030#true} is VALID [2022-04-08 11:00:38,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {8030#true} assume true; {8030#true} is VALID [2022-04-08 11:00:38,076 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-08 11:00:38,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {8030#true} call ULTIMATE.init(); {8030#true} is VALID [2022-04-08 11:00:38,076 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-08 11:00:38,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:00:38,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000097633] [2022-04-08 11:00:38,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:00:38,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321502547] [2022-04-08 11:00:38,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321502547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:00:38,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:00:38,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 17 [2022-04-08 11:00:38,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:00:38,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715073745] [2022-04-08 11:00:38,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715073745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:00:38,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:00:38,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 11:00:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572838354] [2022-04-08 11:00:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:00:38,080 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-08 11:00:38,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:00:38,082 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-08 11:00:40,120 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-08 11:00:40,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 11:00:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:00:40,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 11:00:40,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-04-08 11:00:40,121 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-08 11:00:44,622 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-08 11:00:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:00:49,360 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2022-04-08 11:00:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 11:00:49,360 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-08 11:00:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:00:49,361 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-08 11:00:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 11:00:49,362 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-08 11:00:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-08 11:00:49,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-08 11:00:55,437 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-08 11:00:55,438 INFO L225 Difference]: With dead ends: 99 [2022-04-08 11:00:55,438 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 11:00:55,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-08 11:00:55,439 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 11:00:55,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 11:00:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 11:00:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-04-08 11:00:55,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:00:55,611 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-08 11:00:55,612 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-08 11:00:55,612 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-08 11:00:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:00:55,613 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2022-04-08 11:00:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-04-08 11:00:55,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:00:55,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:00:55,614 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-08 11:00:55,614 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-08 11:00:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:00:55,615 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2022-04-08 11:00:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2022-04-08 11:00:55,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:00:55,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:00:55,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:00:55,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:00:55,616 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-08 11:00:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-04-08 11:00:55,617 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 51 [2022-04-08 11:00:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:00:55,617 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-04-08 11:00:55,617 INFO L479 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-08 11:00:55,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 93 transitions. [2022-04-08 11:01:10,176 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-08 11:01:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-04-08 11:01:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 11:01:10,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 11:01:10,185 INFO L499 BasicCegarLoop]: 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-08 11:01:10,203 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-08 11:01:10,386 WARN L460 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-08 11:01:10,386 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 11:01:10,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 11:01:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1773789918, now seen corresponding path program 5 times [2022-04-08 11:01:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 11:01:10,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997313430] [2022-04-08 11:01:22,476 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 11:01:22,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 11:01:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1773789918, now seen corresponding path program 6 times [2022-04-08 11:01:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 11:01:22,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406636434] [2022-04-08 11:01:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 11:01:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 11:01:22,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 11:01:22,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221146861] [2022-04-08 11:01:22,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 11:01:22,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 11:01:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 11:01:22,493 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-08 11:01:22,494 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-08 11:01:22,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 11:01:22,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 11:01:22,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 11:01:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 11:01:22,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 11:01:32,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {8892#true} call ULTIMATE.init(); {8892#true} is VALID [2022-04-08 11:01:32,759 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-08 11:01:32,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:32,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8892#true} {8892#true} #76#return; {8892#true} is VALID [2022-04-08 11:01:32,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {8892#true} call #t~ret6 := main(); {8892#true} is VALID [2022-04-08 11:01:32,760 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-08 11:01:32,760 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-08 11:01:32,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8892#true} {8892#true} #68#return; {8892#true} is VALID [2022-04-08 11:01:32,760 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-08 11:01:32,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:32,760 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-08 11:01:32,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-08 11:01:32,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-08 11:01:32,760 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-08 11:01:32,760 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-08 11:01:32,761 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-08 11:01:32,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:32,761 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-08 11:01:32,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-08 11:01:32,761 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-08 11:01:32,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:32,761 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-08 11:01:32,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L290 TraceCheckUtils]: 34: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-08 11:01:32,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-08 11:01:32,761 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-08 11:01:32,762 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-08 11:01:32,762 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-08 11:01:32,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:32,762 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-08 11:01:32,762 INFO L290 TraceCheckUtils]: 42: Hoare triple {8892#true} ~cond := #in~cond; {9023#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:01:32,762 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-08 11:01:32,762 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-08 11:01:34,765 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-08 11:01:34,767 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-08 11:01:34,768 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-08 11:01:34,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {9042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:01:34,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {9046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8893#false} is VALID [2022-04-08 11:01:34,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {8893#false} assume !false; {8893#false} is VALID [2022-04-08 11:01:34,769 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-08 11:01:34,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 11:01:49,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {8893#false} assume !false; {8893#false} is VALID [2022-04-08 11:01:49,390 INFO L290 TraceCheckUtils]: 49: Hoare triple {9046#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8893#false} is VALID [2022-04-08 11:01:49,390 INFO L290 TraceCheckUtils]: 48: Hoare triple {9042#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9046#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 11:01:49,391 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-08 11:01:49,392 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-08 11:01:49,393 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-08 11:01:49,393 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-08 11:01:49,393 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-08 11:01:49,394 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-08 11:01:49,394 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-08 11:01:49,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:49,394 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-08 11:01:49,394 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-08 11:01:49,394 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-08 11:01:49,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-08 11:01:49,394 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-08 11:01:49,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:49,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:49,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:49,394 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-08 11:01:49,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:49,395 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-08 11:01:49,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:49,395 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-08 11:01:49,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:49,395 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-08 11:01:49,395 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-08 11:01:49,395 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-08 11:01:49,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {8892#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8892#true} {8892#true} #70#return; {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:49,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:49,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:49,396 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-08 11:01:49,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {8892#true} assume !false; {8892#true} is VALID [2022-04-08 11:01:49,396 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-08 11:01:49,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8892#true} {8892#true} #68#return; {8892#true} is VALID [2022-04-08 11:01:49,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:49,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {8892#true} assume !(0 == ~cond); {8892#true} is VALID [2022-04-08 11:01:49,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {8892#true} ~cond := #in~cond; {8892#true} is VALID [2022-04-08 11:01:49,396 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-08 11:01:49,396 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-08 11:01:49,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {8892#true} call #t~ret6 := main(); {8892#true} is VALID [2022-04-08 11:01:49,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8892#true} {8892#true} #76#return; {8892#true} is VALID [2022-04-08 11:01:49,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {8892#true} assume true; {8892#true} is VALID [2022-04-08 11:01:49,396 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-08 11:01:49,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {8892#true} call ULTIMATE.init(); {8892#true} is VALID [2022-04-08 11:01:49,396 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-08 11:01:49,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 11:01:49,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406636434] [2022-04-08 11:01:49,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 11:01:49,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221146861] [2022-04-08 11:01:49,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221146861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 11:01:49,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 11:01:49,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 11:01:49,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 11:01:49,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997313430] [2022-04-08 11:01:49,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997313430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 11:01:49,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 11:01:49,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 11:01:49,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997928807] [2022-04-08 11:01:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 11:01:49,398 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-08 11:01:49,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 11:01:49,398 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-08 11:01:51,424 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-08 11:01:51,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 11:01:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 11:01:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 11:01:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 11:01:51,425 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-08 11:01:54,256 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-08 11:01:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:57,052 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-08 11:01:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 11:01:57,053 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-08 11:01:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 11:01:57,053 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-08 11:01:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-08 11:01:57,053 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-08 11:01:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-08 11:01:57,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-08 11:01:59,084 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-08 11:01:59,085 INFO L225 Difference]: With dead ends: 71 [2022-04-08 11:01:59,085 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 11:01:59,085 INFO L912 BasicCegarLoop]: 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-08 11:01:59,086 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-08 11:01:59,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-08 11:01:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 11:01:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 11:01:59,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 11:01:59,086 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-08 11:01:59,086 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-08 11:01:59,086 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-08 11:01:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:59,086 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:01:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:01:59,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:59,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:01:59,087 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-08 11:01:59,087 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-08 11:01:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 11:01:59,087 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 11:01:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:01:59,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:59,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 11:01:59,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 11:01:59,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 11:01:59,087 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-08 11:01:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 11:01:59,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-04-08 11:01:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 11:01:59,087 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 11:01:59,087 INFO L479 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-08 11:01:59,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 11:01:59,087 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-08 11:01:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 11:01:59,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 11:01:59,089 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 11:01:59,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 11:01:59,298 WARN L460 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-08 11:01:59,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 11:03:27,870 WARN L232 SmtUtils]: Spent 1.28m 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-08 11:03:38,042 WARN L232 SmtUtils]: Spent 10.16s 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-08 11:04:32,441 WARN L232 SmtUtils]: Spent 54.31s 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) [2022-04-08 11:05:19,146 WARN L232 SmtUtils]: Spent 46.70s on a formula simplification. DAG size of input: 120 DAG size of output: 32 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 11:05:37,970 WARN L232 SmtUtils]: Spent 18.81s 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-08 11:05:54,641 WARN L232 SmtUtils]: Spent 16.66s on a formula simplification. DAG size of input: 115 DAG size of output: 32 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 11:05:54,699 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 11:05:54,699 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 11:05:54,699 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 11:05:54,700 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 11:05:54,700 INFO L878 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-08 11:05:54,700 INFO L878 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 11:05:54,700 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-08 11:05:54,700 INFO L878 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (.cse1 (<= 1 main_~y~0))) (or (and .cse0 (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0) .cse1) (and .cse0 (<= 1 main_~b~0) .cse1))) [2022-04-08 11:05:54,700 INFO L878 garLoopResultBuilder]: At program point L33-1(lines 32 53) the Hoare annotation is: (let ((.cse1 (* main_~y~0 main_~x~0))) (let ((.cse0 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse1)) (.cse2 (<= 1 main_~y~0))) (or (and .cse0 (= main_~q~0 .cse1) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0) .cse2) (and .cse0 (= (mod (+ .cse1 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 main_~b~0) .cse2)))) [2022-04-08 11:05:54,700 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-08 11:05:54,700 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 58) the Hoare annotation is: true [2022-04-08 11:05:54,700 INFO L878 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (<= 1 main_~y~0) [2022-04-08 11:05:54,700 INFO L885 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: true [2022-04-08 11:05:54,700 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 58) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L42(lines 42 52) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0)) (<= 1 main_~b~0) (<= 1 main_~y~0))) [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L38(lines 38 52) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~x~0))) (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse0) (= (mod (+ .cse0 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0)) (<= 1 main_~b~0) (<= 1 main_~y~0))) [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 53) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 58) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 52) the Hoare annotation is: (let ((.cse1 (* main_~y~0 main_~x~0)) (.cse0 (not (= (mod main_~b~0 2) 0)))) (and (or .cse0 (not (= (mod main_~a~0 2) 0))) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) .cse1) (= (mod (+ .cse1 (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (or .cse0 (< main_~a~0 0)) (not (= main_~a~0 0)) (<= 1 main_~b~0) (<= 1 main_~y~0))) [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 32 53) the Hoare annotation is: (let ((.cse0 (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (.cse1 (<= 1 main_~y~0))) (or (and .cse0 (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0) .cse1) (and .cse0 (<= 1 main_~b~0) .cse1))) [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 11:05:54,701 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 11:05:54,702 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 11:05:54,702 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 11:05:54,704 INFO L719 BasicCegarLoop]: Path program histogram: [6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 11:05:54,705 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 11:05:54,707 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 11:05:54,709 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 11:05:56,765 INFO L163 areAnnotationChecker]: CFG has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 11:05:56,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 11:05:56 BoogieIcfgContainer [2022-04-08 11:05:56,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 11:05:56,777 INFO L158 Benchmark]: Toolchain (without parser) took 830277.91ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 152.8MB in the beginning and 98.5MB in the end (delta: 54.3MB). Peak memory consumption was 133.5MB. Max. memory is 8.0GB. [2022-04-08 11:05:56,777 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 169.2MB in the beginning and 169.0MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 11:05:56,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.91ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 152.7MB in the beginning and 240.8MB in the end (delta: -88.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 11:05:56,778 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 264.2MB. Free memory was 240.3MB in the beginning and 239.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 11:05:56,778 INFO L158 Benchmark]: RCFGBuilder took 280.67ms. Allocated memory is still 264.2MB. Free memory was 238.7MB in the beginning and 225.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 11:05:56,778 INFO L158 Benchmark]: TraceAbstraction took 829738.56ms. Allocated memory is still 264.2MB. Free memory was 225.1MB in the beginning and 98.5MB in the end (delta: 126.6MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2022-04-08 11:05:56,779 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 169.2MB in the beginning and 169.0MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.91ms. Allocated memory was 203.4MB in the beginning and 264.2MB in the end (delta: 60.8MB). Free memory was 152.7MB in the beginning and 240.8MB in the end (delta: -88.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 264.2MB. Free memory was 240.3MB in the beginning and 239.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 280.67ms. Allocated memory is still 264.2MB. Free memory was 238.7MB in the beginning and 225.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 829738.56ms. Allocated memory is still 264.2MB. Free memory was 225.1MB in the beginning and 98.5MB in the end (delta: 126.6MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 827.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 103.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 235.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 339 SdHoareTripleChecker+Valid, 42.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 1843 SdHoareTripleChecker+Invalid, 42.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1446 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2126 IncrementalHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 397 mSDtfsCounter, 2126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1100 GetRequests, 879 SyntacticMatches, 12 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=16, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 136 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 223 PreInvPairs, 346 NumberOfFragments, 392 HoareAnnotationTreeSize, 223 FomulaSimplifications, 72106 FormulaSimplificationTreeSizeReduction, 11.7s HoareSimplificationTime, 31 FomulaSimplificationsInter, 607260 FormulaSimplificationTreeSizeReductionInter, 223.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((q + b * a * p == y * x && !((a + 1) % 2 == 0)) && 0 <= b) && 1 <= y) || ((q + b * a * p == y * x && 1 <= b) && 1 <= y) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 11:05:56,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...