/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/bresenham-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:45:41,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:45:41,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:45:41,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:45:41,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:45:41,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:45:41,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:45:41,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:45:41,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:45:41,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:45:41,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:45:41,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:45:41,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:45:41,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:45:41,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:45:41,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:45:41,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:45:41,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:45:41,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:45:41,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:45:41,200 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:45:41,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:45:41,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:45:41,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:45:41,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:45:41,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:45:41,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:45:41,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:45:41,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:45:41,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:45:41,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:45:41,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:45:41,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:45:41,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:45:41,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:45:41,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:45:41,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:45:41,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:45:41,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:45:41,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:45:41,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:45:41,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:45:41,219 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-27 11:45:41,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:45:41,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:45:41,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:45:41,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:45:41,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:45:41,238 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:45:41,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:45:41,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:45:41,239 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:45:41,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:45:41,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:45:41,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:45:41,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:45:41,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:45:41,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:45:41,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:41,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:45:41,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:45:41,241 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-27 11:45:41,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:45:41,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:45:41,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:45:41,437 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:45:41,437 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:45:41,438 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-27 11:45:41,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb97ff5b9/d710c371ae6b40978f713deda89ce392/FLAGde0e5bb85 [2022-04-27 11:45:41,878 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:45:41,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-27 11:45:41,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb97ff5b9/d710c371ae6b40978f713deda89ce392/FLAGde0e5bb85 [2022-04-27 11:45:41,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb97ff5b9/d710c371ae6b40978f713deda89ce392 [2022-04-27 11:45:41,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:45:41,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:45:41,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:41,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:45:41,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:45:41,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:41" (1/1) ... [2022-04-27 11:45:41,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd8f9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:41, skipping insertion in model container [2022-04-27 11:45:41,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:41" (1/1) ... [2022-04-27 11:45:41,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:45:41,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:45:42,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c[597,610] [2022-04-27 11:45:42,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:42,061 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:45:42,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c[597,610] [2022-04-27 11:45:42,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:42,092 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:45:42,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42 WrapperNode [2022-04-27 11:45:42,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:42,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:45:42,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:45:42,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:45:42,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:45:42,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:45:42,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:45:42,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:45:42,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (1/1) ... [2022-04-27 11:45:42,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:42,145 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-27 11:45:42,154 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-27 11:45:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:45:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:45:42,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:45:42,182 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:45:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:45:42,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:45:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:45:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:45:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:45:42,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:45:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:45:42,232 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:45:42,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:45:42,387 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:45:42,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:45:42,395 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:45:42,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:42 BoogieIcfgContainer [2022-04-27 11:45:42,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:45:42,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:45:42,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:45:42,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:45:42,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:45:41" (1/3) ... [2022-04-27 11:45:42,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0dfb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:42, skipping insertion in model container [2022-04-27 11:45:42,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:42" (2/3) ... [2022-04-27 11:45:42,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0dfb00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:42, skipping insertion in model container [2022-04-27 11:45:42,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:42" (3/3) ... [2022-04-27 11:45:42,406 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll.c [2022-04-27 11:45:42,415 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:45:42,416 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:45:42,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:45:42,453 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b1ee571, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d3394a2 [2022-04-27 11:45:42,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:45:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:45:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:45:42,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:42,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:42,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 1 times [2022-04-27 11:45:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:42,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980259980] [2022-04-27 11:45:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:42,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069627326] [2022-04-27 11:45:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:42,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:42,549 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-27 11:45:42,550 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-27 11:45:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:42,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:45:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:42,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-27 11:45:42,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-27 11:45:42,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-27 11:45:42,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #61#return; {27#true} is VALID [2022-04-27 11:45:42,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-27 11:45:42,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:42,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {51#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-27 11:45:42,853 INFO L272 TraceCheckUtils]: 7: Hoare triple {51#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {55#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:42,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {59#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:42,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28#false} is VALID [2022-04-27 11:45:42,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-27 11:45:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:45:42,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:45:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:42,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980259980] [2022-04-27 11:45:42,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:45:42,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069627326] [2022-04-27 11:45:42,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069627326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:42,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:42,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:45:42,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102916188] [2022-04-27 11:45:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:42,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:45:42,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:42,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:45:42,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:42,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:45:42,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:42,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:45:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:45:42,910 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:45:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:43,140 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-04-27 11:45:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:45:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:45:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:45:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 11:45:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:45:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 11:45:43,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 11:45:43,207 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-27 11:45:43,213 INFO L225 Difference]: With dead ends: 55 [2022-04-27 11:45:43,213 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 11:45:43,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-27 11:45:43,217 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:43,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:45:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 11:45:43,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 11:45:43,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:43,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:43,241 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:43,242 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:43,244 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 11:45:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 11:45:43,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:43,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:43,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 11:45:43,245 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 11:45:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:43,247 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 11:45:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 11:45:43,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:43,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:43,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:43,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 11:45:43,250 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2022-04-27 11:45:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:43,250 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 11:45:43,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:45:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 11:45:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 11:45:43,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:43,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:43,268 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-27 11:45:43,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 11:45:43,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 1 times [2022-04-27 11:45:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:43,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157870653] [2022-04-27 11:45:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:43,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:43,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [267014306] [2022-04-27 11:45:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:43,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:43,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:43,489 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-27 11:45:43,497 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-27 11:45:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:43,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:45:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:43,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:43,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 11:45:43,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 11:45:43,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 11:45:43,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #61#return; {231#true} is VALID [2022-04-27 11:45:43,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret8 := main(); {231#true} is VALID [2022-04-27 11:45:43,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {251#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:43,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {251#(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; {255#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-27 11:45:43,821 INFO L272 TraceCheckUtils]: 7: Hoare triple {255#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {231#true} is VALID [2022-04-27 11:45:43,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} ~cond := #in~cond; {262#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:43,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:43,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:43,823 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} {255#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {251#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:43,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {251#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {251#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:43,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {251#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {279#(and (= main_~x~0 0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-27 11:45:43,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {279#(and (= main_~x~0 0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {283#(and (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-27 11:45:43,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {283#(and (= main_~x~0 1) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {287#(and (= main_~xy~0 0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-27 11:45:43,827 INFO L272 TraceCheckUtils]: 16: Hoare triple {287#(and (= main_~xy~0 0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ 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)); {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:43,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:43,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 11:45:43,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 11:45:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:45:43,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:50,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-27 11:45:50,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {232#false} is VALID [2022-04-27 11:45:50,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:50,302 INFO L272 TraceCheckUtils]: 16: Hoare triple {311#(= (+ (* 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)); {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:50,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#(= (+ (* 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; {311#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-27 11:45:50,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {319#(= (+ (* (* 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; {315#(= (+ (* 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-27 11:45:50,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {319#(= (+ (* (* 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-27 11:45:50,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {315#(= (+ (* 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-27 11:45:50,307 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} {329#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #57#return; {315#(= (+ (* 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-27 11:45:50,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:50,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {339#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:50,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} ~cond := #in~cond; {339#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:50,309 INFO L272 TraceCheckUtils]: 7: Hoare triple {329#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {231#true} is VALID [2022-04-27 11:45:50,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {329#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-27 11:45:50,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {231#true} is VALID [2022-04-27 11:45:50,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret8 := main(); {231#true} is VALID [2022-04-27 11:45:50,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #61#return; {231#true} is VALID [2022-04-27 11:45:50,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-27 11:45:50,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#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); {231#true} is VALID [2022-04-27 11:45:50,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2022-04-27 11:45:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:45:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157870653] [2022-04-27 11:45:50,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:45:50,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267014306] [2022-04-27 11:45:50,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267014306] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:50,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:45:50,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-27 11:45:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686935171] [2022-04-27 11:45:50,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-04-27 11:45:50,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:50,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:50,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:50,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:45:50,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:50,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:45:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:45:50,351 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:50,980 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-27 11:45:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:45:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-04-27 11:45:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2022-04-27 11:45:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 43 transitions. [2022-04-27 11:45:50,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 43 transitions. [2022-04-27 11:45:51,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:51,020 INFO L225 Difference]: With dead ends: 41 [2022-04-27 11:45:51,020 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 11:45:51,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:45:51,022 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:51,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 75 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:45:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 11:45:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-27 11:45:51,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:51,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:51,028 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:51,028 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:51,030 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 11:45:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 11:45:51,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:51,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:51,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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 35 states. [2022-04-27 11:45:51,031 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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 35 states. [2022-04-27 11:45:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:51,032 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 11:45:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 11:45:51,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:51,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:51,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:51,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 11:45:51,034 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2022-04-27 11:45:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:51,034 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 11:45:51,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 15 states have internal predecessors, (22), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:45:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:45:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:45:51,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:51,035 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:51,054 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-27 11:45:51,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 11:45:51,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 1 times [2022-04-27 11:45:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186836470] [2022-04-27 11:45:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:51,265 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:51,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1233511543] [2022-04-27 11:45:51,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:51,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:51,269 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-27 11:45:51,270 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-27 11:45:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:51,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-27 11:45:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:51,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:51,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2022-04-27 11:45:51,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#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); {551#true} is VALID [2022-04-27 11:45:51,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-27 11:45:51,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #61#return; {551#true} is VALID [2022-04-27 11:45:51,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret8 := main(); {551#true} is VALID [2022-04-27 11:45:51,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {571#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:51,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {571#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:51,721 INFO L272 TraceCheckUtils]: 7: Hoare triple {571#(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)); {551#true} is VALID [2022-04-27 11:45:51,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-27 11:45:51,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-27 11:45:51,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-27 11:45:51,722 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {551#true} {571#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {571#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:51,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {593#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-27 11:45:51,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {593#(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; {597#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-27 11:45:51,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {597#(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; {601#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-27 11:45:51,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#(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; {605#(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-27 11:45:51,724 INFO L272 TraceCheckUtils]: 16: Hoare triple {605#(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)); {551#true} is VALID [2022-04-27 11:45:51,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {551#true} ~cond := #in~cond; {612#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:51,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {612#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {616#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:51,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {616#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:51,726 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {616#(not (= |__VERIFIER_assert_#in~cond| 0))} {605#(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)))} #57#return; {623#(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-27 11:45:51,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#(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); {627#(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-27 11:45:51,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {627#(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; {631#(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-27 11:45:51,729 INFO L272 TraceCheckUtils]: 23: Hoare triple {631#(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)); {635#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:51,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:51,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {552#false} is VALID [2022-04-27 11:45:51,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-27 11:45:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:45:51,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:52,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {552#false} assume !false; {552#false} is VALID [2022-04-27 11:45:52,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {639#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {552#false} is VALID [2022-04-27 11:45:52,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {635#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {639#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:52,395 INFO L272 TraceCheckUtils]: 23: Hoare triple {655#(= (+ (* 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)); {635#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:52,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {659#(= (+ (* 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; {655#(= (+ (* 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-27 11:45:52,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {663#(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); {659#(= (+ (* 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-27 11:45:52,400 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {616#(not (= |__VERIFIER_assert_#in~cond| 0))} {667#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #57#return; {663#(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-27 11:45:52,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {616#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:52,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {616#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:52,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {551#true} ~cond := #in~cond; {677#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:52,402 INFO L272 TraceCheckUtils]: 16: Hoare triple {667#(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)); {551#true} is VALID [2022-04-27 11:45:52,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {684#(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; {667#(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-27 11:45:52,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#(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; {684#(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-27 11:45:52,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {692#(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; {688#(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-27 11:45:52,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#true} assume !!(~x~0 <= ~X~0); {692#(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-27 11:45:52,409 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {551#true} {551#true} #57#return; {551#true} is VALID [2022-04-27 11:45:52,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-27 11:45:52,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#true} assume !(0 == ~cond); {551#true} is VALID [2022-04-27 11:45:52,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#true} ~cond := #in~cond; {551#true} is VALID [2022-04-27 11:45:52,410 INFO L272 TraceCheckUtils]: 7: Hoare triple {551#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {551#true} is VALID [2022-04-27 11:45:52,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {551#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {551#true} is VALID [2022-04-27 11:45:52,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {551#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {551#true} is VALID [2022-04-27 11:45:52,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {551#true} call #t~ret8 := main(); {551#true} is VALID [2022-04-27 11:45:52,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {551#true} {551#true} #61#return; {551#true} is VALID [2022-04-27 11:45:52,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {551#true} assume true; {551#true} is VALID [2022-04-27 11:45:52,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#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); {551#true} is VALID [2022-04-27 11:45:52,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {551#true} call ULTIMATE.init(); {551#true} is VALID [2022-04-27 11:45:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:45:52,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186836470] [2022-04-27 11:45:52,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:45:52,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233511543] [2022-04-27 11:45:52,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233511543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:52,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:45:52,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-27 11:45:52,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207857531] [2022-04-27 11:45:52,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 27 [2022-04-27 11:45:52,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:52,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:45:52,449 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-27 11:45:52,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 11:45:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 11:45:52,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:45:52,450 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:45:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:53,484 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 11:45:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 11:45:53,485 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 27 [2022-04-27 11:45:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:45:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2022-04-27 11:45:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:45:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2022-04-27 11:45:53,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 52 transitions. [2022-04-27 11:45:53,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:53,545 INFO L225 Difference]: With dead ends: 52 [2022-04-27 11:45:53,545 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 11:45:53,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:45:53,546 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:53,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 194 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-04-27 11:45:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 11:45:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2022-04-27 11:45:53,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:53,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:53,555 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:53,555 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:53,557 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 11:45:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 11:45:53,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:53,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:53,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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 44 states. [2022-04-27 11:45:53,558 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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 44 states. [2022-04-27 11:45:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:53,559 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-27 11:45:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 11:45:53,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:53,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:53,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:53,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 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-27 11:45:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-27 11:45:53,561 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-27 11:45:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:53,561 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-27 11:45:53,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 11:45:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:45:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:45:53,562 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:53,562 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:53,578 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-27 11:45:53,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:53,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 1 times [2022-04-27 11:45:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:53,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733279274] [2022-04-27 11:45:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:53,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171004050] [2022-04-27 11:45:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:53,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:53,786 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-27 11:45:53,787 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-27 11:45:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 11:45:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:10,353 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 11:46:20,369 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 11:46:34,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {971#true} call ULTIMATE.init(); {971#true} is VALID [2022-04-27 11:46:34,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#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); {971#true} is VALID [2022-04-27 11:46:34,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-27 11:46:34,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #61#return; {971#true} is VALID [2022-04-27 11:46:34,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret8 := main(); {971#true} is VALID [2022-04-27 11:46:34,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {971#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {991#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,762 INFO L272 TraceCheckUtils]: 7: Hoare triple {991#(= 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)); {971#true} is VALID [2022-04-27 11:46:34,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-27 11:46:34,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-27 11:46:34,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-27 11:46:34,763 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {971#true} {991#(= main_~y~0 0)} #57#return; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {991#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {991#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {991#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {991#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,776 INFO L272 TraceCheckUtils]: 16: Hoare triple {991#(= 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)); {971#true} is VALID [2022-04-27 11:46:34,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-27 11:46:34,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-27 11:46:34,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-27 11:46:34,777 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {971#true} {991#(= main_~y~0 0)} #57#return; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {991#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {991#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {991#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:34,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {991#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1049#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-27 11:46:34,778 INFO L272 TraceCheckUtils]: 25: Hoare triple {1049#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {971#true} is VALID [2022-04-27 11:46:34,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {971#true} ~cond := #in~cond; {1056#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:34,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {1056#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:34,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:34,780 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} {1049#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1067#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-27 11:46:34,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !(~x~0 <= ~X~0); {1067#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-27 11:46:36,783 WARN L290 TraceCheckUtils]: 31: Hoare triple {1067#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1074#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is UNKNOWN [2022-04-27 11:46:36,785 INFO L272 TraceCheckUtils]: 32: Hoare triple {1074#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:36,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {1078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:36,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {1082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {972#false} is VALID [2022-04-27 11:46:36,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-04-27 11:46:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 11:46:36,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:46:43,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-04-27 11:46:43,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {1082#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {972#false} is VALID [2022-04-27 11:46:43,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {1078#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1082#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:43,238 INFO L272 TraceCheckUtils]: 32: Hoare triple {1098#(= (+ (* 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)); {1078#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:43,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {1102#(= (+ (* 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; {1098#(= (+ (* 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-27 11:46:43,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {1102#(= (+ (* 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); {1102#(= (+ (* 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-27 11:46:43,242 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} {1109#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #57#return; {1102#(= (+ (* 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-27 11:46:43,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:43,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {1119#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1060#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:43,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {971#true} ~cond := #in~cond; {1119#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:46:43,249 INFO L272 TraceCheckUtils]: 25: Hoare triple {1109#(= (+ (* 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)); {971#true} is VALID [2022-04-27 11:46:43,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {991#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1109#(= (+ (* 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-27 11:46:43,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {991#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {991#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {991#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,251 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {971#true} {991#(= main_~y~0 0)} #57#return; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-27 11:46:43,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-27 11:46:43,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-27 11:46:43,251 INFO L272 TraceCheckUtils]: 16: Hoare triple {991#(= 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)); {971#true} is VALID [2022-04-27 11:46:43,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {991#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {991#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {991#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {991#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,253 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {971#true} {991#(= main_~y~0 0)} #57#return; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-27 11:46:43,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-27 11:46:43,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-27 11:46:43,253 INFO L272 TraceCheckUtils]: 7: Hoare triple {991#(= 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)); {971#true} is VALID [2022-04-27 11:46:43,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {991#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {971#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {991#(= main_~y~0 0)} is VALID [2022-04-27 11:46:43,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret8 := main(); {971#true} is VALID [2022-04-27 11:46:43,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #61#return; {971#true} is VALID [2022-04-27 11:46:43,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-27 11:46:43,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#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); {971#true} is VALID [2022-04-27 11:46:43,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {971#true} call ULTIMATE.init(); {971#true} is VALID [2022-04-27 11:46:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-27 11:46:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:43,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733279274] [2022-04-27 11:46:43,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:43,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171004050] [2022-04-27 11:46:43,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171004050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:46:43,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:46:43,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-27 11:46:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002184574] [2022-04-27 11:46:43,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:46:43,259 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-27 11:46:43,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:43,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:46:45,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:45,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:46:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:46:45,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2022-04-27 11:46:45,291 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:46:47,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:46:51,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:46:53,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:46:55,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:46:57,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:46:59,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:47:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:01,957 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-27 11:47:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:47:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-27 11:47:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:47:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:47:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-27 11:47:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:47:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-27 11:47:01,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-27 11:47:03,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:03,994 INFO L225 Difference]: With dead ends: 48 [2022-04-27 11:47:03,994 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 11:47:03,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=66, Invalid=237, Unknown=3, NotChecked=0, Total=306 [2022-04-27 11:47:03,995 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:03,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 12.2s Time] [2022-04-27 11:47:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 11:47:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-04-27 11:47:04,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:04,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:47:04,013 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:47:04,013 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:47:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:04,015 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-27 11:47:04,015 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-27 11:47:04,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:04,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:04,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-27 11:47:04,015 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-27 11:47:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:04,020 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-04-27 11:47:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-27 11:47:04,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:04,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:04,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:04,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:47:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 11:47:04,022 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 36 [2022-04-27 11:47:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:04,023 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 11:47:04,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 2.4) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:47:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 11:47:04,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:47:04,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:47:04,023 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:04,042 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-27 11:47:04,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:04,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:47:04,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:47:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 1 times [2022-04-27 11:47:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:47:04,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989284678] [2022-04-27 11:47:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:47:04,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:47:04,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158253443] [2022-04-27 11:47:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:04,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:04,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:47:04,245 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-27 11:47:04,246 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-27 11:47:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:04,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:47:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:04,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:47:06,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {1412#true} call ULTIMATE.init(); {1412#true} is VALID [2022-04-27 11:47:06,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {1412#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); {1412#true} is VALID [2022-04-27 11:47:06,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:06,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1412#true} {1412#true} #61#return; {1412#true} is VALID [2022-04-27 11:47:06,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {1412#true} call #t~ret8 := main(); {1412#true} is VALID [2022-04-27 11:47:06,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1432#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 11:47:06,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {1432#(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; {1432#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 11:47:06,714 INFO L272 TraceCheckUtils]: 7: Hoare triple {1432#(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)); {1412#true} is VALID [2022-04-27 11:47:06,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {1412#true} ~cond := #in~cond; {1412#true} is VALID [2022-04-27 11:47:06,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {1412#true} assume !(0 == ~cond); {1412#true} is VALID [2022-04-27 11:47:06,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:06,715 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1412#true} {1432#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #57#return; {1432#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 11:47:06,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {1432#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {1432#(and (<= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-27 11:47:06,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {1432#(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; {1457#(and (<= main_~x~0 0) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-27 11:47:06,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {1457#(and (<= main_~x~0 0) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-27 11:47:06,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-27 11:47:06,717 INFO L272 TraceCheckUtils]: 16: Hoare triple {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1412#true} is VALID [2022-04-27 11:47:06,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {1412#true} ~cond := #in~cond; {1412#true} is VALID [2022-04-27 11:47:06,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {1412#true} assume !(0 == ~cond); {1412#true} is VALID [2022-04-27 11:47:06,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:06,718 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1412#true} {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} #57#return; {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-27 11:47:06,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume !!(~x~0 <= ~X~0); {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} is VALID [2022-04-27 11:47:06,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {1461#(and (<= main_~x~0 1) (<= (+ (div (+ (- 1) main_~X~0) 2) 1) (div (+ main_~v~0 (* main_~X~0 3)) 4)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1486#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 1))} is VALID [2022-04-27 11:47:06,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {1486#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-27 11:47:06,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-27 11:47:06,725 INFO L272 TraceCheckUtils]: 25: Hoare triple {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= 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)); {1412#true} is VALID [2022-04-27 11:47:06,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {1412#true} ~cond := #in~cond; {1412#true} is VALID [2022-04-27 11:47:06,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {1412#true} assume !(0 == ~cond); {1412#true} is VALID [2022-04-27 11:47:06,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:06,726 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1412#true} {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} #57#return; {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} is VALID [2022-04-27 11:47:06,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {1490#(and (< (div (+ (- 1) main_~X~0) 2) (div (+ (- 1) (* main_~X~0 3)) 4)) (<= main_~x~0 2))} assume !(~x~0 <= ~X~0); {1413#false} is VALID [2022-04-27 11:47:06,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {1413#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1413#false} is VALID [2022-04-27 11:47:06,727 INFO L272 TraceCheckUtils]: 32: Hoare triple {1413#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)); {1413#false} is VALID [2022-04-27 11:47:06,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {1413#false} ~cond := #in~cond; {1413#false} is VALID [2022-04-27 11:47:06,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {1413#false} assume 0 == ~cond; {1413#false} is VALID [2022-04-27 11:47:06,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {1413#false} assume !false; {1413#false} is VALID [2022-04-27 11:47:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:47:06,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:47:07,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {1413#false} assume !false; {1413#false} is VALID [2022-04-27 11:47:07,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {1413#false} assume 0 == ~cond; {1413#false} is VALID [2022-04-27 11:47:07,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {1413#false} ~cond := #in~cond; {1413#false} is VALID [2022-04-27 11:47:07,064 INFO L272 TraceCheckUtils]: 32: Hoare triple {1413#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)); {1413#false} is VALID [2022-04-27 11:47:07,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {1413#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1413#false} is VALID [2022-04-27 11:47:07,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {1542#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {1413#false} is VALID [2022-04-27 11:47:07,065 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1412#true} {1542#(<= main_~x~0 main_~X~0)} #57#return; {1542#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 11:47:07,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:07,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {1412#true} assume !(0 == ~cond); {1412#true} is VALID [2022-04-27 11:47:07,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {1412#true} ~cond := #in~cond; {1412#true} is VALID [2022-04-27 11:47:07,065 INFO L272 TraceCheckUtils]: 25: Hoare triple {1542#(<= 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)); {1412#true} is VALID [2022-04-27 11:47:07,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {1542#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1542#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 11:47:07,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {1564#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1542#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 11:47:07,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1564#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 11:47:07,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 11:47:07,067 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1412#true} {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} #57#return; {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 11:47:07,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:07,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {1412#true} assume !(0 == ~cond); {1412#true} is VALID [2022-04-27 11:47:07,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {1412#true} ~cond := #in~cond; {1412#true} is VALID [2022-04-27 11:47:07,068 INFO L272 TraceCheckUtils]: 16: Hoare triple {1568#(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)); {1412#true} is VALID [2022-04-27 11:47:07,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {1568#(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; {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 11:47:07,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {1593#(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; {1568#(or (not (< main_~v~0 0)) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-27 11:47:07,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#(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; {1593#(or (<= (+ main_~x~0 2) main_~X~0) (not (< main_~v~0 0)))} is VALID [2022-04-27 11:47:07,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#(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); {1597#(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-27 11:47:07,071 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1412#true} {1597#(or (<= (+ main_~x~0 2) main_~X~0) (<= (* main_~X~0 2) (+ main_~v~0 (* main_~Y~0 2))) (< main_~v~0 0))} #57#return; {1597#(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-27 11:47:07,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:07,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {1412#true} assume !(0 == ~cond); {1412#true} is VALID [2022-04-27 11:47:07,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1412#true} ~cond := #in~cond; {1412#true} is VALID [2022-04-27 11:47:07,071 INFO L272 TraceCheckUtils]: 7: Hoare triple {1597#(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)); {1412#true} is VALID [2022-04-27 11:47:07,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {1597#(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; {1597#(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-27 11:47:07,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1412#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1597#(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-27 11:47:07,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1412#true} call #t~ret8 := main(); {1412#true} is VALID [2022-04-27 11:47:07,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1412#true} {1412#true} #61#return; {1412#true} is VALID [2022-04-27 11:47:07,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {1412#true} assume true; {1412#true} is VALID [2022-04-27 11:47:07,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1412#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); {1412#true} is VALID [2022-04-27 11:47:07,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {1412#true} call ULTIMATE.init(); {1412#true} is VALID [2022-04-27 11:47:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 11:47:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:47:07,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989284678] [2022-04-27 11:47:07,078 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:47:07,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158253443] [2022-04-27 11:47:07,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158253443] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:47:07,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:47:07,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 11:47:07,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289353241] [2022-04-27 11:47:07,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:47:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 36 [2022-04-27 11:47:07,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:47:07,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:07,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:07,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:47:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:47:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:47:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:47:07,117 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:07,647 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-27 11:47:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:47:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 36 [2022-04-27 11:47:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:47:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-27 11:47:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-27 11:47:07,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2022-04-27 11:47:07,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:07,706 INFO L225 Difference]: With dead ends: 57 [2022-04-27 11:47:07,706 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 11:47:07,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:47:07,707 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:07,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:47:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 11:47:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-04-27 11:47:07,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:07,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:47:07,725 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:47:07,725 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:47:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:07,727 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-27 11:47:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-27 11:47:07,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:07,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:07,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-04-27 11:47:07,728 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-04-27 11:47:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:07,729 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-04-27 11:47:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-27 11:47:07,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:07,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:07,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:07,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:47:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-04-27 11:47:07,731 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 36 [2022-04-27 11:47:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:07,731 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-04-27 11:47:07,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-04-27 11:47:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 11:47:07,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:47:07,732 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:07,751 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-27 11:47:07,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:07,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:47:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:47:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash 714840404, now seen corresponding path program 2 times [2022-04-27 11:47:07,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:47:07,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395681823] [2022-04-27 11:47:07,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:07,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:47:07,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:47:07,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394473070] [2022-04-27 11:47:07,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:47:07,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:07,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:47:07,970 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-27 11:47:07,971 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-27 11:47:08,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:47:08,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:47:08,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:47:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:08,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:47:08,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {1889#true} call ULTIMATE.init(); {1889#true} is VALID [2022-04-27 11:47:08,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#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); {1889#true} is VALID [2022-04-27 11:47:08,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:08,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1889#true} {1889#true} #61#return; {1889#true} is VALID [2022-04-27 11:47:08,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {1889#true} call #t~ret8 := main(); {1889#true} is VALID [2022-04-27 11:47:08,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {1889#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-27 11:47:09,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-27 11:47:09,004 INFO L272 TraceCheckUtils]: 7: Hoare triple {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1889#true} is VALID [2022-04-27 11:47:09,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,005 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1889#true} {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #57#return; {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-27 11:47:09,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-27 11:47:09,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1909#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1934#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-27 11:47:09,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {1934#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-27 11:47:09,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-27 11:47:09,007 INFO L272 TraceCheckUtils]: 16: Hoare triple {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1889#true} is VALID [2022-04-27 11:47:09,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,009 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1889#true} {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #57#return; {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-27 11:47:09,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-27 11:47:09,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {1938#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1963#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {1963#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,011 INFO L272 TraceCheckUtils]: 25: Hoare triple {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1889#true} is VALID [2022-04-27 11:47:09,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,012 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1889#true} {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #57#return; {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(~x~0 <= ~X~0); {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {1967#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,014 INFO L272 TraceCheckUtils]: 34: Hoare triple {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1889#true} is VALID [2022-04-27 11:47:09,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,015 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1889#true} {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} #57#return; {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-27 11:47:09,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {1995#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {1890#false} is VALID [2022-04-27 11:47:09,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {1890#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1890#false} is VALID [2022-04-27 11:47:09,016 INFO L272 TraceCheckUtils]: 41: Hoare triple {1890#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)); {1890#false} is VALID [2022-04-27 11:47:09,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {1890#false} ~cond := #in~cond; {1890#false} is VALID [2022-04-27 11:47:09,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {1890#false} assume 0 == ~cond; {1890#false} is VALID [2022-04-27 11:47:09,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2022-04-27 11:47:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:47:09,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:47:09,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {1890#false} assume !false; {1890#false} is VALID [2022-04-27 11:47:09,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {1890#false} assume 0 == ~cond; {1890#false} is VALID [2022-04-27 11:47:09,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {1890#false} ~cond := #in~cond; {1890#false} is VALID [2022-04-27 11:47:09,330 INFO L272 TraceCheckUtils]: 41: Hoare triple {1890#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)); {1890#false} is VALID [2022-04-27 11:47:09,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {1890#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1890#false} is VALID [2022-04-27 11:47:09,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {2047#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {1890#false} is VALID [2022-04-27 11:47:09,331 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1889#true} {2047#(<= main_~x~0 main_~X~0)} #57#return; {2047#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 11:47:09,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,331 INFO L272 TraceCheckUtils]: 34: Hoare triple {2047#(<= 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)); {1889#true} is VALID [2022-04-27 11:47:09,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {2047#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2047#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 11:47:09,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {2069#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2047#(<= main_~x~0 main_~X~0)} is VALID [2022-04-27 11:47:09,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {2069#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2069#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 11:47:09,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {2069#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {2069#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 11:47:09,334 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1889#true} {2069#(<= (+ main_~x~0 1) main_~X~0)} #57#return; {2069#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 11:47:09,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,334 INFO L272 TraceCheckUtils]: 25: Hoare triple {2069#(<= (+ 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)); {1889#true} is VALID [2022-04-27 11:47:09,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {2069#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2069#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 11:47:09,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {2097#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2069#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-27 11:47:09,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< 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; {2097#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-27 11:47:09,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-27 11:47:09,336 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1889#true} {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #57#return; {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-27 11:47:09,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,336 INFO L272 TraceCheckUtils]: 16: Hoare triple {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< 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)); {1889#true} is VALID [2022-04-27 11:47:09,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-27 11:47:09,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {2126#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2101#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-27 11:47:09,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2126#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-27 11:47:09,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !!(~x~0 <= ~X~0); {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-27 11:47:09,339 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1889#true} {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #57#return; {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-27 11:47:09,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {1889#true} assume !(0 == ~cond); {1889#true} is VALID [2022-04-27 11:47:09,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {1889#true} ~cond := #in~cond; {1889#true} is VALID [2022-04-27 11:47:09,339 INFO L272 TraceCheckUtils]: 7: Hoare triple {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) 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)); {1889#true} is VALID [2022-04-27 11:47:09,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-27 11:47:09,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {1889#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2130#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-27 11:47:09,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {1889#true} call #t~ret8 := main(); {1889#true} is VALID [2022-04-27 11:47:09,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1889#true} {1889#true} #61#return; {1889#true} is VALID [2022-04-27 11:47:09,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {1889#true} assume true; {1889#true} is VALID [2022-04-27 11:47:09,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {1889#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); {1889#true} is VALID [2022-04-27 11:47:09,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {1889#true} call ULTIMATE.init(); {1889#true} is VALID [2022-04-27 11:47:09,341 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:47:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:47:09,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395681823] [2022-04-27 11:47:09,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:47:09,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394473070] [2022-04-27 11:47:09,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394473070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:47:09,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:47:09,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 11:47:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387091987] [2022-04-27 11:47:09,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:47:09,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 45 [2022-04-27 11:47:09,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:47:09,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:47:09,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:47:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:47:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:47:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:47:09,400 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:47:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:09,970 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-04-27 11:47:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:47:09,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 45 [2022-04-27 11:47:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:47:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:47:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-27 11:47:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:47:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-27 11:47:09,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2022-04-27 11:47:10,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:10,021 INFO L225 Difference]: With dead ends: 70 [2022-04-27 11:47:10,021 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 11:47:10,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:47:10,021 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:10,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:47:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 11:47:10,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-04-27 11:47:10,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:10,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:10,048 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:10,048 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:10,050 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-27 11:47:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-27 11:47:10,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:10,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:10,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 64 states. [2022-04-27 11:47:10,051 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 64 states. [2022-04-27 11:47:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:10,052 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-27 11:47:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-27 11:47:10,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:10,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:10,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:10,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:47:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-27 11:47:10,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 45 [2022-04-27 11:47:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:10,054 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-27 11:47:10,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:47:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-27 11:47:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 11:47:10,058 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:47:10,058 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:10,081 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-27 11:47:10,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:10,275 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:47:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:47:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1499928944, now seen corresponding path program 3 times [2022-04-27 11:47:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:47:10,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174647843] [2022-04-27 11:47:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:47:10,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:47:10,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999286011] [2022-04-27 11:47:10,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:47:10,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:10,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:47:10,291 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-27 11:47:10,292 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-27 11:47:10,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:47:10,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:47:10,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:47:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:10,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:47:28,184 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 11:47:37,586 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 11:47:43,604 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 11:47:49,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~X~0 1)) (.cse2 (+ (* (- 1) c_main_~Y~0) (div (+ c_main_~v~0 c_main_~X~0) 2) (* c_main_~X~0 c_main_~y~0))) (.cse0 (= c_main_~Y~0 0)) (.cse4 (= (mod (+ (* 2 c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2) 0))) (or (let ((.cse1 (div .cse2 c_main_~Y~0))) (and (not .cse0) (not (<= .cse1 c_main_~X~0)) (= (mod .cse2 c_main_~Y~0) 0) (= c_main_~xy~0 (* c_main_~y~0 .cse1)) (<= .cse1 .cse3) (= c_main_~yx~0 (* c_main_~Y~0 .cse1)) .cse4)) (and (let ((.cse6 (= c_main_~y~0 0))) (or (let ((.cse5 (div c_main_~xy~0 c_main_~y~0))) (and (<= .cse5 .cse3) (= (mod c_main_~xy~0 c_main_~y~0) 0) (not .cse6) (< c_main_~X~0 .cse5))) (and .cse6 (= c_main_~xy~0 0)))) (= 0 .cse2) .cse0 (= c_main_~yx~0 0) .cse4))) is different from false