/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:12:33,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:12:33,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:12:33,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:12:33,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:12:33,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:12:33,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:12:33,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:12:33,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:12:33,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:12:33,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:12:33,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:12:33,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:12:33,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:12:33,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:12:33,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:12:33,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:12:33,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:12:33,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:12:33,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:12:33,256 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:12:33,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:12:33,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:12:33,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:12:33,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:12:33,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:12:33,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:12:33,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:12:33,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:12:33,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:12:33,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:12:33,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:12:33,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:12:33,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:12:33,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:12:33,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:12:33,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:12:33,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:12:33,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:12:33,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:12:33,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:12:33,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:12:33,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:12:33,282 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:12:33,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:12:33,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:12:33,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:12:33,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:12:33,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:12:33,284 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:12:33,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:12:33,286 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:12:33,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:12:33,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:12:33,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:12:33,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:12:33,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:12:33,287 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:12:33,287 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:12:33,287 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:12:33,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:12:33,287 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:12:33,287 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-15 07:12:33,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:12:33,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:12:33,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:12:33,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:12:33,509 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:12:33,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-15 07:12:33,580 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2194324/07c027b7defc444ea01b89e3d065f204/FLAGcfb843eba [2022-04-15 07:12:33,984 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:12:33,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-15 07:12:33,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2194324/07c027b7defc444ea01b89e3d065f204/FLAGcfb843eba [2022-04-15 07:12:34,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2194324/07c027b7defc444ea01b89e3d065f204 [2022-04-15 07:12:34,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:12:34,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:12:34,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:12:34,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:12:34,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:12:34,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648fcf84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34, skipping insertion in model container [2022-04-15 07:12:34,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:12:34,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:12:34,617 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/bresenham-ll.c[597,610] [2022-04-15 07:12:34,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:12:34,665 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:12:34,681 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/bresenham-ll.c[597,610] [2022-04-15 07:12:34,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:12:34,720 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:12:34,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34 WrapperNode [2022-04-15 07:12:34,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:12:34,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:12:34,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:12:34,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:12:34,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:12:34,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:12:34,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:12:34,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:12:34,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (1/1) ... [2022-04-15 07:12:34,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:12:34,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:34,794 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-15 07:12:34,796 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-15 07:12:34,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:12:34,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:12:34,823 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:12:34,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:12:34,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:12:34,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:12:34,823 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:12:34,823 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:12:34,823 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:12:34,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:12:34,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:12:34,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:12:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:12:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:12:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:12:34,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:12:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:12:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:12:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:12:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:12:34,892 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:12:34,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:12:35,050 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:12:35,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:12:35,058 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:12:35,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:12:35 BoogieIcfgContainer [2022-04-15 07:12:35,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:12:35,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:12:35,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:12:35,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:12:35,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:12:34" (1/3) ... [2022-04-15 07:12:35,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2c19a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:12:35, skipping insertion in model container [2022-04-15 07:12:35,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:12:34" (2/3) ... [2022-04-15 07:12:35,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2c19a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:12:35, skipping insertion in model container [2022-04-15 07:12:35,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:12:35" (3/3) ... [2022-04-15 07:12:35,068 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll.c [2022-04-15 07:12:35,073 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:12:35,074 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:12:35,115 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:12:35,122 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-15 07:12:35,122 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:12:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 07:12:35,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:35,154 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:35,154 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:35,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 1 times [2022-04-15 07:12:35,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:35,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1058099225] [2022-04-15 07:12:35,181 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:12:35,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 2 times [2022-04-15 07:12:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955524816] [2022-04-15 07:12:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:35,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:12:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243277241] [2022-04-15 07:12:35,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:35,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:35,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:35,339 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-15 07:12:35,347 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-15 07:12:35,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:12:35,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:35,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 07:12:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:35,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:35,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-15 07:12:35,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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(15, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 07:12:35,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 07:12:35,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #61#return; {27#true} is VALID [2022-04-15 07:12:35,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-15 07:12:35,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:35,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {51#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-15 07:12:35,792 INFO L272 TraceCheckUtils]: 7: Hoare triple {51#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {55#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:35,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {59#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:35,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28#false} is VALID [2022-04-15 07:12:35,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 07:12:35,797 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-15 07:12:35,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:12:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:35,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955524816] [2022-04-15 07:12:35,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:12:35,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243277241] [2022-04-15 07:12:35,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243277241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:35,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:35,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:12:35,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:35,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1058099225] [2022-04-15 07:12:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1058099225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:35,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:12:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163097274] [2022-04-15 07:12:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 07:12:35,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:35,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:35,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:35,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:12:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:12:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:12:35,890 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:36,264 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-04-15 07:12:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:12:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 07:12:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-15 07:12:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-15 07:12:36,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-15 07:12:36,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:36,359 INFO L225 Difference]: With dead ends: 55 [2022-04-15 07:12:36,360 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 07:12:36,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:12:36,366 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:36,367 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:12:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 07:12:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 07:12:36,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:36,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:36,401 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:36,402 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:36,405 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:12:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:12:36,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:36,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:36,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 07:12:36,407 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 07:12:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:36,410 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:12:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:12:36,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:36,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:36,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:36,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 07:12:36,414 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2022-04-15 07:12:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:36,415 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 07:12:36,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:12:36,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 07:12:36,442 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-15 07:12:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 07:12:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 07:12:36,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:36,443 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:36,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 07:12:36,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 07:12:36,660 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 1 times [2022-04-15 07:12:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [235494088] [2022-04-15 07:12:36,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:36,761 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:12:36,761 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:12:36,761 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 2 times [2022-04-15 07:12:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:36,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439051754] [2022-04-15 07:12:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:36,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:12:36,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048845537] [2022-04-15 07:12:36,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:36,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:36,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:36,778 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-15 07:12:36,807 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-15 07:12:36,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:36,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:36,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 07:12:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:36,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:37,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-15 07:12:37,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#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(15, 2);call #Ultimate.allocInit(12, 3); {285#true} is VALID [2022-04-15 07:12:37,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-15 07:12:37,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #61#return; {285#true} is VALID [2022-04-15 07:12:37,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret8 := main(); {285#true} is VALID [2022-04-15 07:12:37,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:37,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:37,082 INFO L272 TraceCheckUtils]: 7: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {285#true} is VALID [2022-04-15 07:12:37,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} ~cond := #in~cond; {285#true} is VALID [2022-04-15 07:12:37,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume !(0 == ~cond); {285#true} is VALID [2022-04-15 07:12:37,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-15 07:12:37,084 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {285#true} {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #57#return; {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:37,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:37,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {330#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:12:37,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {330#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {334#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-15 07:12:37,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {334#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {338#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:12:37,091 INFO L272 TraceCheckUtils]: 16: Hoare triple {338#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:37,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:37,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-15 07:12:37,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-15 07:12:37,094 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-15 07:12:37,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:12:37,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-15 07:12:37,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-15 07:12:37,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:37,329 INFO L272 TraceCheckUtils]: 16: Hoare triple {362#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:37,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {362#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:12:37,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:37,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {370#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:12:37,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:37,336 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {285#true} {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #57#return; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:37,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-15 07:12:37,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume !(0 == ~cond); {285#true} is VALID [2022-04-15 07:12:37,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} ~cond := #in~cond; {285#true} is VALID [2022-04-15 07:12:37,337 INFO L272 TraceCheckUtils]: 7: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {285#true} is VALID [2022-04-15 07:12:37,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:37,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:37,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret8 := main(); {285#true} is VALID [2022-04-15 07:12:37,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #61#return; {285#true} is VALID [2022-04-15 07:12:37,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-15 07:12:37,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#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(15, 2);call #Ultimate.allocInit(12, 3); {285#true} is VALID [2022-04-15 07:12:37,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-15 07:12:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:12:37,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:37,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439051754] [2022-04-15 07:12:37,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:12:37,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048845537] [2022-04-15 07:12:37,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048845537] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:12:37,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:12:37,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-15 07:12:37,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:37,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [235494088] [2022-04-15 07:12:37,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [235494088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:37,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:37,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:12:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560689243] [2022-04-15 07:12:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:12:37,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:37,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:37,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:37,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:12:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:12:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:12:37,375 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:37,806 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 07:12:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:12:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:12:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 07:12:37,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 07:12:37,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 07:12:37,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:37,866 INFO L225 Difference]: With dead ends: 40 [2022-04-15 07:12:37,866 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 07:12:37,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:12:37,868 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:37,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:12:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 07:12:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 07:12:37,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:37,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:37,885 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:37,885 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:37,888 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 07:12:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 07:12:37,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:37,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:37,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-15 07:12:37,889 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-15 07:12:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:37,892 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 07:12:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 07:12:37,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:37,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:37,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:37,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 07:12:37,895 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2022-04-15 07:12:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:37,896 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 07:12:37,896 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:37,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 07:12:37,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 07:12:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 07:12:37,935 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:37,936 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:37,956 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-15 07:12:38,147 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,SelfDestructingSolverStorable1 [2022-04-15 07:12:38,148 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607563, now seen corresponding path program 1 times [2022-04-15 07:12:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [162750457] [2022-04-15 07:12:38,236 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:38,237 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:12:38,237 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:12:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607563, now seen corresponding path program 2 times [2022-04-15 07:12:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:38,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178731566] [2022-04-15 07:12:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:38,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:12:38,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529348395] [2022-04-15 07:12:38,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:38,272 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-15 07:12:38,279 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-15 07:12:38,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:38,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:38,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 07:12:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:38,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:38,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2022-04-15 07:12:38,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#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(15, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-04-15 07:12:38,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-15 07:12:38,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #61#return; {641#true} is VALID [2022-04-15 07:12:38,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2022-04-15 07:12:38,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:12:38,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:12:38,518 INFO L272 TraceCheckUtils]: 7: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {641#true} is VALID [2022-04-15 07:12:38,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} ~cond := #in~cond; {641#true} is VALID [2022-04-15 07:12:38,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(0 == ~cond); {641#true} is VALID [2022-04-15 07:12:38,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-15 07:12:38,520 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {641#true} {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #57#return; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:12:38,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-15 07:12:38,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {686#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:12:38,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {690#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-15 07:12:38,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {690#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {694#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:12:38,524 INFO L272 TraceCheckUtils]: 16: Hoare triple {694#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:38,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:38,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {642#false} is VALID [2022-04-15 07:12:38,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-04-15 07:12:38,526 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-15 07:12:38,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:12:38,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-04-15 07:12:38,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {642#false} is VALID [2022-04-15 07:12:38,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:38,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {718#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:38,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {718#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:12:38,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:38,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {726#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:12:38,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:38,795 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {641#true} {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #57#return; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:38,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-15 07:12:38,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(0 == ~cond); {641#true} is VALID [2022-04-15 07:12:38,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} ~cond := #in~cond; {641#true} is VALID [2022-04-15 07:12:38,796 INFO L272 TraceCheckUtils]: 7: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {641#true} is VALID [2022-04-15 07:12:38,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:38,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:38,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2022-04-15 07:12:38,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #61#return; {641#true} is VALID [2022-04-15 07:12:38,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-15 07:12:38,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#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(15, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-04-15 07:12:38,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2022-04-15 07:12:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:12:38,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178731566] [2022-04-15 07:12:38,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:12:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529348395] [2022-04-15 07:12:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529348395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:12:38,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:12:38,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-15 07:12:38,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [162750457] [2022-04-15 07:12:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [162750457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:38,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:38,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:12:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010351196] [2022-04-15 07:12:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:38,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:12:38,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:38,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:38,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:38,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:12:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:12:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:12:38,828 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:39,223 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-15 07:12:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:12:39,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 07:12:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 07:12:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-15 07:12:39,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-15 07:12:39,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:39,283 INFO L225 Difference]: With dead ends: 48 [2022-04-15 07:12:39,283 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 07:12:39,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:12:39,284 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:39,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:12:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 07:12:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-04-15 07:12:39,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:39,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:12:39,303 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:12:39,304 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:12:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:39,306 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 07:12:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 07:12:39,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:39,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:39,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 07:12:39,308 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 07:12:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:39,310 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 07:12:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 07:12:39,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:39,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:39,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:39,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:12:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-15 07:12:39,314 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2022-04-15 07:12:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:39,314 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-15 07:12:39,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:12:39,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-15 07:12:39,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-15 07:12:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 07:12:39,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:39,356 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] [2022-04-15 07:12:39,375 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-15 07:12:39,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:39,564 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 1 times [2022-04-15 07:12:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568307983] [2022-04-15 07:12:39,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:39,644 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:12:39,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:12:39,644 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 2 times [2022-04-15 07:12:39,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:39,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681180897] [2022-04-15 07:12:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:39,660 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:12:39,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163504224] [2022-04-15 07:12:39,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:12:39,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:39,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:39,662 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-15 07:12:39,695 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-15 07:12:39,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:12:39,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:39,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 07:12:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:39,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:40,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2022-04-15 07:12:40,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#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(15, 2);call #Ultimate.allocInit(12, 3); {1047#true} is VALID [2022-04-15 07:12:40,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-15 07:12:40,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2022-04-15 07:12:40,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret8 := main(); {1047#true} is VALID [2022-04-15 07:12:40,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {1047#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:40,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:40,309 INFO L272 TraceCheckUtils]: 7: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-15 07:12:40,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#true} ~cond := #in~cond; {1047#true} is VALID [2022-04-15 07:12:40,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !(0 == ~cond); {1047#true} is VALID [2022-04-15 07:12:40,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-15 07:12:40,311 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1047#true} {1067#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:40,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1089#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:12:40,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1093#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-15 07:12:40,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1097#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:12:40,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:12:40,317 INFO L272 TraceCheckUtils]: 16: Hoare triple {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-15 07:12:40,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {1047#true} ~cond := #in~cond; {1108#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:40,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {1108#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:12:40,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:12:40,321 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #57#return; {1119#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:12:40,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {1123#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-15 07:12:40,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1127#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:12:40,326 INFO L272 TraceCheckUtils]: 23: Hoare triple {1127#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:40,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:40,327 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1048#false} is VALID [2022-04-15 07:12:40,327 INFO L290 TraceCheckUtils]: 26: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2022-04-15 07:12:40,328 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-15 07:12:40,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:12:41,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2022-04-15 07:12:41,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1048#false} is VALID [2022-04-15 07:12:41,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:12:41,133 INFO L272 TraceCheckUtils]: 23: Hoare triple {1151#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:12:41,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {1155#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1151#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:12:41,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {1159#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1155#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:12:41,150 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} {1163#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #57#return; {1159#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:12:41,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:12:41,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {1173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:12:41,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {1047#true} ~cond := #in~cond; {1173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:12:41,152 INFO L272 TraceCheckUtils]: 16: Hoare triple {1163#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-15 07:12:41,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1163#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:12:41,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {1184#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1180#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-15 07:12:41,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1184#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} is VALID [2022-04-15 07:12:41,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {1047#true} assume !!(~x~0 <= ~X~0); {1188#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:12:41,160 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1047#true} {1047#true} #57#return; {1047#true} is VALID [2022-04-15 07:12:41,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-15 07:12:41,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !(0 == ~cond); {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#true} ~cond := #in~cond; {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L272 TraceCheckUtils]: 7: Hoare triple {1047#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1047#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1047#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret8 := main(); {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#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(15, 2);call #Ultimate.allocInit(12, 3); {1047#true} is VALID [2022-04-15 07:12:41,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2022-04-15 07:12:41,162 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-15 07:12:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:41,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681180897] [2022-04-15 07:12:41,162 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:12:41,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163504224] [2022-04-15 07:12:41,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163504224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:12:41,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:12:41,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-15 07:12:41,163 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:41,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568307983] [2022-04-15 07:12:41,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568307983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:41,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:41,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:12:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890210234] [2022-04-15 07:12:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-15 07:12:41,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:41,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:41,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:41,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:12:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:12:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:12:41,202 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:41,899 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 07:12:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:12:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-15 07:12:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-15 07:12:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-15 07:12:41,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2022-04-15 07:12:41,954 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-15 07:12:41,956 INFO L225 Difference]: With dead ends: 53 [2022-04-15 07:12:41,957 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 07:12:41,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:12:41,958 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:41,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 99 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:12:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 07:12:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-04-15 07:12:42,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:42,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:42,012 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:42,013 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:42,015 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 07:12:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 07:12:42,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:42,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:42,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-15 07:12:42,016 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-15 07:12:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:42,018 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 07:12:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 07:12:42,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:42,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:42,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:42,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:12:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 07:12:42,021 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2022-04-15 07:12:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:42,021 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 07:12:42,022 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:12:42,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 07:12:42,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 07:12:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 07:12:42,080 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:42,080 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:42,107 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-15 07:12:42,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:42,281 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1671149437, now seen corresponding path program 3 times [2022-04-15 07:12:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:42,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839621898] [2022-04-15 07:12:42,348 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:42,348 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:12:42,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:12:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1671149437, now seen corresponding path program 4 times [2022-04-15 07:12:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:42,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000587807] [2022-04-15 07:12:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:42,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:12:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546807920] [2022-04-15 07:12:42,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:12:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:12:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:12:42,366 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-15 07:12:42,389 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-15 07:12:42,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:12:42,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:12:42,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 07:12:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:42,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:12:51,250 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:12:54,756 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:13:08,364 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:13:47,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2022-04-15 07:13:47,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#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(15, 2);call #Ultimate.allocInit(12, 3); {1506#true} is VALID [2022-04-15 07:13:47,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-15 07:13:47,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #61#return; {1506#true} is VALID [2022-04-15 07:13:47,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret8 := main(); {1506#true} is VALID [2022-04-15 07:13:47,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1506#true} is VALID [2022-04-15 07:13:47,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:13:47,667 INFO L272 TraceCheckUtils]: 7: Hoare triple {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-15 07:13:47,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} ~cond := #in~cond; {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:47,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:47,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:47,670 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:47,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:47,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-15 07:13:47,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:47,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1561#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:13:47,675 INFO L272 TraceCheckUtils]: 16: Hoare triple {1561#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-15 07:13:47,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} ~cond := #in~cond; {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:47,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:47,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:47,677 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1561#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:47,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:47,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-15 07:13:47,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:49,683 WARN L290 TraceCheckUtils]: 24: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1589#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0)))) (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod main_~yx~0 main_~Y~0) 0) (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) (+ (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 2))) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-15 07:13:49,691 INFO L272 TraceCheckUtils]: 25: Hoare triple {1589#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0)))) (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod main_~yx~0 main_~Y~0) 0) (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) (+ (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 2))) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:49,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:49,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {1597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1507#false} is VALID [2022-04-15 07:13:49,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-04-15 07:13:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:13:49,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:13:51,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-04-15 07:13:51,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {1597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1507#false} is VALID [2022-04-15 07:13:51,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:13:51,292 INFO L272 TraceCheckUtils]: 25: Hoare triple {1613#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:13:51,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1613#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:13:51,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:51,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-15 07:13:51,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:51,297 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1629#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #57#return; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:13:51,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:51,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1639#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:13:51,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} ~cond := #in~cond; {1639#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:13:51,299 INFO L272 TraceCheckUtils]: 16: Hoare triple {1629#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-15 07:13:51,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1629#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-15 07:13:51,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {1506#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1506#true} is VALID [2022-04-15 07:13:51,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {1506#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1506#true} is VALID [2022-04-15 07:13:51,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {1506#true} assume !!(~x~0 <= ~X~0); {1506#true} is VALID [2022-04-15 07:13:51,300 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1506#true} {1506#true} #57#return; {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#true} assume !(0 == ~cond); {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} ~cond := #in~cond; {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L272 TraceCheckUtils]: 7: Hoare triple {1506#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1506#true} is VALID [2022-04-15 07:13:51,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret8 := main(); {1506#true} is VALID [2022-04-15 07:13:51,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #61#return; {1506#true} is VALID [2022-04-15 07:13:51,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-15 07:13:51,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#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(15, 2);call #Ultimate.allocInit(12, 3); {1506#true} is VALID [2022-04-15 07:13:51,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2022-04-15 07:13:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:13:51,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:51,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000587807] [2022-04-15 07:13:51,303 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:13:51,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546807920] [2022-04-15 07:13:51,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546807920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:13:51,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:13:51,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2022-04-15 07:13:51,303 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:51,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839621898] [2022-04-15 07:13:51,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839621898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:51,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:51,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:13:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196798292] [2022-04-15 07:13:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:51,304 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-15 07:13:51,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:51,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:13:53,339 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-15 07:13:53,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:13:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:13:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-04-15 07:13:53,340 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:14:27,766 WARN L232 SmtUtils]: Spent 34.31s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 07:14:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:27,975 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 07:14:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:14:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-15 07:14:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:14:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-15 07:14:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:14:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-15 07:14:27,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-15 07:14:30,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:30,064 INFO L225 Difference]: With dead ends: 41 [2022-04-15 07:14:30,065 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 07:14:30,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2022-04-15 07:14:30,066 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:30,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-04-15 07:14:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 07:14:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 07:14:30,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:30,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:14:30,090 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:14:30,090 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:14:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:30,092 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 07:14:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 07:14:30,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:30,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:30,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-15 07:14:30,093 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-15 07:14:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:30,095 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 07:14:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 07:14:30,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:30,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:30,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:30,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:14:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 07:14:30,097 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 29 [2022-04-15 07:14:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:30,097 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 07:14:30,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:14:30,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 07:14:32,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 07:14:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 07:14:32,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:32,218 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] [2022-04-15 07:14:32,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 07:14:32,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:14:32,419 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:32,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 1 times [2022-04-15 07:14:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:32,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480043775] [2022-04-15 07:14:32,469 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:32,470 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:14:32,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:14:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 2 times [2022-04-15 07:14:32,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:32,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169792046] [2022-04-15 07:14:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:32,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:32,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:14:32,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476040332] [2022-04-15 07:14:32,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:14:32,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:14:32,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:14:32,483 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-15 07:14:32,490 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-15 07:14:32,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:14:32,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:14:32,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 07:14:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:32,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:14:45,239 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:14:55,259 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:15:14,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-15 07:15:14,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#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(15, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-15 07:15:14,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 07:15:14,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #61#return; {1929#true} is VALID [2022-04-15 07:15:14,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret8 := main(); {1929#true} is VALID [2022-04-15 07:15:14,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,239 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-15 07:15:14,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-15 07:15:14,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-15 07:15:14,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 07:15:14,241 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,243 INFO L272 TraceCheckUtils]: 16: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-15 07:15:14,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-15 07:15:14,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-15 07:15:14,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 07:15:14,244 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:14,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:15:14,246 INFO L272 TraceCheckUtils]: 25: Hoare triple {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-15 07:15:14,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {1929#true} ~cond := #in~cond; {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:15:14,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:15:14,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:15:14,249 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:15:14,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !(~x~0 <= ~X~0); {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:15:16,253 WARN L290 TraceCheckUtils]: 31: Hoare triple {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2032#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is UNKNOWN [2022-04-15 07:15:16,255 INFO L272 TraceCheckUtils]: 32: Hoare triple {2032#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:15:16,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:15:16,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1930#false} is VALID [2022-04-15 07:15:16,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-15 07:15:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:15:16,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:15:21,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-15 07:15:21,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1930#false} is VALID [2022-04-15 07:15:21,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:15:21,060 INFO L272 TraceCheckUtils]: 32: Hoare triple {2056#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:15:21,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2056#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:15:21,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} assume !(~x~0 <= ~X~0); {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:15:21,063 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2067#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #57#return; {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:15:21,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:15:21,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {2077#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:15:21,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {1929#true} ~cond := #in~cond; {2077#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:15:21,064 INFO L272 TraceCheckUtils]: 25: Hoare triple {2067#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-15 07:15:21,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2067#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:15:21,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,071 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 07:15:21,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-15 07:15:21,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-15 07:15:21,072 INFO L272 TraceCheckUtils]: 16: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-15 07:15:21,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,077 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 07:15:21,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-15 07:15:21,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-15 07:15:21,078 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-15 07:15:21,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1949#(= main_~y~0 0)} is VALID [2022-04-15 07:15:21,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret8 := main(); {1929#true} is VALID [2022-04-15 07:15:21,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #61#return; {1929#true} is VALID [2022-04-15 07:15:21,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-15 07:15:21,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#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(15, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-15 07:15:21,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-15 07:15:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:15:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169792046] [2022-04-15 07:15:21,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:15:21,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476040332] [2022-04-15 07:15:21,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476040332] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:15:21,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:15:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 07:15:21,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:21,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480043775] [2022-04-15 07:15:21,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480043775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:21,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:21,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:15:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798512737] [2022-04-15 07:15:21,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-15 07:15:21,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:21,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:15:23,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:23,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:15:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:15:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:15:23,108 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:15:25,149 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-15 07:15:29,244 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-15 07:15:31,257 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-15 07:15:35,424 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-15 07:15:37,477 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-15 07:15:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:39,810 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 07:15:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:15:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-15 07:15:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:15:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 07:15:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:15:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 07:15:39,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-15 07:15:41,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:41,864 INFO L225 Difference]: With dead ends: 52 [2022-04-15 07:15:41,864 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 07:15:41,865 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2022-04-15 07:15:41,866 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:41,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 5 Unknown, 0 Unchecked, 10.2s Time] [2022-04-15 07:15:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 07:15:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-15 07:15:41,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:41,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 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-15 07:15:41,891 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 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-15 07:15:41,893 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 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-15 07:15:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:41,895 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 07:15:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 07:15:41,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:41,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:41,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 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 46 states. [2022-04-15 07:15:41,896 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 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 46 states. [2022-04-15 07:15:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:41,898 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-15 07:15:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 07:15:41,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:41,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:41,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:41,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 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-15 07:15:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-15 07:15:41,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2022-04-15 07:15:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:41,901 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-15 07:15:41,902 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 07:15:41,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-15 07:15:46,036 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-15 07:15:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-15 07:15:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 07:15:46,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:46,037 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:46,056 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-15 07:15:46,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:46,240 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1189350692, now seen corresponding path program 1 times [2022-04-15 07:15:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:46,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046935208] [2022-04-15 07:15:46,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:15:46,330 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:15:46,330 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:15:46,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1189350692, now seen corresponding path program 2 times [2022-04-15 07:15:46,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:46,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947508311] [2022-04-15 07:15:46,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:46,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:46,356 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:15:46,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1334972387] [2022-04-15 07:15:46,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:15:46,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:46,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:15:46,358 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-15 07:15:46,373 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-15 07:15:46,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:15:46,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:15:46,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:15:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:46,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:15:47,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2022-04-15 07:15:47,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#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(15, 2);call #Ultimate.allocInit(12, 3); {2452#true} is VALID [2022-04-15 07:15:47,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #61#return; {2452#true} is VALID [2022-04-15 07:15:47,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret8 := main(); {2452#true} is VALID [2022-04-15 07:15:47,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {2452#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:15:47,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:15:47,298 INFO L272 TraceCheckUtils]: 7: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-15 07:15:47,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-15 07:15:47,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-15 07:15:47,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,298 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #57#return; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:15:47,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-15 07:15:47,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2497#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:15:47,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {2497#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:15:47,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:15:47,302 INFO L272 TraceCheckUtils]: 16: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-15 07:15:47,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-15 07:15:47,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-15 07:15:47,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,303 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2452#true} {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #57#return; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:15:47,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-15 07:15:47,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2526#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:15:47,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:15:47,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:15:47,307 INFO L272 TraceCheckUtils]: 25: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-15 07:15:47,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-15 07:15:47,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-15 07:15:47,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,309 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2452#true} {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #57#return; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-15 07:15:47,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {2453#false} is VALID [2022-04-15 07:15:47,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {2453#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2453#false} is VALID [2022-04-15 07:15:47,310 INFO L272 TraceCheckUtils]: 32: Hoare triple {2453#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2453#false} is VALID [2022-04-15 07:15:47,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2022-04-15 07:15:47,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2022-04-15 07:15:47,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-04-15 07:15:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 07:15:47,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:15:47,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-04-15 07:15:47,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2022-04-15 07:15:47,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2022-04-15 07:15:47,624 INFO L272 TraceCheckUtils]: 32: Hoare triple {2453#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2453#false} is VALID [2022-04-15 07:15:47,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {2453#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2453#false} is VALID [2022-04-15 07:15:47,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {2582#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {2453#false} is VALID [2022-04-15 07:15:47,625 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2452#true} {2582#(<= main_~x~0 main_~X~0)} #57#return; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:15:47,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-15 07:15:47,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-15 07:15:47,625 INFO L272 TraceCheckUtils]: 25: Hoare triple {2582#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-15 07:15:47,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {2582#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:15:47,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-15 07:15:47,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2604#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-15 07:15:47,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:15:47,629 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2452#true} {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #57#return; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:15:47,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-15 07:15:47,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-15 07:15:47,630 INFO L272 TraceCheckUtils]: 16: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-15 07:15:47,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:15:47,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {2633#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:15:47,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2633#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-15 07:15:47,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:15:47,634 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #57#return; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:15:47,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-15 07:15:47,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-15 07:15:47,634 INFO L272 TraceCheckUtils]: 7: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-15 07:15:47,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:15:47,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {2452#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~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;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-15 07:15:47,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret8 := main(); {2452#true} is VALID [2022-04-15 07:15:47,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #61#return; {2452#true} is VALID [2022-04-15 07:15:47,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-15 07:15:47,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#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(15, 2);call #Ultimate.allocInit(12, 3); {2452#true} is VALID [2022-04-15 07:15:47,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2022-04-15 07:15:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 07:15:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947508311] [2022-04-15 07:15:47,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:15:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334972387] [2022-04-15 07:15:47,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334972387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:15:47,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:15:47,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 07:15:47,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:47,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046935208] [2022-04-15 07:15:47,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046935208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:47,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:47,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:15:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169435139] [2022-04-15 07:15:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-15 07:15:47,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:47,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:15:47,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:47,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:15:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:15:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:15:47,672 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:15:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:47,993 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-15 07:15:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:15:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-15 07:15:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:15:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 07:15:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:15:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 07:15:47,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-15 07:15:48,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:48,045 INFO L225 Difference]: With dead ends: 59 [2022-04-15 07:15:48,045 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 07:15:48,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:15:48,046 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:48,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:15:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 07:15:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-04-15 07:15:48,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:48,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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-15 07:15:48,094 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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-15 07:15:48,094 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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-15 07:15:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:48,096 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 07:15:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 07:15:48,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:48,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:48,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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 53 states. [2022-04-15 07:15:48,097 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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 53 states. [2022-04-15 07:15:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:48,100 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 07:15:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 07:15:48,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:48,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:48,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:48,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 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-15 07:15:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-15 07:15:48,103 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 36 [2022-04-15 07:15:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:48,103 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-15 07:15:48,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:15:48,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 57 transitions. [2022-04-15 07:15:54,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 54 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-15 07:15:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 07:15:54,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:54,295 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:54,312 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-15 07:15:54,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:54,496 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:54,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 3 times [2022-04-15 07:15:54,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:54,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [548655184] [2022-04-15 07:15:54,603 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:15:54,604 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:15:54,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:15:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 4 times [2022-04-15 07:15:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203818651] [2022-04-15 07:15:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:54,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:15:54,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245587210] [2022-04-15 07:15:54,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:15:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:15:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:15:54,620 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-15 07:15:54,644 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-15 07:15:55,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:15:55,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:15:55,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 07:15:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:55,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:16:12,791 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:16:17,418 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:16:22,119 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:16:26,206 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~X~0 1)) (.cse2 (+ (* (- 1) c_main_~Y~0) (div (+ c_main_~v~0 c_main_~X~0) 2) (* c_main_~X~0 c_main_~y~0))) (.cse0 (= c_main_~Y~0 0)) (.cse4 (= (mod (+ (* 2 c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2) 0))) (or (let ((.cse1 (div .cse2 c_main_~Y~0))) (and (not .cse0) (not (<= .cse1 c_main_~X~0)) (= (mod .cse2 c_main_~Y~0) 0) (= c_main_~xy~0 (* c_main_~y~0 .cse1)) (<= .cse1 .cse3) (= c_main_~yx~0 (* c_main_~Y~0 .cse1)) .cse4)) (and (let ((.cse6 (= c_main_~y~0 0))) (or (let ((.cse5 (div c_main_~xy~0 c_main_~y~0))) (and (<= .cse5 .cse3) (= (mod c_main_~xy~0 c_main_~y~0) 0) (not .cse6) (< c_main_~X~0 .cse5))) (and .cse6 (= c_main_~xy~0 0)))) (= 0 .cse2) .cse0 (= c_main_~yx~0 0) .cse4))) is different from false