/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:48:16,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:48:16,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:48:16,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:48:16,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:48:16,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:48:16,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:48:16,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:48:16,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:48:16,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:48:16,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:48:16,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:48:16,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:48:16,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:48:16,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:48:16,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:48:16,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:48:16,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:48:16,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:48:16,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:48:16,271 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:48:16,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:48:16,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:48:16,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:48:16,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:48:16,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:48:16,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:48:16,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:48:16,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:48:16,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:48:16,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:48:16,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:48:16,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:48:16,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:48:16,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:48:16,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:48:16,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:48:16,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:48:16,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:48:16,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:48:16,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:48:16,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:48:16,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:48:16,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:48:16,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:48:16,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:48:16,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:48:16,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:48:16,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:48:16,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:48:16,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:48:16,320 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:48:16,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:48:16,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:48:16,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:48:16,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:48:16,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:48:16,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:48:16,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:48:16,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:48:16,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:48:16,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:48:16,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:48:16,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:48:16,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:48:16,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:48:16,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:48:16,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:48:16,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:48:16,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:48:16,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:48:16,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:48:16,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:48:16,324 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:48:16,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:48:16,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:48:16,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 12:48:16,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:48:16,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:48:16,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:48:16,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:48:16,535 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:48:16,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-07 12:48:16,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf3eb170/a4555a0837b94a89bee6088ebfa18bd2/FLAG0bdc163c6 [2022-04-07 12:48:16,954 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:48:16,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-07 12:48:16,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf3eb170/a4555a0837b94a89bee6088ebfa18bd2/FLAG0bdc163c6 [2022-04-07 12:48:16,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf3eb170/a4555a0837b94a89bee6088ebfa18bd2 [2022-04-07 12:48:16,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:48:16,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:48:16,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:48:16,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:48:16,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:48:16,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:48:16" (1/1) ... [2022-04-07 12:48:16,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4221e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:16, skipping insertion in model container [2022-04-07 12:48:16,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:48:16" (1/1) ... [2022-04-07 12:48:16,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:48:16,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:48:17,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c[597,610] [2022-04-07 12:48:17,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:48:17,194 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:48:17,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c[597,610] [2022-04-07 12:48:17,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:48:17,235 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:48:17,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17 WrapperNode [2022-04-07 12:48:17,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:48:17,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:48:17,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:48:17,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:48:17,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:48:17,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:48:17,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:48:17,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:48:17,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (1/1) ... [2022-04-07 12:48:17,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:48:17,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:48:17,304 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-07 12:48:17,320 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-07 12:48:17,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:48:17,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:48:17,335 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:48:17,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:48:17,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:48:17,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:48:17,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:48:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:48:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:48:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:48:17,381 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:48:17,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:48:17,565 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:48:17,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:48:17,569 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:48:17,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:48:17 BoogieIcfgContainer [2022-04-07 12:48:17,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:48:17,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:48:17,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:48:17,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:48:17,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:48:16" (1/3) ... [2022-04-07 12:48:17,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a060612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:48:17, skipping insertion in model container [2022-04-07 12:48:17,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:48:17" (2/3) ... [2022-04-07 12:48:17,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a060612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:48:17, skipping insertion in model container [2022-04-07 12:48:17,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:48:17" (3/3) ... [2022-04-07 12:48:17,590 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2022-04-07 12:48:17,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:48:17,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:48:17,634 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:48:17,640 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:48:17,640 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:48:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:48:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 12:48:17,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:48:17,661 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:48:17,662 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:48:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:48:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-07 12:48:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:48:17,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728343735] [2022-04-07 12:48:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:48:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:48:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:48:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:17,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 12:48:17,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 12:48:17,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-07 12:48:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 12:48:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:17,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 12:48:17,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 12:48:17,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 12:48:17,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 12:48:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 12:48:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:17,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 12:48:17,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 12:48:17,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 12:48:17,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 12:48:17,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:48:17,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 12:48:17,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 12:48:17,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-07 12:48:17,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-07 12:48:17,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2022-04-07 12:48:17,871 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 12:48:17,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 12:48:17,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 12:48:17,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 12:48:17,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 12:48:17,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-07 12:48:17,872 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 12:48:17,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 12:48:17,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 12:48:17,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 12:48:17,873 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 12:48:17,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-07 12:48:17,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-07 12:48:17,873 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-07 12:48:17,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-07 12:48:17,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-07 12:48:17,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 12:48:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:48:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:48:17,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728343735] [2022-04-07 12:48:17,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728343735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:48:17,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:48:17,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:48:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738432464] [2022-04-07 12:48:17,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:48:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 12:48:17,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:48:17,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:48:17,910 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-07 12:48:17,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:48:17,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:48:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:48:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:48:17,926 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:48:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:48:18,020 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-07 12:48:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:48:18,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 12:48:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:48:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:48:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-07 12:48:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:48:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-07 12:48:18,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-07 12:48:18,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:48:18,138 INFO L225 Difference]: With dead ends: 57 [2022-04-07 12:48:18,138 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 12:48:18,140 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:48:18,142 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:48:18,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:48:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 12:48:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 12:48:18,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:48:18,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:48:18,174 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:48:18,175 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:48:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:48:18,178 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-07 12:48:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-07 12:48:18,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:48:18,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:48:18,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-07 12:48:18,179 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-07 12:48:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:48:18,182 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-07 12:48:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-07 12:48:18,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:48:18,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:48:18,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:48:18,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:48:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:48:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-07 12:48:18,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-07 12:48:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:48:18,186 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-07 12:48:18,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 12:48:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-07 12:48:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 12:48:18,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:48:18,187 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:48:18,188 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:48:18,188 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:48:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:48:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-07 12:48:18,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:48:18,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633850390] [2022-04-07 12:48:18,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:48:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:48:18,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:48:18,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096800769] [2022-04-07 12:48:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:48:18,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:48:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:48:18,222 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-07 12:48:18,223 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-07 12:48:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:18,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:48:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:18,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:48:18,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2022-04-07 12:48:18,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#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); {217#true} is VALID [2022-04-07 12:48:18,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-07 12:48:18,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {217#true} {217#true} #69#return; {217#true} is VALID [2022-04-07 12:48:18,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {217#true} call #t~ret8 := main(); {217#true} is VALID [2022-04-07 12:48:18,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#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; {217#true} is VALID [2022-04-07 12:48:18,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {217#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {217#true} is VALID [2022-04-07 12:48:18,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#true} ~cond := #in~cond; {217#true} is VALID [2022-04-07 12:48:18,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#true} assume !(0 == ~cond); {217#true} is VALID [2022-04-07 12:48:18,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-07 12:48:18,449 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {217#true} {217#true} #61#return; {217#true} is VALID [2022-04-07 12:48:18,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {217#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {217#true} is VALID [2022-04-07 12:48:18,449 INFO L272 TraceCheckUtils]: 12: Hoare triple {217#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {217#true} is VALID [2022-04-07 12:48:18,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#true} ~cond := #in~cond; {217#true} is VALID [2022-04-07 12:48:18,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#true} assume !(0 == ~cond); {217#true} is VALID [2022-04-07 12:48:18,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#true} assume true; {217#true} is VALID [2022-04-07 12:48:18,450 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {217#true} {217#true} #63#return; {217#true} is VALID [2022-04-07 12:48:18,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {217#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {273#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-07 12:48:18,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {273#(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; {277#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-07 12:48:18,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {277#(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)); {281#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:48:18,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {281#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {285#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:48:18,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {218#false} is VALID [2022-04-07 12:48:18,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-07 12:48:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:48:18,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:48:18,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:48:18,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633850390] [2022-04-07 12:48:18,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:48:18,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096800769] [2022-04-07 12:48:18,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096800769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:48:18,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:48:18,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:48:18,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242524881] [2022-04-07 12:48:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:48:18,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-07 12:48:18,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:48:18,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 12:48:18,469 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-07 12:48:18,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:48:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:48:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:48:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:48:18,470 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 12:48:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:48:18,648 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-07 12:48:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:48:18,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-07 12:48:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:48:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 12:48:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-07 12:48:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 12:48:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-07 12:48:18,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-07 12:48:18,695 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-07 12:48:18,697 INFO L225 Difference]: With dead ends: 39 [2022-04-07 12:48:18,697 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 12:48:18,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:48:18,699 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:48:18,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:48:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 12:48:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 12:48:18,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:48:18,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:48:18,706 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:48:18,707 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:48:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:48:18,709 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-07 12:48:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-07 12:48:18,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:48:18,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:48:18,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-07 12:48:18,710 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-07 12:48:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:48:18,712 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-07 12:48:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-07 12:48:18,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:48:18,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:48:18,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:48:18,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:48:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:48:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-07 12:48:18,715 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-07 12:48:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:48:18,715 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-07 12:48:18,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 12:48:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-07 12:48:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 12:48:18,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:48:18,716 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:48:18,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:48:18,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:48:18,930 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:48:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:48:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-07 12:48:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:48:18,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005879171] [2022-04-07 12:48:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:48:18,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:48:18,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:48:18,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255032871] [2022-04-07 12:48:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:48:18,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:48:18,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:48:18,950 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-07 12:48:18,961 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-07 12:48:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:18,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 12:48:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:48:19,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:48:25,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {467#true} call ULTIMATE.init(); {467#true} is VALID [2022-04-07 12:48:25,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#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); {467#true} is VALID [2022-04-07 12:48:25,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-07 12:48:25,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {467#true} {467#true} #69#return; {467#true} is VALID [2022-04-07 12:48:25,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {467#true} call #t~ret8 := main(); {467#true} is VALID [2022-04-07 12:48:25,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {467#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; {467#true} is VALID [2022-04-07 12:48:25,601 INFO L272 TraceCheckUtils]: 6: Hoare triple {467#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {467#true} is VALID [2022-04-07 12:48:25,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#true} ~cond := #in~cond; {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:48:25,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:48:25,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:48:25,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(not (= |assume_abort_if_not_#in~cond| 0))} {467#true} #61#return; {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:48:25,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:48:25,603 INFO L272 TraceCheckUtils]: 12: Hoare triple {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {467#true} is VALID [2022-04-07 12:48:25,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {467#true} ~cond := #in~cond; {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:48:25,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {493#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:48:25,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {497#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {497#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:48:25,605 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {497#(not (= |assume_abort_if_not_#in~cond| 0))} {504#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {523#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:48:25,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {523#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:48:25,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:48:25,607 INFO L272 TraceCheckUtils]: 19: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= 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)); {467#true} is VALID [2022-04-07 12:48:25,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#true} ~cond := #in~cond; {467#true} is VALID [2022-04-07 12:48:25,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {467#true} assume !(0 == ~cond); {467#true} is VALID [2022-04-07 12:48:25,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#true} assume true; {467#true} is VALID [2022-04-07 12:48:25,608 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {467#true} {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} #65#return; {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:48:25,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:48:25,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {527#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:48:25,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:48:25,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {552#(and (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {559#(and (= main_~xy~0 0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= main_~yx~0 0))} is VALID [2022-04-07 12:48:25,612 INFO L272 TraceCheckUtils]: 28: Hoare triple {559#(and (= main_~xy~0 0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) (<= main_~X~0 1) (= 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)); {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:48:25,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:48:25,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {468#false} is VALID [2022-04-07 12:48:25,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {468#false} assume !false; {468#false} is VALID [2022-04-07 12:48:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:48:25,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:50:39,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:50:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005879171] [2022-04-07 12:50:39,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:50:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255032871] [2022-04-07 12:50:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255032871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:50:39,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:50:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-07 12:50:39,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574773301] [2022-04-07 12:50:39,232 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:50:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-07 12:50:39,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:50:39,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:50:39,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:39,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 12:50:39,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:50:39,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 12:50:39,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:50:39,267 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:50:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:39,731 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-07 12:50:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 12:50:39,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-07 12:50:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:50:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:50:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-07 12:50:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:50:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-07 12:50:39,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-07 12:50:39,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:39,814 INFO L225 Difference]: With dead ends: 61 [2022-04-07 12:50:39,814 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 12:50:39,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:50:39,816 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:50:39,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 124 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:50:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 12:50:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-07 12:50:39,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:50:39,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:50:39,835 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:50:39,835 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:50:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:39,837 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-07 12:50:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-07 12:50:39,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:39,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:39,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-07 12:50:39,839 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-07 12:50:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:39,840 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-07 12:50:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-07 12:50:39,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:39,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:39,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:50:39,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:50:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:50:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-07 12:50:39,843 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-07 12:50:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:50:39,843 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-07 12:50:39,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:50:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-07 12:50:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 12:50:39,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:50:39,845 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:50:39,871 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-07 12:50:40,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 12:50:40,069 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:50:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:50:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-07 12:50:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:50:40,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037022324] [2022-04-07 12:50:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:50:40,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:50:40,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256800987] [2022-04-07 12:50:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:40,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:40,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:50:40,111 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-07 12:50:40,112 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-07 12:50:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:40,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 12:50:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:40,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:50:40,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {812#true} call ULTIMATE.init(); {812#true} is VALID [2022-04-07 12:50:40,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#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); {812#true} is VALID [2022-04-07 12:50:40,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-07 12:50:40,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {812#true} {812#true} #69#return; {812#true} is VALID [2022-04-07 12:50:40,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {812#true} call #t~ret8 := main(); {812#true} is VALID [2022-04-07 12:50:40,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#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; {812#true} is VALID [2022-04-07 12:50:40,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {812#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-07 12:50:40,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#true} ~cond := #in~cond; {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:50:40,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:50:40,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:50:40,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {842#(not (= |assume_abort_if_not_#in~cond| 0))} {812#true} #61#return; {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:50:40,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:50:40,683 INFO L272 TraceCheckUtils]: 12: Hoare triple {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-07 12:50:40,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#true} ~cond := #in~cond; {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:50:40,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:50:40,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {842#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:50:40,685 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {842#(not (= |assume_abort_if_not_#in~cond| 0))} {849#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {868#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:50:40,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {868#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:50:40,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:50:40,686 INFO L272 TraceCheckUtils]: 19: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= 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)); {812#true} is VALID [2022-04-07 12:50:40,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-07 12:50:40,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-07 12:50:40,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-07 12:50:40,687 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {812#true} {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} #65#return; {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:50:40,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-07 12:50:40,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {872#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= 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; {897#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:50:40,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {901#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:50:40,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {901#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {905#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-07 12:50:40,692 INFO L272 TraceCheckUtils]: 28: Hoare triple {905#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= 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)); {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:50:40,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:50:40,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {813#false} is VALID [2022-04-07 12:50:40,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {813#false} assume !false; {813#false} is VALID [2022-04-07 12:50:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:50:40,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:50:41,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {813#false} assume !false; {813#false} is VALID [2022-04-07 12:50:41,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {913#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {813#false} is VALID [2022-04-07 12:50:41,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {909#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {913#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:50:41,040 INFO L272 TraceCheckUtils]: 28: Hoare triple {929#(= (+ (* 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)); {909#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:50:41,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {933#(= (+ (* 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; {929#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-07 12:50:41,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(= (+ (* (* 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; {933#(= (+ (* 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-07 12:50:41,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {941#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~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; {937#(= (+ (* (* 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-07 12:50:41,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {941#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-07 12:50:41,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {812#true} {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-07 12:50:41,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-07 12:50:41,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-07 12:50:41,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-07 12:50:41,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= 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)); {812#true} is VALID [2022-04-07 12:50:41,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-07 12:50:41,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {812#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {945#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-07 12:50:41,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {812#true} {812#true} #63#return; {812#true} is VALID [2022-04-07 12:50:41,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L272 TraceCheckUtils]: 12: Hoare triple {812#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {812#true} {812#true} #61#return; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {812#true} assume !(0 == ~cond); {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {812#true} ~cond := #in~cond; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L272 TraceCheckUtils]: 6: Hoare triple {812#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {812#true} is VALID [2022-04-07 12:50:41,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {812#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; {812#true} is VALID [2022-04-07 12:50:41,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {812#true} call #t~ret8 := main(); {812#true} is VALID [2022-04-07 12:50:41,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {812#true} {812#true} #69#return; {812#true} is VALID [2022-04-07 12:50:41,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {812#true} assume true; {812#true} is VALID [2022-04-07 12:50:41,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {812#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); {812#true} is VALID [2022-04-07 12:50:41,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {812#true} call ULTIMATE.init(); {812#true} is VALID [2022-04-07 12:50:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:50:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:50:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037022324] [2022-04-07 12:50:41,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:50:41,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256800987] [2022-04-07 12:50:41,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256800987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:50:41,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:50:41,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-07 12:50:41,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548373777] [2022-04-07 12:50:41,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:50:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2022-04-07 12:50:41,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:50:41,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:41,089 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-07 12:50:41,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-07 12:50:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:50:41,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-07 12:50:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:50:41,090 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:42,268 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-07 12:50:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 12:50:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2022-04-07 12:50:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:50:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-07 12:50:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2022-04-07 12:50:42,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2022-04-07 12:50:42,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:42,330 INFO L225 Difference]: With dead ends: 59 [2022-04-07 12:50:42,330 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 12:50:42,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-07 12:50:42,331 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:50:42,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 116 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 12:50:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 12:50:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-07 12:50:42,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:50:42,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:50:42,359 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:50:42,359 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:50:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:42,362 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-07 12:50:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-07 12:50:42,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:42,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:42,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-07 12:50:42,363 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-07 12:50:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:42,364 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-07 12:50:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-07 12:50:42,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:42,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:42,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:50:42,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:50:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:50:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-07 12:50:42,366 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2022-04-07 12:50:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:50:42,367 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-07 12:50:42,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-07 12:50:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 12:50:42,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:50:42,368 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:50:42,386 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-07 12:50:42,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:42,580 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:50:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:50:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-07 12:50:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:50:42,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892882801] [2022-04-07 12:50:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:50:42,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:50:42,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991241307] [2022-04-07 12:50:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:42,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:50:42,601 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-07 12:50:42,602 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-07 12:50:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:42,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-07 12:50:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:42,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:50:43,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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); {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #69#return; {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret8 := main(); {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#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; {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {1262#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1262#true} #61#return; {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #63#return; {1262#true} is VALID [2022-04-07 12:50:43,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1318#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 12:50:43,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {1318#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1318#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 12:50:43,012 INFO L272 TraceCheckUtils]: 19: Hoare triple {1318#(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)); {1262#true} is VALID [2022-04-07 12:50:43,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-07 12:50:43,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-07 12:50:43,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,013 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1318#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1318#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 12:50:43,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {1318#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1340#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-07 12:50:43,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {1340#(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; {1344#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:50:43,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {1344#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1348#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-07 12:50:43,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1352#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* 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-07 12:50:43,016 INFO L272 TraceCheckUtils]: 28: Hoare triple {1352#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* 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)); {1262#true} is VALID [2022-04-07 12:50:43,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {1262#true} ~cond := #in~cond; {1359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:50:43,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {1359#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:50:43,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:50:43,028 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} {1352#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* 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)))} #65#return; {1370#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* 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-07 12:50:43,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {1370#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* 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); {1374#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* 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-07 12:50:43,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {1374#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* 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; {1378#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 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-07 12:50:43,031 INFO L272 TraceCheckUtils]: 35: Hoare triple {1378#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 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)); {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:50:43,032 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:50:43,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {1386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1263#false} is VALID [2022-04-07 12:50:43,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-07 12:50:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 12:50:43,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:50:43,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-07 12:50:43,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {1386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1263#false} is VALID [2022-04-07 12:50:43,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:50:43,673 INFO L272 TraceCheckUtils]: 35: Hoare triple {1402#(= (+ (* 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)); {1382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:50:43,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {1406#(= (+ (* 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; {1402#(= (+ (* 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-07 12:50:43,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {1410#(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); {1406#(= (+ (* 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-07 12:50:43,676 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} {1414#(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)))))} #65#return; {1410#(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-07 12:50:43,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:50:43,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {1424#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1363#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:50:43,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {1262#true} ~cond := #in~cond; {1424#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:50:43,678 INFO L272 TraceCheckUtils]: 28: Hoare triple {1414#(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)); {1262#true} is VALID [2022-04-07 12:50:43,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {1431#(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; {1414#(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-07 12:50:43,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {1435#(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; {1431#(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-07 12:50:43,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {1439#(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; {1435#(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-07 12:50:43,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {1262#true} assume !!(~x~0 <= ~X~0); {1439#(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-07 12:50:43,685 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1262#true} #65#return; {1262#true} is VALID [2022-04-07 12:50:43,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-07 12:50:43,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L272 TraceCheckUtils]: 19: Hoare triple {1262#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {1262#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {1262#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #63#return; {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-07 12:50:43,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {1262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1262#true} #61#return; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {1262#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1262#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; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret8 := main(); {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #69#return; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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); {1262#true} is VALID [2022-04-07 12:50:43,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-07 12:50:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 12:50:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:50:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892882801] [2022-04-07 12:50:43,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:50:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991241307] [2022-04-07 12:50:43,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991241307] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:50:43,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:50:43,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-07 12:50:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27909863] [2022-04-07 12:50:43,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:50:43,698 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2022-04-07 12:50:43,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:50:43,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:43,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:43,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 12:50:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:50:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 12:50:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-07 12:50:43,745 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:44,711 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-04-07 12:50:44,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-07 12:50:44,711 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2022-04-07 12:50:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:50:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2022-04-07 12:50:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. [2022-04-07 12:50:44,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 58 transitions. [2022-04-07 12:50:44,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:44,771 INFO L225 Difference]: With dead ends: 55 [2022-04-07 12:50:44,771 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 12:50:44,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-04-07 12:50:44,772 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:50:44,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 160 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 191 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-04-07 12:50:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 12:50:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-07 12:50:44,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:50:44,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 12:50:44,801 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 12:50:44,802 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 12:50:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:44,805 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-07 12:50:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-07 12:50:44,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:44,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:44,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-07 12:50:44,806 INFO L87 Difference]: Start difference. First operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-07 12:50:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:44,811 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-07 12:50:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-07 12:50:44,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:44,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:44,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:50:44,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:50:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 12:50:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-07 12:50:44,815 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 39 [2022-04-07 12:50:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:50:44,816 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-07 12:50:44,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-07 12:50:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-07 12:50:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-07 12:50:44,818 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:50:44,818 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:50:44,845 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-07 12:50:45,027 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:45,027 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:50:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:50:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 330652206, now seen corresponding path program 1 times [2022-04-07 12:50:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:50:45,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858680593] [2022-04-07 12:50:45,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:50:45,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:50:45,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539620077] [2022-04-07 12:50:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:45,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:45,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:50:45,044 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-07 12:50:45,046 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-07 12:50:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:45,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 12:50:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:45,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:50:45,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#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); {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #69#return; {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret8 := main(); {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#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; {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:45,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:45,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,774 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2022-04-07 12:50:45,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1780#true} is VALID [2022-04-07 12:50:45,778 INFO L272 TraceCheckUtils]: 12: Hoare triple {1780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-07 12:50:45,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:45,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:45,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,783 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1780#true} {1780#true} #63#return; {1780#true} is VALID [2022-04-07 12:50:45,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-07 12:50:45,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-07 12:50:45,785 INFO L272 TraceCheckUtils]: 19: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) 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)); {1780#true} is VALID [2022-04-07 12:50:45,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:45,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:45,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,787 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1780#true} {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-07 12:50:45,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-07 12:50:45,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {1836#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) 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; {1861#(and (<= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-07 12:50:45,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {1861#(and (<= main_~x~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; {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-07 12:50:45,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {1865#(and (<= 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; {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-07 12:50:45,792 INFO L272 TraceCheckUtils]: 28: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-07 12:50:45,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:45,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:45,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,792 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1780#true} {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #65#return; {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-07 12:50:45,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(~x~0 <= ~X~0); {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-07 12:50:45,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {1865#(and (<= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} 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; {1890#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 1))} is VALID [2022-04-07 12:50:45,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {1890#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-07 12:50:45,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-07 12:50:45,797 INFO L272 TraceCheckUtils]: 37: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= 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)); {1780#true} is VALID [2022-04-07 12:50:45,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:45,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:45,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,798 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1780#true} {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} #65#return; {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-07 12:50:45,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-07 12:50:45,799 INFO L290 TraceCheckUtils]: 43: Hoare triple {1894#(and (<= (+ (div (+ (- 1) (* main_~X~0 3)) 4) 1) (div (+ main_~v~0 (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1919#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} is VALID [2022-04-07 12:50:45,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {1919#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} is VALID [2022-04-07 12:50:45,800 INFO L290 TraceCheckUtils]: 45: Hoare triple {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} is VALID [2022-04-07 12:50:45,800 INFO L272 TraceCheckUtils]: 46: Hoare triple {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1780#true} is VALID [2022-04-07 12:50:45,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:45,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:45,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:45,801 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1780#true} {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} #65#return; {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} is VALID [2022-04-07 12:50:45,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {1923#(and (< (div (+ (- 1) (* main_~X~0 3)) 4) (div (+ (- 1) (* 5 main_~X~0)) 6)) (<= main_~x~0 3))} assume !(~x~0 <= ~X~0); {1781#false} is VALID [2022-04-07 12:50:45,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {1781#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1781#false} is VALID [2022-04-07 12:50:45,802 INFO L272 TraceCheckUtils]: 53: Hoare triple {1781#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)); {1781#false} is VALID [2022-04-07 12:50:45,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2022-04-07 12:50:45,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2022-04-07 12:50:45,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2022-04-07 12:50:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 12:50:45,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:50:46,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {1781#false} assume !false; {1781#false} is VALID [2022-04-07 12:50:46,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {1781#false} assume 0 == ~cond; {1781#false} is VALID [2022-04-07 12:50:46,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {1781#false} ~cond := #in~cond; {1781#false} is VALID [2022-04-07 12:50:46,238 INFO L272 TraceCheckUtils]: 53: Hoare triple {1781#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)); {1781#false} is VALID [2022-04-07 12:50:46,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {1781#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1781#false} is VALID [2022-04-07 12:50:46,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {1975#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {1781#false} is VALID [2022-04-07 12:50:46,239 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1780#true} {1975#(<= main_~x~0 main_~X~0)} #65#return; {1975#(<= main_~x~0 main_~X~0)} is VALID [2022-04-07 12:50:46,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:46,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:46,239 INFO L272 TraceCheckUtils]: 46: Hoare triple {1975#(<= 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)); {1780#true} is VALID [2022-04-07 12:50:46,239 INFO L290 TraceCheckUtils]: 45: Hoare triple {1975#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1975#(<= main_~x~0 main_~X~0)} is VALID [2022-04-07 12:50:46,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {1997#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1975#(<= main_~x~0 main_~X~0)} is VALID [2022-04-07 12:50:46,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1997#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-07 12:50:46,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-07 12:50:46,242 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1780#true} {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-07 12:50:46,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:46,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:46,242 INFO L272 TraceCheckUtils]: 37: Hoare triple {2001#(or (not (< 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)); {1780#true} is VALID [2022-04-07 12:50:46,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {2001#(or (not (< 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; {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-07 12:50:46,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {2026#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2001#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-07 12:50:46,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~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; {2026#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} is VALID [2022-04-07 12:50:46,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-07 12:50:46,245 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1780#true} {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} #65#return; {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-07 12:50:46,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:46,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:46,245 INFO L272 TraceCheckUtils]: 28: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< 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)); {1780#true} is VALID [2022-04-07 12:50:46,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-07 12:50:46,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {2055#(or (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2030#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} is VALID [2022-04-07 12:50:46,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} 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; {2055#(or (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-07 12:50:46,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} assume !!(~x~0 <= ~X~0); {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-07 12:50:46,248 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1780#true} {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} #65#return; {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-07 12:50:46,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:46,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:46,248 INFO L272 TraceCheckUtils]: 19: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* 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)); {1780#true} is VALID [2022-04-07 12:50:46,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-07 12:50:46,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {1780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2059#(or (<= (+ main_~x~0 3) main_~X~0) (<= (* main_~X~0 4) (+ main_~v~0 (* main_~Y~0 4))) (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2)))} is VALID [2022-04-07 12:50:46,249 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1780#true} {1780#true} #63#return; {1780#true} is VALID [2022-04-07 12:50:46,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:46,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:46,249 INFO L272 TraceCheckUtils]: 12: Hoare triple {1780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1780#true} {1780#true} #61#return; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1780#true} assume !(0 == ~cond); {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {1780#true} ~cond := #in~cond; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {1780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#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; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {1780#true} call #t~ret8 := main(); {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1780#true} {1780#true} #69#return; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1780#true} assume true; {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1780#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); {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {1780#true} call ULTIMATE.init(); {1780#true} is VALID [2022-04-07 12:50:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 12:50:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:50:46,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858680593] [2022-04-07 12:50:46,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:50:46,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539620077] [2022-04-07 12:50:46,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539620077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:50:46,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:50:46,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-07 12:50:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141649843] [2022-04-07 12:50:46,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:50:46,252 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 57 [2022-04-07 12:50:46,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:50:46,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 12:50:46,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:46,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 12:50:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:50:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 12:50:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:50:46,305 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 12:50:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:47,126 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2022-04-07 12:50:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 12:50:47,126 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) Word has length 57 [2022-04-07 12:50:47,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:50:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 12:50:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2022-04-07 12:50:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 12:50:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 75 transitions. [2022-04-07 12:50:47,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 75 transitions. [2022-04-07 12:50:47,212 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-07 12:50:47,213 INFO L225 Difference]: With dead ends: 76 [2022-04-07 12:50:47,213 INFO L226 Difference]: Without dead ends: 70 [2022-04-07 12:50:47,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2022-04-07 12:50:47,214 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:50:47,214 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:50:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-07 12:50:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-04-07 12:50:47,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:50:47,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:50:47,258 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:50:47,258 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:50:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:47,260 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-04-07 12:50:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-07 12:50:47,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:47,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:47,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-07 12:50:47,261 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 70 states. [2022-04-07 12:50:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:47,263 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-04-07 12:50:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-04-07 12:50:47,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:47,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:47,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:50:47,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:50:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 12:50:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-04-07 12:50:47,265 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 57 [2022-04-07 12:50:47,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:50:47,265 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-04-07 12:50:47,265 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2022-04-07 12:50:47,265 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-04-07 12:50:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 12:50:47,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:50:47,266 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:50:47,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 12:50:47,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:47,482 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:50:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:50:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1832016594, now seen corresponding path program 2 times [2022-04-07 12:50:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:50:47,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105408834] [2022-04-07 12:50:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:50:47,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:50:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580670116] [2022-04-07 12:50:47,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:50:47,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:47,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:50:47,520 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-07 12:50:47,521 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-07 12:50:47,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:50:47,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:50:47,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 12:50:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:47,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:50:48,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#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); {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2483#true} {2483#true} #69#return; {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {2483#true} call #t~ret8 := main(); {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {2483#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; {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {2483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {2483#true} #61#return; {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {2483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L272 TraceCheckUtils]: 12: Hoare triple {2483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2483#true} {2483#true} #63#return; {2483#true} is VALID [2022-04-07 12:50:48,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,074 INFO L272 TraceCheckUtils]: 19: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,075 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {2539#(<= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} 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; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,080 INFO L272 TraceCheckUtils]: 28: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,082 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {2564#(<= main_~X~0 (* main_~Y~0 2))} #65#return; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} 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; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,084 INFO L272 TraceCheckUtils]: 37: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,084 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,086 INFO L272 TraceCheckUtils]: 46: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,087 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {2620#(<= (div main_~v~0 (- 2)) 0)} #65#return; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 53: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L272 TraceCheckUtils]: 55: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 57: Hoare triple {2484#false} assume !(0 == ~cond); {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 58: Hoare triple {2484#false} assume true; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2484#false} {2484#false} #65#return; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 60: Hoare triple {2484#false} assume !!(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {2484#false} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 63: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L272 TraceCheckUtils]: 64: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {2484#false} assume !(0 == ~cond); {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {2484#false} assume true; {2484#false} is VALID [2022-04-07 12:50:48,088 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2484#false} {2484#false} #65#return; {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L290 TraceCheckUtils]: 69: Hoare triple {2484#false} assume !(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L290 TraceCheckUtils]: 70: Hoare triple {2484#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L272 TraceCheckUtils]: 71: Hoare triple {2484#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)); {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L290 TraceCheckUtils]: 72: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L290 TraceCheckUtils]: 73: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-07 12:50:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 74 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 12:50:48,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:50:48,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-07 12:50:48,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-07 12:50:48,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-07 12:50:48,534 INFO L272 TraceCheckUtils]: 71: Hoare triple {2484#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)); {2484#false} is VALID [2022-04-07 12:50:48,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {2484#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2484#false} is VALID [2022-04-07 12:50:48,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {2484#false} assume !(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2483#true} {2484#false} #65#return; {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L272 TraceCheckUtils]: 64: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {2484#false} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 60: Hoare triple {2484#false} assume !!(~x~0 <= ~X~0); {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2483#true} {2484#false} #65#return; {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L272 TraceCheckUtils]: 55: Hoare triple {2484#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {2484#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2484#false} is VALID [2022-04-07 12:50:48,535 INFO L290 TraceCheckUtils]: 53: Hoare triple {2484#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2484#false} is VALID [2022-04-07 12:50:48,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2484#false} is VALID [2022-04-07 12:50:48,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !!(~x~0 <= ~X~0); {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,537 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {2620#(<= (div main_~v~0 (- 2)) 0)} #65#return; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,537 INFO L272 TraceCheckUtils]: 46: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {2620#(<= (div main_~v~0 (- 2)) 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2620#(<= (div main_~v~0 (- 2)) 0)} is VALID [2022-04-07 12:50:48,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !!(~x~0 <= ~X~0); {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,539 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #65#return; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,539 INFO L272 TraceCheckUtils]: 37: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} 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; {2592#(<= (div main_~v~0 (- 2)) main_~Y~0)} is VALID [2022-04-07 12:50:48,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,541 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {2564#(<= main_~X~0 (* main_~Y~0 2))} #65#return; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,542 INFO L272 TraceCheckUtils]: 28: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {2564#(<= main_~X~0 (* main_~Y~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} 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; {2564#(<= main_~X~0 (* main_~Y~0 2))} is VALID [2022-04-07 12:50:48,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-07 12:50:48,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} #65#return; {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-07 12:50:48,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2861#(or (< main_~v~0 0) (<= main_~X~0 (* main_~Y~0 2)))} is VALID [2022-04-07 12:50:48,545 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2483#true} {2483#true} #63#return; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L272 TraceCheckUtils]: 12: Hoare triple {2483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {2483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {2483#true} #61#return; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {2483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {2483#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; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {2483#true} call #t~ret8 := main(); {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2483#true} {2483#true} #69#return; {2483#true} is VALID [2022-04-07 12:50:48,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-07 12:50:48,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#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); {2483#true} is VALID [2022-04-07 12:50:48,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-07 12:50:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-07 12:50:48,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:50:48,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105408834] [2022-04-07 12:50:48,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:50:48,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580670116] [2022-04-07 12:50:48,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580670116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:50:48,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:50:48,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-07 12:50:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457673861] [2022-04-07 12:50:48,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:50:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 75 [2022-04-07 12:50:48,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:50:48,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-07 12:50:48,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:48,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:50:48,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:50:48,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:50:48,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 12:50:48,601 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-07 12:50:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:48,830 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2022-04-07 12:50:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:50:48,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 75 [2022-04-07 12:50:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:50:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-07 12:50:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-07 12:50:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-07 12:50:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-07 12:50:48,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-07 12:50:48,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:50:48,877 INFO L225 Difference]: With dead ends: 85 [2022-04-07 12:50:48,877 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 12:50:48,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:50:48,878 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:50:48,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 81 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:50:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 12:50:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2022-04-07 12:50:48,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:50:48,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 12:50:48,941 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 12:50:48,941 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 12:50:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:48,943 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-07 12:50:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-07 12:50:48,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:48,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:48,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-04-07 12:50:48,944 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-04-07 12:50:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:50:48,945 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-04-07 12:50:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-07 12:50:48,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:50:48,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:50:48,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:50:48,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:50:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 12:50:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-04-07 12:50:48,947 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 75 [2022-04-07 12:50:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:50:48,947 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-04-07 12:50:48,948 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-07 12:50:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-07 12:50:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-07 12:50:48,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:50:48,948 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:50:48,965 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-07 12:50:49,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:49,163 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:50:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:50:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash 657512368, now seen corresponding path program 3 times [2022-04-07 12:50:49,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:50:49,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880524041] [2022-04-07 12:50:49,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:50:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:50:49,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:50:49,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455136544] [2022-04-07 12:50:49,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:50:49,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:50:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:50:49,179 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-07 12:50:49,184 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-07 12:50:49,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 12:50:49,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:50:49,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 12:50:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:50:49,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:51:06,657 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:51:15,322 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:51:20,664 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:51:53,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2022-04-07 12:51:53,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#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); {3280#true} is VALID [2022-04-07 12:51:53,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:51:53,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #69#return; {3280#true} is VALID [2022-04-07 12:51:53,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret8 := main(); {3280#true} is VALID [2022-04-07 12:51:53,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#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; {3280#true} is VALID [2022-04-07 12:51:53,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {3280#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:51:53,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} ~cond := #in~cond; {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:51:53,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:51:53,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:51:53,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} {3280#true} #61#return; {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,625 INFO L272 TraceCheckUtils]: 12: Hoare triple {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:51:53,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} ~cond := #in~cond; {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:51:53,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {3306#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:51:53,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3310#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:51:53,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3310#(not (= |assume_abort_if_not_#in~cond| 0))} {3317#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,628 INFO L272 TraceCheckUtils]: 19: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 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)); {3280#true} is VALID [2022-04-07 12:51:53,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:51:53,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:51:53,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:51:53,628 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,630 INFO L272 TraceCheckUtils]: 28: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 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)); {3280#true} is VALID [2022-04-07 12:51:53,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:51:53,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:51:53,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:51:53,631 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,632 INFO L272 TraceCheckUtils]: 37: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 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)); {3280#true} is VALID [2022-04-07 12:51:53,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:51:53,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:51:53,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:51:53,633 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,634 INFO L272 TraceCheckUtils]: 46: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 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)); {3280#true} is VALID [2022-04-07 12:51:53,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:51:53,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:51:53,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:51:53,635 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 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; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,637 INFO L272 TraceCheckUtils]: 55: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 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)); {3280#true} is VALID [2022-04-07 12:51:53,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:51:53,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:51:53,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:51:53,637 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3280#true} {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #65#return; {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {3336#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !!(~x~0 <= ~X~0); {3469#(and (<= main_~x~0 main_~X~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {3469#(and (<= main_~x~0 main_~X~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3473#(and (<= main_~x~0 main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {3473#(and (<= main_~x~0 main_~X~0) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3477#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-07 12:51:53,640 INFO L290 TraceCheckUtils]: 63: Hoare triple {3477#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3481#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= (* 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-07 12:51:53,640 INFO L272 TraceCheckUtils]: 64: Hoare triple {3481#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= (* 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)); {3280#true} is VALID [2022-04-07 12:51:53,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {3280#true} ~cond := #in~cond; {3488#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:51:53,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {3488#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:51:53,640 INFO L290 TraceCheckUtils]: 67: Hoare triple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:51:53,642 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} {3481#(and (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= (* 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)))} #65#return; {3499#(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_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-07 12:51:53,642 INFO L290 TraceCheckUtils]: 69: Hoare triple {3499#(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_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {3503#(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_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-07 12:51:53,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {3503#(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_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (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; {3507#(and (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 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) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~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))))) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-07 12:51:53,668 INFO L272 TraceCheckUtils]: 71: Hoare triple {3507#(and (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 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) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~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))))) (< main_~v~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 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 + 2 * ~y~0 then 1 else 0)); {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:51:53,669 INFO L290 TraceCheckUtils]: 72: Hoare triple {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:51:53,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {3515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3281#false} is VALID [2022-04-07 12:51:53,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2022-04-07 12:51:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-07 12:51:53,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:51:55,325 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:52:00,581 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:52:40,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2022-04-07 12:52:40,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {3515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3281#false} is VALID [2022-04-07 12:52:40,563 INFO L290 TraceCheckUtils]: 72: Hoare triple {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:52:40,563 INFO L272 TraceCheckUtils]: 71: Hoare triple {3531#(= (+ (* 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)); {3511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:52:40,564 INFO L290 TraceCheckUtils]: 70: Hoare triple {3535#(= (+ (* 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; {3531#(= (+ (* 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-07 12:52:40,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {3539#(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); {3535#(= (+ (* 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-07 12:52:40,566 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} {3543#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~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)))))} #65#return; {3539#(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-07 12:52:40,566 INFO L290 TraceCheckUtils]: 67: Hoare triple {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:52:40,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {3553#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3492#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:52:40,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {3280#true} ~cond := #in~cond; {3553#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:52:40,567 INFO L272 TraceCheckUtils]: 64: Hoare triple {3543#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~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)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:42,570 WARN L290 TraceCheckUtils]: 63: Hoare triple {3560#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 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))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3543#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~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 UNKNOWN [2022-04-07 12:52:42,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {3564#(forall ((v_main_~x~0_29 Int)) (or (and (or (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) 0)) (forall ((main_~y~0 Int)) (= (+ (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_29 main_~y~0))))) (not (= main_~X~0 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0))) (or (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0)) (= (+ (* 2 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* v_main_~x~0_29 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) 2))))) (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (<= v_main_~x~0_29 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3560#(or (<= main_~x~0 main_~X~0) (and (or (= (+ main_~X~0 main_~v~0 (* (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) main_~x~0) 2)) (+ (* main_~Y~0 2) (* (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 2) (* 2 (* main_~Y~0 main_~x~0)))) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) main_~X~0) 0)) (= main_~X~0 0) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0))) (or (forall ((main_~y~0 Int)) (= (+ (* 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))))) (not (= main_~X~0 0)) (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* main_~Y~0 main_~x~0)) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0 main_~x~0)) 2) 0)))))} is VALID [2022-04-07 12:52:45,045 WARN L290 TraceCheckUtils]: 61: Hoare triple {3568#(forall ((v_main_~x~0_29 Int)) (or (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (<= v_main_~x~0_29 main_~X~0) (and (or (not (= main_~X~0 0)) (and (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= (* v_main_~x~0_29 main_~y~0) main_~y~0))) (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= main_~y~0 (* v_main_~x~0_29 main_~y~0)))))) (or (forall ((aux_div_aux_mod_v_main_~v~0_36_40_77 Int)) (or (and (or (forall ((aux_div_v_main_~v~0_36_40 Int)) (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0))))) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (div (- main_~X~0) (- 2))) 0)) (or (forall ((aux_div_v_main_~v~0_36_40 Int)) (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0))))) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (div (- main_~X~0) (- 2))) 0))) (not (= (mod (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)))) (= main_~X~0 0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3564#(forall ((v_main_~x~0_29 Int)) (or (and (or (not (= (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) 0)) (forall ((main_~y~0 Int)) (= (+ (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* 2 (* v_main_~x~0_29 main_~y~0))))) (not (= main_~X~0 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0))) (or (= main_~X~0 0) (not (= (mod (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)) (not (= (mod (+ main_~X~0 main_~v~0 (* v_main_~x~0_29 (- 2) main_~Y~0)) 2) 0)) (= (+ (* 2 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) (* 2 (* v_main_~x~0_29 main_~Y~0)) (* main_~Y~0 2)) (+ main_~X~0 main_~v~0 (* (* v_main_~x~0_29 (div (+ (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0)) 2))))) (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (<= v_main_~x~0_29 main_~X~0)))} is UNKNOWN [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3568#(forall ((v_main_~x~0_29 Int)) (or (not (<= v_main_~x~0_29 (+ main_~x~0 1))) (<= v_main_~x~0_29 main_~X~0) (and (or (not (= main_~X~0 0)) (and (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= (* v_main_~x~0_29 main_~y~0) main_~y~0))) (or (<= (div (- main_~X~0) (- 2)) (* v_main_~x~0_29 main_~Y~0)) (forall ((main_~y~0 Int)) (<= main_~y~0 (* v_main_~x~0_29 main_~y~0)))))) (or (forall ((aux_div_aux_mod_v_main_~v~0_36_40_77 Int)) (or (and (or (forall ((aux_div_v_main_~v~0_36_40 Int)) (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0))))) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (div (- main_~X~0) (- 2))) 0)) (or (forall ((aux_div_v_main_~v~0_36_40 Int)) (or (<= (+ aux_div_v_main_~v~0_36_40 1) aux_div_aux_mod_v_main_~v~0_36_40_77) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 1) aux_div_v_main_~v~0_36_40) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0) (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0)) (* v_main_~x~0_29 (div (+ main_~Y~0 (* v_main_~x~0_29 main_~Y~0) aux_div_v_main_~v~0_36_40) main_~X~0))))) (<= (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (div (- main_~X~0) (- 2))) 0))) (not (= (mod (+ aux_div_aux_mod_v_main_~v~0_36_40_77 main_~Y~0 (* v_main_~x~0_29 main_~Y~0)) main_~X~0) 0)))) (= main_~X~0 0)))))} is VALID [2022-04-07 12:52:45,423 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L272 TraceCheckUtils]: 55: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 54: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {3280#true} 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; {3280#true} is VALID [2022-04-07 12:52:45,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L272 TraceCheckUtils]: 46: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {3280#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {3280#true} 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; {3280#true} is VALID [2022-04-07 12:52:45,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L272 TraceCheckUtils]: 28: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {3280#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {3280#true} 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; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {3280#true} assume !!(~x~0 <= ~X~0); {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3280#true} {3280#true} #65#return; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L272 TraceCheckUtils]: 19: Hoare triple {3280#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {3280#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {3280#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3280#true} {3280#true} #63#return; {3280#true} is VALID [2022-04-07 12:52:45,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,426 INFO L272 TraceCheckUtils]: 12: Hoare triple {3280#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {3280#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3280#true} {3280#true} #61#return; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {3280#true} assume !(0 == ~cond); {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {3280#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#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; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret8 := main(); {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #69#return; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#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); {3280#true} is VALID [2022-04-07 12:52:45,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2022-04-07 12:52:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-07 12:52:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:52:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880524041] [2022-04-07 12:52:45,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:52:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455136544] [2022-04-07 12:52:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455136544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:52:45,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:52:45,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2022-04-07 12:52:45,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499247681] [2022-04-07 12:52:45,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:52:45,430 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 75 [2022-04-07 12:52:45,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:52:45,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 12:52:50,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 64 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 12:52:50,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-07 12:52:50,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:52:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-07 12:52:50,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=498, Unknown=4, NotChecked=0, Total=600 [2022-04-07 12:52:50,868 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 12:53:11,346 WARN L232 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 63 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 12:53:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:53:13,906 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-07 12:53:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 12:53:13,906 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 75 [2022-04-07 12:53:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:53:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 12:53:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2022-04-07 12:53:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 12:53:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 42 transitions. [2022-04-07 12:53:13,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 42 transitions. [2022-04-07 12:53:14,472 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-07 12:53:14,472 INFO L225 Difference]: With dead ends: 61 [2022-04-07 12:53:14,472 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:53:14,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=225, Invalid=1031, Unknown=4, NotChecked=0, Total=1260 [2022-04-07 12:53:14,473 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-07 12:53:14,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 171 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 303 Invalid, 0 Unknown, 41 Unchecked, 3.9s Time] [2022-04-07 12:53:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:53:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:53:14,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:53:14,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:53:14,474 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:53:14,474 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:53:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:53:14,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:53:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:53:14,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:53:14,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:53:14,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 12:53:14,475 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 12:53:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:53:14,475 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:53:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:53:14,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:53:14,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:53:14,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:53:14,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:53:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:53:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:53:14,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-07 12:53:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:53:14,475 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:53:14,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 7 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 12:53:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:53:14,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:53:14,477 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:53:14,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 12:53:14,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:53:14,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:53:22,372 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-07 12:53:22,372 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-07 12:53:22,372 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 21 53) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (* main_~Y~0 2))) (or (and (= main_~x~0 0) (= main_~xy~0 0) (= (+ main_~X~0 main_~v~0) .cse0) (= main_~y~0 0) (= main_~yx~0 0)) (let ((.cse2 (* main_~y~0 2)) (.cse1 (* 2 (* main_~Y~0 main_~x~0)))) (and (= (+ .cse0 .cse1) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= (+ .cse2 .cse0 (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~X~0 1) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ .cse2 .cse0 .cse1)))))) [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 21 53) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 45) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L40-2(lines 40 45) no Hoare annotation was computed. [2022-04-07 12:53:22,373 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse1 (* main_~Y~0 2)) (.cse3 (+ main_~X~0 main_~v~0)) (.cse5 (<= main_~X~0 1))) (or (let ((.cse4 (* main_~Y~0 main_~x~0))) (let ((.cse2 (* 2 .cse4))) (and (or (<= main_~x~0 main_~X~0) (and (let ((.cse0 (div (+ (div .cse3 (- 2)) main_~Y~0 .cse4) main_~X~0))) (= (+ main_~X~0 main_~v~0 (* (* .cse0 main_~x~0) 2)) (+ .cse1 (* .cse0 2) .cse2))) (or (forall ((main_~y~0 Int)) (= (+ (* 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))))) (not (= main_~X~0 0))))) (<= main_~X~0 .cse1) (= (+ .cse1 .cse2) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 1) (<= 0 main_~X~0) .cse5 (<= (div main_~v~0 (- 2)) main_~Y~0)))) (and (< main_~v~0 .cse1) (<= 0 main_~Y~0) (= .cse3 (* main_~Y~0 4)) .cse5 (= main_~y~0 0)))) [2022-04-07 12:53:22,373 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 53) the Hoare annotation is: true [2022-04-07 12:53:22,373 INFO L882 garLoopResultBuilder]: For program point L32-3(lines 32 47) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (* main_~Y~0 2)) (.cse5 (<= main_~X~0 1))) (or (let ((.cse0 (* 2 main_~xy~0)) (.cse4 (* 2 (* main_~Y~0 main_~x~0))) (.cse2 (* 2 main_~yx~0)) (.cse3 (<= main_~x~0 main_~X~0))) (and (= (+ .cse0 main_~X~0 main_~v~0) (+ .cse1 .cse2)) (or .cse3 (forall ((main_~y~0 Int)) (= (+ (* 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))))) (not (= main_~X~0 0))) (<= main_~X~0 .cse1) (= (+ .cse1 .cse4) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~Y~0 1) (<= 0 main_~X~0) .cse5 (<= (div main_~v~0 (- 2)) main_~Y~0) (or (= (+ .cse0 (* main_~y~0 2) .cse4) (+ (* 2 (* main_~y~0 main_~x~0)) .cse2)) .cse3))) (and (= main_~xy~0 0) (< main_~v~0 .cse1) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 4)) .cse5 (= main_~y~0 0) (= main_~yx~0 0)))) [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 32 47) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 12:53:22,374 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 16) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point L14(lines 14 17) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2022-04-07 12:53:22,374 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-07 12:53:22,376 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-04-07 12:53:22,377 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:53:22,380 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:53:22,380 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:53:22,380 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 12:53:22,380 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-07 12:53:22,381 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-07 12:53:22,406 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-07 12:53:22,407 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:53:22,407 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:53:22,412 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:53:22 BoogieIcfgContainer [2022-04-07 12:53:22,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:53:22,428 INFO L158 Benchmark]: Toolchain (without parser) took 305449.32ms. Allocated memory was 197.1MB in the beginning and 277.9MB in the end (delta: 80.7MB). Free memory was 146.4MB in the beginning and 132.4MB in the end (delta: 14.1MB). Peak memory consumption was 95.8MB. Max. memory is 8.0GB. [2022-04-07 12:53:22,428 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:53:22,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.65ms. Allocated memory is still 197.1MB. Free memory was 146.2MB in the beginning and 171.2MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 12:53:22,428 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 197.1MB. Free memory was 171.2MB in the beginning and 169.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 12:53:22,428 INFO L158 Benchmark]: RCFGBuilder took 301.16ms. Allocated memory is still 197.1MB. Free memory was 169.9MB in the beginning and 157.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 12:53:22,429 INFO L158 Benchmark]: TraceAbstraction took 304855.59ms. Allocated memory was 197.1MB in the beginning and 277.9MB in the end (delta: 80.7MB). Free memory was 157.4MB in the beginning and 132.4MB in the end (delta: 25.0MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2022-04-07 12:53:22,429 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.65ms. Allocated memory is still 197.1MB. Free memory was 146.2MB in the beginning and 171.2MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 197.1MB. Free memory was 171.2MB in the beginning and 169.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 301.16ms. Allocated memory is still 197.1MB. Free memory was 169.9MB in the beginning and 157.5MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 304855.59ms. Allocated memory was 197.1MB in the beginning and 277.9MB in the end (delta: 80.7MB). Free memory was 157.4MB in the beginning and 132.4MB in the end (delta: 25.0MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 304.7s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 897 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 103 IncrementalHoareTripleChecker+Unchecked, 703 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1186 IncrementalHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 194 mSDtfsCounter, 1186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 523 SyntacticMatches, 7 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 35 PreInvPairs, 58 NumberOfFragments, 383 HoareAnnotationTreeSize, 35 FomulaSimplifications, 673 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3093 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 260.8s InterpolantComputationTime, 356 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 621 ConstructedInterpolants, 6 QuantifiedInterpolants, 3604 SizeOfPredicates, 39 NumberOfNonLiveVariables, 884 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 637/746 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant [2022-04-07 12:53:22,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] [2022-04-07 12:53:22,437 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~y~0,QUANTIFIED] Derived loop invariant: (((((((x <= X || (X + v + ((X + v) / -2 + Y + Y * x) / X * x * 2 == Y * 2 + ((X + v) / -2 + Y + Y * x) / X * 2 + 2 * (Y * x) && ((forall main_~y~0 : int :: 2 * (main_~y~0 * x) + X + v == main_~y~0 * 2 + Y * 2 + 2 * (Y * x)) || !(X == 0)))) && X <= Y * 2) && Y * 2 + 2 * (Y * x) == X * y * 2 + X + v) && Y <= 1) && 0 <= X) && X <= 1) && v / -2 <= Y) || ((((v < Y * 2 && 0 <= Y) && X + v == Y * 4) && X <= 1) && y == 0) RESULT: Ultimate proved your program to be correct! [2022-04-07 12:53:22,640 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-07 12:53:22,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...