/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 15:13:11,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 15:13:11,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 15:13:11,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 15:13:11,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 15:13:11,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 15:13:11,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 15:13:11,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 15:13:11,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 15:13:11,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 15:13:11,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 15:13:11,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 15:13:11,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 15:13:11,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 15:13:11,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 15:13:11,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 15:13:11,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 15:13:11,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 15:13:11,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 15:13:11,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 15:13:11,586 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 15:13:11,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 15:13:11,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 15:13:11,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 15:13:11,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 15:13:11,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 15:13:11,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 15:13:11,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 15:13:11,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 15:13:11,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 15:13:11,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 15:13:11,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 15:13:11,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 15:13:11,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 15:13:11,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 15:13:11,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 15:13:11,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 15:13:11,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 15:13:11,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 15:13:11,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 15:13:11,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 15:13:11,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 15:13:11,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 15:13:11,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 15:13:11,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 15:13:11,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 15:13:11,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 15:13:11,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 15:13:11,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 15:13:11,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 15:13:11,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 15:13:11,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 15:13:11,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:13:11,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 15:13:11,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 15:13:11,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 15:13:11,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 15:13:11,612 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 15:13:11,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 15:13:11,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 15:13:11,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 15:13:11,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 15:13:11,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 15:13:11,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 15:13:11,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 15:13:11,788 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 15:13:11,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c [2022-04-07 15:13:11,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90650f549/6d2dfab3ac744e3082d1d62bb25cc32f/FLAG1ec25f68a [2022-04-07 15:13:12,228 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 15:13:12,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c [2022-04-07 15:13:12,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90650f549/6d2dfab3ac744e3082d1d62bb25cc32f/FLAG1ec25f68a [2022-04-07 15:13:12,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90650f549/6d2dfab3ac744e3082d1d62bb25cc32f [2022-04-07 15:13:12,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 15:13:12,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 15:13:12,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 15:13:12,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 15:13:12,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 15:13:12,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562d2dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12, skipping insertion in model container [2022-04-07 15:13:12,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 15:13:12,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 15:13:12,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c[537,550] [2022-04-07 15:13:12,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:13:12,407 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 15:13:12,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound20.c[537,550] [2022-04-07 15:13:12,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 15:13:12,429 INFO L208 MainTranslator]: Completed translation [2022-04-07 15:13:12,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12 WrapperNode [2022-04-07 15:13:12,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 15:13:12,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 15:13:12,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 15:13:12,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 15:13:12,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 15:13:12,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 15:13:12,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 15:13:12,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 15:13:12,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (1/1) ... [2022-04-07 15:13:12,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 15:13:12,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:13:12,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 15:13:12,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 15:13:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 15:13:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 15:13:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 15:13:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 15:13:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 15:13:12,494 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 15:13:12,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 15:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 15:13:12,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 15:13:12,542 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 15:13:12,543 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 15:13:12,711 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 15:13:12,716 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 15:13:12,716 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 15:13:12,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:13:12 BoogieIcfgContainer [2022-04-07 15:13:12,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 15:13:12,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 15:13:12,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 15:13:12,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 15:13:12,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 03:13:12" (1/3) ... [2022-04-07 15:13:12,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e39481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:13:12, skipping insertion in model container [2022-04-07 15:13:12,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 03:13:12" (2/3) ... [2022-04-07 15:13:12,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e39481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:13:12, skipping insertion in model container [2022-04-07 15:13:12,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:13:12" (3/3) ... [2022-04-07 15:13:12,722 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound20.c [2022-04-07 15:13:12,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 15:13:12,725 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 15:13:12,774 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 15:13:12,785 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 15:13:12,786 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 15:13:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:13:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:13:12,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:13:12,812 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:13:12,812 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:13:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:13:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-07 15:13:12,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:13:12,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404779444] [2022-04-07 15:13:12,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:13:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 15:13:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:12,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 15:13:12,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:13:12,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:13:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 15:13:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:13,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:13:13,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:13:13,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:13:13,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:13:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 15:13:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:13,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:13:13,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:13:13,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:13:13,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:13:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 15:13:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:13,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:13:13,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:13:13,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:13:13,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:13:13,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 15:13:13,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-07 15:13:13,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-07 15:13:13,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-07 15:13:13,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-07 15:13:13,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-07 15:13:13,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {35#true} is VALID [2022-04-07 15:13:13,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:13:13,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:13:13,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:13:13,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-07 15:13:13,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-07 15:13:13,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {35#true} is VALID [2022-04-07 15:13:13,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:13:13,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:13:13,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:13:13,047 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-07 15:13:13,047 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-07 15:13:13,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-07 15:13:13,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-07 15:13:13,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-07 15:13:13,048 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-07 15:13:13,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-07 15:13:13,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-07 15:13:13,049 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-07 15:13:13,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-07 15:13:13,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-07 15:13:13,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-07 15:13:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:13:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:13,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404779444] [2022-04-07 15:13:13,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404779444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:13:13,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:13:13,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 15:13:13,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885232817] [2022-04-07 15:13:13,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:13:13,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 15:13:13,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:13,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:13:13,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:13,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 15:13:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:13,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 15:13:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:13:13,116 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:13:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:13,238 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-07 15:13:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 15:13:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 15:13:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:13:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:13:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:13:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:13:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-07 15:13:13,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-07 15:13:13,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:13,367 INFO L225 Difference]: With dead ends: 57 [2022-04-07 15:13:13,367 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 15:13:13,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 15:13:13,372 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:13:13,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:13:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 15:13:13,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 15:13:13,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:13:13,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:13:13,403 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:13:13,403 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:13:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:13,413 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:13:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:13:13,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:13,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:13,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-07 15:13:13,415 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-07 15:13:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:13,419 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-07 15:13:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:13:13,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:13,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:13,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:13:13,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:13:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 15:13:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-07 15:13:13,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-07 15:13:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:13:13,423 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-07 15:13:13,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 15:13:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-07 15:13:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 15:13:13,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:13:13,424 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:13:13,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 15:13:13,425 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:13:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:13:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-07 15:13:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:13:13,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184705629] [2022-04-07 15:13:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:13:13,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:13:13,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841534419] [2022-04-07 15:13:13,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:13,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:13,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:13:13,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:13:13,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 15:13:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:13,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 15:13:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:13,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:13:13,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-07 15:13:13,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {224#true} is VALID [2022-04-07 15:13:13,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:13:13,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-07 15:13:13,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-07 15:13:13,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {224#true} is VALID [2022-04-07 15:13:13,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {224#true} is VALID [2022-04-07 15:13:13,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:13:13,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:13:13,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:13:13,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-07 15:13:13,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-07 15:13:13,695 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {224#true} is VALID [2022-04-07 15:13:13,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:13:13,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:13:13,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:13:13,696 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-07 15:13:13,696 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-07 15:13:13,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-07 15:13:13,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-07 15:13:13,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-07 15:13:13,696 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-07 15:13:13,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:13,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:13,703 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:13,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:13,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-07 15:13:13,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-07 15:13:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:13:13,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:13:13,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:13,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184705629] [2022-04-07 15:13:13,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:13:13,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841534419] [2022-04-07 15:13:13,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841534419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:13:13,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:13:13,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 15:13:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429698035] [2022-04-07 15:13:13,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:13:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 15:13:13,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:13,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:13:13,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:13,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 15:13:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 15:13:13,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 15:13:13,726 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:13:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:13,858 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-07 15:13:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 15:13:13,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 15:13:13,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:13:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:13:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:13:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:13:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-07 15:13:13,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-07 15:13:13,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:13,909 INFO L225 Difference]: With dead ends: 39 [2022-04-07 15:13:13,909 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 15:13:13,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:13:13,911 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:13:13,912 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:13:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 15:13:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-07 15:13:13,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:13:13,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:13,921 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:13,922 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:13,926 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:13:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:13:13,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:13,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:13,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:13:13,934 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-07 15:13:13,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:13,939 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 15:13:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 15:13:13,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:13,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:13,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:13:13,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:13:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-07 15:13:13,943 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-07 15:13:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:13:13,943 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-07 15:13:13,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 15:13:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-07 15:13:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 15:13:13,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:13:13,944 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:13:13,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 15:13:14,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:14,156 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:13:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:13:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-07 15:13:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:13:14,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703242070] [2022-04-07 15:13:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:14,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:13:14,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:13:14,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908752955] [2022-04-07 15:13:14,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:14,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:14,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:13:14,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:13:14,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 15:13:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:14,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 15:13:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:14,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:13:14,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-07 15:13:14,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {491#true} is VALID [2022-04-07 15:13:14,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:13:14,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-07 15:13:14,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-07 15:13:14,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {491#true} is VALID [2022-04-07 15:13:14,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {491#true} is VALID [2022-04-07 15:13:14,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:13:14,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:13:14,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:13:14,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-07 15:13:14,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-07 15:13:14,380 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {491#true} is VALID [2022-04-07 15:13:14,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:13:14,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:13:14,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:13:14,381 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-07 15:13:14,381 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-07 15:13:14,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:13:14,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:14,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:14,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-07 15:13:14,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:13:14,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:13:14,385 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-07 15:13:14,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-07 15:13:14,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-07 15:13:14,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-07 15:13:14,386 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-07 15:13:14,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-07 15:13:14,386 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-07 15:13:14,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-07 15:13:14,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-07 15:13:14,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-07 15:13:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:13:14,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 15:13:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703242070] [2022-04-07 15:13:14,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:13:14,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908752955] [2022-04-07 15:13:14,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908752955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 15:13:14,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 15:13:14,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 15:13:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027596036] [2022-04-07 15:13:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:13:14,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 15:13:14,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:14,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:14,408 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-07 15:13:14,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 15:13:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:14,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 15:13:14,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 15:13:14,409 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:14,558 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-07 15:13:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 15:13:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 15:13:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:13:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:13:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 15:13:14,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 15:13:14,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:14,593 INFO L225 Difference]: With dead ends: 43 [2022-04-07 15:13:14,593 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 15:13:14,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 15:13:14,594 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:13:14,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 15:13:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 15:13:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-07 15:13:14,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:13:14,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:14,602 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:14,602 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:14,604 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:13:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:13:14,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:14,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:14,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-07 15:13:14,605 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-07 15:13:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:14,606 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 15:13:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 15:13:14,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:14,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:14,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:13:14,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:13:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 15:13:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-07 15:13:14,608 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-07 15:13:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:13:14,608 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-07 15:13:14,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-07 15:13:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:13:14,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:13:14,609 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:13:14,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 15:13:14,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 15:13:14,826 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:13:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:13:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-07 15:13:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:13:14,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086833733] [2022-04-07 15:13:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:13:14,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:13:14,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578888615] [2022-04-07 15:13:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:14,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:13:14,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:13:14,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 15:13:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:14,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 15:13:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:14,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:13:17,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:13:17,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-07 15:13:17,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:17,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:13:17,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:13:17,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-07 15:13:17,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:17,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:17,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:17,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:17,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:13:17,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-07 15:13:17,357 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:17,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:17,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:17,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:17,358 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:13:17,358 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:17,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:17,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:17,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:17,358 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:13:17,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:17,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:17,359 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:17,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:17,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:17,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:17,377 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:17,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:17,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {876#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:13:17,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {880#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:13:17,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:13:17,947 INFO L272 TraceCheckUtils]: 33: Hoare triple {884#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:17,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:17,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:13:17,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:13:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:13:17,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:13:44,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-07 15:13:44,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {895#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-07 15:13:44,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {891#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {895#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:44,642 INFO L272 TraceCheckUtils]: 33: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {891#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:44,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:13:44,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {918#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {911#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:13:44,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {918#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:13:44,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:44,650 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {783#true} {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #67#return; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:44,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:44,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:44,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:44,650 INFO L272 TraceCheckUtils]: 24: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:44,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:46,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {922#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-07 15:13:46,543 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-07 15:13:46,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:46,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:46,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:46,544 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-07 15:13:46,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-07 15:13:46,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {783#true} is VALID [2022-04-07 15:13:46,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {783#true} is VALID [2022-04-07 15:13:46,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-07 15:13:46,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-07 15:13:46,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-07 15:13:46,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {783#true} is VALID [2022-04-07 15:13:46,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-07 15:13:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 15:13:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:13:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086833733] [2022-04-07 15:13:46,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:13:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578888615] [2022-04-07 15:13:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578888615] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 15:13:46,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:13:46,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-07 15:13:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326430032] [2022-04-07 15:13:46,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 15:13:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-07 15:13:46,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:13:46,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:46,837 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-07 15:13:46,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 15:13:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:13:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 15:13:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2022-04-07 15:13:46,838 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:48,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:13:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:49,133 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-07 15:13:49,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 15:13:49,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-07 15:13:49,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:13:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-07 15:13:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:49,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-07 15:13:49,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-07 15:13:49,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:13:49,172 INFO L225 Difference]: With dead ends: 47 [2022-04-07 15:13:49,172 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 15:13:49,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=39, Invalid=116, Unknown=1, NotChecked=0, Total=156 [2022-04-07 15:13:49,173 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-07 15:13:49,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 116 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-07 15:13:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 15:13:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-07 15:13:49,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:13:49,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:13:49,193 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:13:49,193 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:13:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:49,195 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-07 15:13:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-07 15:13:49,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:49,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:49,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-07 15:13:49,195 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-07 15:13:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:13:49,197 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-07 15:13:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-07 15:13:49,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:13:49,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:13:49,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:13:49,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:13:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 15:13:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-07 15:13:49,199 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2022-04-07 15:13:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:13:49,199 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-07 15:13:49,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 15:13:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-07 15:13:49,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 15:13:49,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:13:49,200 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:13:49,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 15:13:49,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:49,415 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:13:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:13:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-07 15:13:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:13:49,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361677024] [2022-04-07 15:13:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:13:49,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:13:49,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52565978] [2022-04-07 15:13:49,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:13:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:13:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:13:49,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:13:49,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 15:13:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:49,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 15:13:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:13:49,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:13:50,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #71#return; {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret6 := main(); {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-07 15:13:50,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1236#true} {1236#true} #61#return; {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L272 TraceCheckUtils]: 12: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2022-04-07 15:13:50,717 INFO L272 TraceCheckUtils]: 17: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:13:50,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#true} ~cond := #in~cond; {1295#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:13:50,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {1295#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:50,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:13:50,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} {1236#true} #65#return; {1306#(<= 1 main_~b~0)} is VALID [2022-04-07 15:13:50,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {1306#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:50,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:50,722 INFO L272 TraceCheckUtils]: 24: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:13:50,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {1236#true} ~cond := #in~cond; {1320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:50,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {1320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:13:50,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:13:50,724 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:50,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:50,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {1310#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1337#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:13:50,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {1337#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-07 15:13:50,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-07 15:13:50,728 INFO L272 TraceCheckUtils]: 33: Hoare triple {1341#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:13:50,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:13:50,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {1352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1237#false} is VALID [2022-04-07 15:13:50,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-04-07 15:13:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:13:50,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:14:18,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#false} assume !false; {1237#false} is VALID [2022-04-07 15:14:18,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {1352#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1237#false} is VALID [2022-04-07 15:14:18,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1352#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:18,618 INFO L272 TraceCheckUtils]: 33: Hoare triple {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1348#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:18,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:14:18,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {1375#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1368#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:14:18,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1375#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:14:18,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:14:18,627 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {1379#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:14:18,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:18,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {1396#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:18,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {1236#true} ~cond := #in~cond; {1396#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:14:18,628 INFO L272 TraceCheckUtils]: 24: Hoare triple {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:14:18,628 INFO L290 TraceCheckUtils]: 23: Hoare triple {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:14:18,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {1406#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1386#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:14:18,629 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} {1236#true} #65#return; {1406#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:14:18,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:14:18,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {1419#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1299#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:14:18,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {1236#true} ~cond := #in~cond; {1419#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:14:18,630 INFO L272 TraceCheckUtils]: 17: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:14:18,630 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1236#true} {1236#true} #63#return; {1236#true} is VALID [2022-04-07 15:14:18,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L272 TraceCheckUtils]: 12: Hoare triple {1236#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {1236#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1236#true} {1236#true} #61#return; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#true} assume !(0 == ~cond); {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#true} ~cond := #in~cond; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1236#true} is VALID [2022-04-07 15:14:18,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#true} call #t~ret6 := main(); {1236#true} is VALID [2022-04-07 15:14:18,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#true} {1236#true} #71#return; {1236#true} is VALID [2022-04-07 15:14:18,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#true} assume true; {1236#true} is VALID [2022-04-07 15:14:18,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {1236#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1236#true} is VALID [2022-04-07 15:14:18,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {1236#true} call ULTIMATE.init(); {1236#true} is VALID [2022-04-07 15:14:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-07 15:14:18,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:18,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361677024] [2022-04-07 15:14:18,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:14:18,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52565978] [2022-04-07 15:14:18,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52565978] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:14:18,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:14:18,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-07 15:14:18,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634714582] [2022-04-07 15:14:18,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:14:18,633 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-07 15:14:18,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:18,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:18,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:18,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 15:14:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:18,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 15:14:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-07 15:14:18,672 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:21,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:21,072 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-04-07 15:14:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-07 15:14:21,072 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-07 15:14:21,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:14:21,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-07 15:14:21,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-07 15:14:21,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:21,146 INFO L225 Difference]: With dead ends: 68 [2022-04-07 15:14:21,146 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 15:14:21,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-07 15:14:21,147 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:21,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-07 15:14:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 15:14:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-07 15:14:21,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:21,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:21,167 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:21,167 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:21,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:21,169 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 15:14:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 15:14:21,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:21,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:21,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-07 15:14:21,169 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-07 15:14:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:21,172 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-07 15:14:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 15:14:21,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:21,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:21,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:21,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-07 15:14:21,175 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 37 [2022-04-07 15:14:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:21,175 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-07 15:14:21,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 15:14:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-07 15:14:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 15:14:21,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:21,176 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:21,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 15:14:21,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:21,395 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-07 15:14:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:21,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408177087] [2022-04-07 15:14:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:21,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:21,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875925226] [2022-04-07 15:14:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:21,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:14:21,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 15:14:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 15:14:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:21,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:14:27,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {1793#true} call ULTIMATE.init(); {1793#true} is VALID [2022-04-07 15:14:27,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1793#true} {1793#true} #71#return; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {1793#true} call #t~ret6 := main(); {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {1793#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1793#true} {1793#true} #61#return; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {1793#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1793#true} is VALID [2022-04-07 15:14:27,749 INFO L272 TraceCheckUtils]: 12: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1793#true} {1793#true} #63#return; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L272 TraceCheckUtils]: 17: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1793#true} {1793#true} #65#return; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-07 15:14:27,750 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:27,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:27,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:27,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:27,751 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1793#true} {1793#true} #67#return; {1793#true} is VALID [2022-04-07 15:14:27,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {1793#true} assume !!(0 != ~y~0); {1793#true} is VALID [2022-04-07 15:14:27,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {1793#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1793#true} is VALID [2022-04-07 15:14:27,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {1793#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1793#true} is VALID [2022-04-07 15:14:27,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-07 15:14:27,752 INFO L272 TraceCheckUtils]: 33: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:27,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#true} ~cond := #in~cond; {1900#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:27,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {1900#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:27,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:29,758 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} {1793#true} #67#return; {1911#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-07 15:14:29,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {1911#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:14:29,759 INFO L272 TraceCheckUtils]: 39: Hoare triple {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:29,769 INFO L290 TraceCheckUtils]: 40: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:29,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1794#false} is VALID [2022-04-07 15:14:29,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {1794#false} assume !false; {1794#false} is VALID [2022-04-07 15:14:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 15:14:29,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:14:41,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {1794#false} assume !false; {1794#false} is VALID [2022-04-07 15:14:41,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {1923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1794#false} is VALID [2022-04-07 15:14:41,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:14:41,714 INFO L272 TraceCheckUtils]: 39: Hoare triple {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:14:41,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {1942#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1915#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:14:41,715 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} {1793#true} #67#return; {1942#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:14:41,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:41,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {1955#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1904#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:14:41,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#true} ~cond := #in~cond; {1955#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:14:41,717 INFO L272 TraceCheckUtils]: 33: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {1793#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {1793#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {1793#true} assume !!(0 != ~y~0); {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1793#true} {1793#true} #67#return; {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L272 TraceCheckUtils]: 24: Hoare triple {1793#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#true} assume !false; {1793#true} is VALID [2022-04-07 15:14:41,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1793#true} {1793#true} #65#return; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L272 TraceCheckUtils]: 17: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1793#true} {1793#true} #63#return; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L272 TraceCheckUtils]: 12: Hoare triple {1793#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:41,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1793#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1793#true} {1793#true} #61#return; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {1793#true} assume !(0 == ~cond); {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {1793#true} ~cond := #in~cond; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {1793#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {1793#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {1793#true} call #t~ret6 := main(); {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1793#true} {1793#true} #71#return; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1793#true} assume true; {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {1793#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1793#true} is VALID [2022-04-07 15:14:41,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {1793#true} call ULTIMATE.init(); {1793#true} is VALID [2022-04-07 15:14:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 15:14:41,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:14:41,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408177087] [2022-04-07 15:14:41,720 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:14:41,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875925226] [2022-04-07 15:14:41,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875925226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:14:41,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:14:41,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 15:14:41,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139994677] [2022-04-07 15:14:41,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:14:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-07 15:14:41,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:14:41,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:43,748 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-07 15:14:43,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 15:14:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:14:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 15:14:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 15:14:43,749 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:45,794 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-07 15:14:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:46,003 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-04-07 15:14:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 15:14:46,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-07 15:14:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:14:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-07 15:14:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-07 15:14:46,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-07 15:14:50,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 15:14:50,042 INFO L225 Difference]: With dead ends: 68 [2022-04-07 15:14:50,042 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 15:14:50,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 15:14:50,043 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 15:14:50,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 15:14:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 15:14:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-07 15:14:50,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:14:50,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:50,057 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:50,057 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:50,058 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-07 15:14:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-07 15:14:50,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:50,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:50,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-07 15:14:50,059 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 61 states. [2022-04-07 15:14:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:14:50,060 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-07 15:14:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-07 15:14:50,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:14:50,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:14:50,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:14:50,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:14:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 15:14:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-04-07 15:14:50,062 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 43 [2022-04-07 15:14:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:14:50,063 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-04-07 15:14:50,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-07 15:14:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-04-07 15:14:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-07 15:14:50,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:14:50,064 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:14:50,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 15:14:50,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:50,282 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:14:50,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:14:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-07 15:14:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:14:50,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263165863] [2022-04-07 15:14:50,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:50,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:14:50,294 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:14:50,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014645076] [2022-04-07 15:14:50,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:14:50,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:14:50,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:14:50,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:14:50,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 15:14:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:50,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-07 15:14:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:14:50,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:15:24,612 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 15:15:43,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2364#true} is VALID [2022-04-07 15:15:43,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #71#return; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret6 := main(); {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L272 TraceCheckUtils]: 6: Hoare triple {2364#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2364#true} {2364#true} #61#return; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {2364#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L272 TraceCheckUtils]: 12: Hoare triple {2364#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {2364#true} is VALID [2022-04-07 15:15:43,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2364#true} {2364#true} #63#return; {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L272 TraceCheckUtils]: 17: Hoare triple {2364#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2364#true} {2364#true} #65#return; {2364#true} is VALID [2022-04-07 15:15:43,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {2364#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-07 15:15:43,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {2435#(= main_~a~0 main_~x~0)} assume !false; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-07 15:15:43,355 INFO L272 TraceCheckUtils]: 24: Hoare triple {2435#(= main_~a~0 main_~x~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2364#true} is VALID [2022-04-07 15:15:43,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {2364#true} ~cond := #in~cond; {2364#true} is VALID [2022-04-07 15:15:43,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {2364#true} assume !(0 == ~cond); {2364#true} is VALID [2022-04-07 15:15:43,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-07 15:15:43,356 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2364#true} {2435#(= main_~a~0 main_~x~0)} #67#return; {2435#(= main_~a~0 main_~x~0)} is VALID [2022-04-07 15:15:43,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {2435#(= main_~a~0 main_~x~0)} assume !!(0 != ~y~0); {2457#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:43,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {2457#(and (not (= main_~y~0 0)) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2461#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:15:43,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {2461#(and (< 0 (+ main_~y~0 1)) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:15:43,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !false; {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:15:43,358 INFO L272 TraceCheckUtils]: 33: Hoare triple {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2364#true} is VALID [2022-04-07 15:15:43,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {2364#true} ~cond := #in~cond; {2475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:43,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {2475#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:15:43,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:15:43,360 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2479#(not (= |__VERIFIER_assert_#in~cond| 0))} {2465#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} #67#return; {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:15:43,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:15:43,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {2486#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:15:43,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {2493#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2497#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} is VALID [2022-04-07 15:15:43,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {2497#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_mod_v_main_~y~0_26_22 Int) (aux_div_v_main_~y~0_26_22 Int)) (and (not (= aux_mod_v_main_~y~0_26_22 1)) (< 0 (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22 1)) (<= 0 aux_mod_v_main_~y~0_26_22) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22) 2)) (= (+ (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_26_22 2) aux_mod_v_main_~y~0_26_22)) main_~z~0) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_26_22 2))))} assume !false; {2501#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:15:44,752 INFO L272 TraceCheckUtils]: 42: Hoare triple {2501#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2505#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:15:44,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {2505#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2509#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:15:44,753 INFO L290 TraceCheckUtils]: 44: Hoare triple {2509#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2365#false} is VALID [2022-04-07 15:15:44,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-07 15:15:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 15:15:44,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:16:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:16:04,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263165863] [2022-04-07 15:16:04,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:16:04,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014645076] [2022-04-07 15:16:04,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014645076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 15:16:04,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 15:16:04,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-07 15:16:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370285906] [2022-04-07 15:16:04,034 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 15:16:04,035 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-07 15:16:04,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:16:04,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:16:06,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:06,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 15:16:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:16:06,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 15:16:06,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=249, Unknown=1, NotChecked=0, Total=306 [2022-04-07 15:16:06,367 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:16:14,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:16:17,757 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-07 15:16:19,760 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-07 15:16:23,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:16:26,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:16:31,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:16:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:35,030 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-04-07 15:16:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 15:16:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-07 15:16:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:16:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:16:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-07 15:16:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:16:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-07 15:16:35,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-07 15:16:36,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:16:36,890 INFO L225 Difference]: With dead ends: 88 [2022-04-07 15:16:36,890 INFO L226 Difference]: Without dead ends: 86 [2022-04-07 15:16:36,891 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2022-04-07 15:16:36,891 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-04-07 15:16:36,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 2 Unknown, 25 Unchecked, 13.7s Time] [2022-04-07 15:16:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-07 15:16:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-04-07 15:16:36,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:16:36,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:16:36,917 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:16:36,918 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:16:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:36,920 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-07 15:16:36,920 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-04-07 15:16:36,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:16:36,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:16:36,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-07 15:16:36,920 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-07 15:16:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:16:36,922 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2022-04-07 15:16:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2022-04-07 15:16:36,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:16:36,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:16:36,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:16:36,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:16:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.125) internal successors, (63), 59 states have internal predecessors, (63), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-07 15:16:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-04-07 15:16:36,925 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 46 [2022-04-07 15:16:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:16:36,925 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-04-07 15:16:36,925 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 15:16:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-04-07 15:16:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 15:16:36,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:16:36,926 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:16:36,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 15:16:37,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:16:37,140 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:16:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:16:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 2 times [2022-04-07 15:16:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:16:37,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035494559] [2022-04-07 15:16:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:16:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:16:37,156 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:16:37,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499775905] [2022-04-07 15:16:37,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 15:16:37,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:16:37,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:16:37,157 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:16:37,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 15:16:37,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 15:16:37,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:16:37,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-07 15:16:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:16:37,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:20:30,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-07 15:20:30,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2953#true} is VALID [2022-04-07 15:20:30,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #71#return; {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret6 := main(); {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {2953#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:20:30,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2953#true} {2953#true} #61#return; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {2953#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L272 TraceCheckUtils]: 12: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2953#true} {2953#true} #63#return; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L272 TraceCheckUtils]: 17: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:20:30,609 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2953#true} {2953#true} #65#return; {2953#true} is VALID [2022-04-07 15:20:30,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {2953#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:20:30,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:20:30,611 INFO L272 TraceCheckUtils]: 24: Hoare triple {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:20:30,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {2953#true} ~cond := #in~cond; {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:20:30,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:20:30,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:20:30,613 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:20:30,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {3024#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3048#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-07 15:20:30,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {3048#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3052#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-07 15:20:30,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {3052#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3056#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:20:30,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {3056#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3056#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:20:30,616 INFO L272 TraceCheckUtils]: 33: Hoare triple {3056#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:20:30,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {2953#true} ~cond := #in~cond; {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:20:30,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:20:30,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:20:30,617 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3056#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3075#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:20:30,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {3075#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3079#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-07 15:20:30,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {3079#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3083#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ main_~x~0 (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)))) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:20:30,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {3083#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ main_~x~0 (* 2 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)))) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-07 15:20:30,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} assume !false; {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-07 15:20:30,910 INFO L272 TraceCheckUtils]: 42: Hoare triple {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:20:30,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {2953#true} ~cond := #in~cond; {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:20:30,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {3034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:20:30,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:20:30,911 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} #67#return; {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-07 15:20:30,912 INFO L290 TraceCheckUtils]: 47: Hoare triple {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} assume !!(0 != ~y~0); {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-07 15:20:30,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {3087#(and (<= 1 (mod main_~b~0 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (- main_~x~0) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (+ (div (- main_~x~0) (- 2)) (* main_~b~0 main_~a~0))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3112#(and (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (div (* (- 1) main_~x~0) (- 2)) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (* (- 1) main_~x~0) (- 2)) (div (+ (- 1) main_~b~0) 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (* (- 1) main_~x~0) (- 2)) (* 2 (* (div (* (- 1) main_~x~0) (- 2)) (div (+ (- 1) main_~b~0) 2))))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 15:20:31,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {3112#(and (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (= (+ (div (* (- 1) main_~x~0) (- 2)) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (* (- 1) main_~x~0) (- 2)) (div (+ (- 1) main_~b~0) 2)))) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (* (- 1) main_~x~0) (- 2)) (* 2 (* (div (* (- 1) main_~x~0) (- 2)) (div (+ (- 1) main_~b~0) 2))))) (= (mod main_~x~0 2) 0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3116#(and (= (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2))))) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)))))) (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (= (mod (div (- main_~x~0) (- 2)) 2) 0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 15:20:31,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {3116#(and (= (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2))))) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)))))) (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (= (mod (div (- main_~x~0) (- 2)) 2) 0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {3116#(and (= (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2))))) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)))))) (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (= (mod (div (- main_~x~0) (- 2)) 2) 0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 15:20:33,530 WARN L272 TraceCheckUtils]: 51: Hoare triple {3116#(and (= (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* main_~b~0 main_~a~0)) (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2))))) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)) (* 2 (* (div (+ (- 1) main_~b~0) 2) (div (* (- 1) (div (- main_~x~0) (- 2))) (- 2)))))) (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) main_~y~0) (not (= (mod (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) 2) 1)) (= (mod (div (- main_~x~0) (- 2)) 2) 0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3123#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-07 15:20:33,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {3123#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3127#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:20:33,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {3127#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-07 15:20:33,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-07 15:20:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 15:20:33,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:22:43,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {2954#false} assume !false; {2954#false} is VALID [2022-04-07 15:22:43,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {3127#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2954#false} is VALID [2022-04-07 15:22:43,011 INFO L290 TraceCheckUtils]: 52: Hoare triple {3123#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3127#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:22:43,012 INFO L272 TraceCheckUtils]: 51: Hoare triple {3143#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3123#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:22:43,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {3143#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3143#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:22:43,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {3150#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3143#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:22:43,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {3154#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3150#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:22:43,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {3154#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3154#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:22:43,043 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} {3161#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {3154#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:22:43,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:22:43,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {3171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3038#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:22:43,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {2953#true} ~cond := #in~cond; {3171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:22:43,044 INFO L272 TraceCheckUtils]: 42: Hoare triple {3161#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:22:43,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {3161#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {3161#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:22:43,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {3181#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3161#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {2953#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3181#(forall ((aux_div_aux_mod_v_main_~y~0_38_22_69 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (< (div main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (not (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)) (<= (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_69)))) (= (+ main_~z~0 (* main_~x~0 4) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_38_22_69) 4)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {2953#true} assume !!(0 != ~y~0); {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2953#true} {2953#true} #67#return; {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L272 TraceCheckUtils]: 33: Hoare triple {2953#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {2953#true} assume !false; {2953#true} is VALID [2022-04-07 15:22:43,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {2953#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {2953#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {2953#true} assume !!(0 != ~y~0); {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2953#true} {2953#true} #67#return; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L272 TraceCheckUtils]: 24: Hoare triple {2953#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {2953#true} assume !false; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {2953#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2953#true} {2953#true} #65#return; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L272 TraceCheckUtils]: 17: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:22:43,083 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2953#true} {2953#true} #63#return; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L272 TraceCheckUtils]: 12: Hoare triple {2953#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {2953#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2953#true} {2953#true} #61#return; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#true} assume !(0 == ~cond); {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {2953#true} ~cond := #in~cond; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {2953#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {2953#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {2953#true} call #t~ret6 := main(); {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2953#true} {2953#true} #71#return; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {2953#true} assume true; {2953#true} is VALID [2022-04-07 15:22:43,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2953#true} is VALID [2022-04-07 15:22:43,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {2953#true} call ULTIMATE.init(); {2953#true} is VALID [2022-04-07 15:22:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-07 15:22:43,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:22:43,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035494559] [2022-04-07 15:22:43,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:22:43,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499775905] [2022-04-07 15:22:43,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499775905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:22:43,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:22:43,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-07 15:22:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967736563] [2022-04-07 15:22:43,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:22:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-07 15:22:43,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:22:43,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:22:46,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:22:46,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-07 15:22:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:22:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-07 15:22:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=371, Unknown=5, NotChecked=0, Total=462 [2022-04-07 15:22:46,006 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:22:58,010 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-07 15:23:02,204 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-07 15:23:11,306 WARN L232 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 56 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-07 15:23:29,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:23:32,385 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-07 15:23:34,389 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-07 15:23:36,393 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-07 15:23:43,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:23:50,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:23:52,260 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-07 15:23:54,265 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-07 15:23:57,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:24:02,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:24:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:05,147 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2022-04-07 15:24:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-07 15:24:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 55 [2022-04-07 15:24:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:24:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:24:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 71 transitions. [2022-04-07 15:24:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:24:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 71 transitions. [2022-04-07 15:24:05,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 71 transitions. [2022-04-07 15:24:16,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 68 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 15:24:16,276 INFO L225 Difference]: With dead ends: 102 [2022-04-07 15:24:16,276 INFO L226 Difference]: Without dead ends: 100 [2022-04-07 15:24:16,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=164, Invalid=701, Unknown=5, NotChecked=0, Total=870 [2022-04-07 15:24:16,277 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 27 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2022-04-07 15:24:16,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 261 Invalid, 7 Unknown, 29 Unchecked, 33.8s Time] [2022-04-07 15:24:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-07 15:24:16,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-04-07 15:24:16,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:24:16,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 15:24:16,329 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 15:24:16,329 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 15:24:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:16,332 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-07 15:24:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-07 15:24:16,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:16,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:16,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) Second operand 100 states. [2022-04-07 15:24:16,332 INFO L87 Difference]: Start difference. First operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) Second operand 100 states. [2022-04-07 15:24:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:24:16,334 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-07 15:24:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-07 15:24:16,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:24:16,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:24:16,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:24:16,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:24:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 15:24:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2022-04-07 15:24:16,337 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 55 [2022-04-07 15:24:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:24:16,337 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2022-04-07 15:24:16,338 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 20 states have internal predecessors, (44), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-07 15:24:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2022-04-07 15:24:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-07 15:24:16,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:24:16,339 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:24:16,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 15:24:16,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:16,551 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:24:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:24:16,552 INFO L85 PathProgramCache]: Analyzing trace with hash -699618950, now seen corresponding path program 3 times [2022-04-07 15:24:16,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:24:16,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038541717] [2022-04-07 15:24:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:24:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:24:16,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:24:16,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312951477] [2022-04-07 15:24:16,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 15:24:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:24:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:24:16,566 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:24:16,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 15:24:16,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-07 15:24:16,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:24:16,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-07 15:24:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:24:16,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 15:24:43,940 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 15:24:46,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {3794#true} call ULTIMATE.init(); {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {3794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3794#true} {3794#true} #71#return; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {3794#true} call #t~ret6 := main(); {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {3794#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {3794#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3794#true} {3794#true} #61#return; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {3794#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3794#true} is VALID [2022-04-07 15:24:46,456 INFO L272 TraceCheckUtils]: 12: Hoare triple {3794#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {3794#true} ~cond := #in~cond; {3838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 15:24:46,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:24:46,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {3842#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:24:46,458 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3842#(not (= |assume_abort_if_not_#in~cond| 0))} {3794#true} #63#return; {3849#(and (<= main_~b~0 20) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,458 INFO L272 TraceCheckUtils]: 17: Hoare triple {3849#(and (<= main_~b~0 20) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:24:46,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:24:46,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:24:46,459 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3794#true} {3849#(and (<= main_~b~0 20) (<= 0 main_~b~0))} #65#return; {3849#(and (<= main_~b~0 20) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {3849#(and (<= main_~b~0 20) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} assume !false; {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,459 INFO L272 TraceCheckUtils]: 24: Hoare triple {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:24:46,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:24:46,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:24:46,460 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3794#true} {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} #67#return; {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {3868#(and (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3890#(and (not (= main_~y~0 0)) (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {3890#(and (not (= main_~y~0 0)) (<= main_~b~0 20) (= main_~b~0 main_~y~0) (<= 0 main_~b~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3894#(and (<= main_~b~0 20) (<= main_~b~0 (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {3894#(and (<= main_~b~0 20) (<= main_~b~0 (+ main_~y~0 1)) (not (= main_~b~0 0)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !false; {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,462 INFO L272 TraceCheckUtils]: 33: Hoare triple {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:24:46,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:24:46,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:24:46,463 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3794#true} {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} #67#return; {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {3898#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3920#(and (not (= main_~y~0 0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {3920#(and (not (= main_~y~0 0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3924#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,466 INFO L290 TraceCheckUtils]: 40: Hoare triple {3924#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3928#(and (exists ((aux_div_v_main_~y~0_46_22 Int) (aux_mod_v_main_~y~0_46_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_46_22) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22 1)) (< aux_mod_v_main_~y~0_46_22 2) (<= (div (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_46_22 1)) (not (= (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 0)))) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {3928#(and (exists ((aux_div_v_main_~y~0_46_22 Int) (aux_mod_v_main_~y~0_46_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_46_22) (< (div (+ 2 (* (- 1) main_~b~0)) (- 2)) (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22 1)) (< aux_mod_v_main_~y~0_46_22 2) (<= (div (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_46_22 1)) (not (= (+ (* aux_div_v_main_~y~0_46_22 2) aux_mod_v_main_~y~0_46_22) 0)))) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,467 INFO L272 TraceCheckUtils]: 42: Hoare triple {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:24:46,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:24:46,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:24:46,468 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3794#true} {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} #67#return; {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} assume !!(0 != ~y~0); {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} is VALID [2022-04-07 15:24:46,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {3932#(and (< (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2)) (+ main_~y~0 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (< 0 main_~y~0) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3957#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {3957#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !false; {3957#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,470 INFO L272 TraceCheckUtils]: 51: Hoare triple {3957#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:24:46,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {3794#true} ~cond := #in~cond; {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:46,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:24:46,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:24:46,472 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} {3957#(and (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} #67#return; {3978#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {3978#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !!(0 != ~y~0); {3978#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,473 INFO L290 TraceCheckUtils]: 57: Hoare triple {3978#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3985#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} is VALID [2022-04-07 15:24:46,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {3985#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3989#(and (exists ((aux_div_v_main_~y~0_48_22 Int) (aux_mod_v_main_~y~0_48_22 Int)) (and (not (= aux_mod_v_main_~y~0_48_22 1)) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22 1)) (< aux_mod_v_main_~y~0_48_22 2) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22) 2)) (<= 0 aux_mod_v_main_~y~0_48_22))) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 15:24:46,919 INFO L290 TraceCheckUtils]: 59: Hoare triple {3989#(and (exists ((aux_div_v_main_~y~0_48_22 Int) (aux_mod_v_main_~y~0_48_22 Int)) (and (not (= aux_mod_v_main_~y~0_48_22 1)) (< (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22 1)) (< aux_mod_v_main_~y~0_48_22 2) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_48_22 2) aux_mod_v_main_~y~0_48_22) 2)) (<= 0 aux_mod_v_main_~y~0_48_22))) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {3993#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 15:24:47,637 INFO L272 TraceCheckUtils]: 60: Hoare triple {3993#(and (< (div (* (- 1) (div (+ (* (- 1) (div (* (- 1) (div (+ 2 (* (- 1) main_~b~0)) (- 2))) (- 2))) 1) (- 2))) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (<= main_~b~0 20) (not (= main_~b~0 0)) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:24:47,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4001#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:24:47,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {4001#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3795#false} is VALID [2022-04-07 15:24:47,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {3795#false} assume !false; {3795#false} is VALID [2022-04-07 15:24:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-07 15:24:47,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 15:25:13,180 INFO L290 TraceCheckUtils]: 63: Hoare triple {3795#false} assume !false; {3795#false} is VALID [2022-04-07 15:25:13,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {4001#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3795#false} is VALID [2022-04-07 15:25:13,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4001#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 15:25:13,182 INFO L272 TraceCheckUtils]: 60: Hoare triple {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 15:25:13,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:25:13,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {4024#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-07 15:25:13,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {4028#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4024#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-07 15:25:13,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {4028#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {4028#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:25:13,193 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} {4035#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {4028#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-07 15:25:13,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:25:13,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {4045#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 15:25:13,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {3794#true} ~cond := #in~cond; {4045#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 15:25:13,199 INFO L272 TraceCheckUtils]: 51: Hoare triple {4035#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {4035#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {4035#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-07 15:25:13,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4035#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-07 15:25:13,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-07 15:25:13,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-07 15:25:13,203 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3794#true} {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #67#return; {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-07 15:25:13,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:25:13,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:25:13,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:25:13,203 INFO L272 TraceCheckUtils]: 42: Hoare triple {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-07 15:25:13,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4055#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-07 15:25:13,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-07 15:25:13,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !!(0 != ~y~0); {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-07 15:25:13,207 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3794#true} {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} #67#return; {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-07 15:25:13,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:25:13,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:25:13,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:25:13,207 INFO L272 TraceCheckUtils]: 33: Hoare triple {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !false; {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-07 15:25:13,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {4111#(and (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 3) (div (+ (div main_~y~0 2) (- 10)) 2)) 2)) 2))) (or (<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 11) (div main_~y~0 2)) 2) (- 3)) 2)) 2) 3)) (not (= (mod main_~y~0 2) 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4083#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-07 15:25:13,213 INFO L290 TraceCheckUtils]: 30: Hoare triple {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4111#(and (<= 0 (+ 3 (div (+ (- 1) (div (+ (- 3) (div (+ (div main_~y~0 2) (- 10)) 2)) 2)) 2))) (or (<= 0 (+ (div (+ (- 1) (div (+ (div (+ (- 11) (div main_~y~0 2)) 2) (- 3)) 2)) 2) 3)) (not (= (mod main_~y~0 2) 0))))} is VALID [2022-04-07 15:25:13,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} assume !!(0 != ~y~0); {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-07 15:25:13,214 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3794#true} {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} #67#return; {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-07 15:25:13,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:25:13,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:25:13,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:25:13,215 INFO L272 TraceCheckUtils]: 24: Hoare triple {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} assume !false; {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-07 15:25:13,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {4140#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4115#(<= 0 (+ (div (+ (div (+ (div (+ (- 7) (div (+ main_~y~0 (- 24)) 2)) 2) (- 3)) 2) (- 1)) 2) 4))} is VALID [2022-04-07 15:25:13,216 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3794#true} {4140#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} #65#return; {4140#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} is VALID [2022-04-07 15:25:13,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:25:13,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:25:13,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:25:13,216 INFO L272 TraceCheckUtils]: 17: Hoare triple {4140#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,217 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3842#(not (= |assume_abort_if_not_#in~cond| 0))} {3794#true} #63#return; {4140#(<= 0 (+ 4 (div (+ (div (+ (div (+ (div (+ main_~b~0 (- 24)) 2) (- 7)) 2) (- 3)) 2) (- 1)) 2)))} is VALID [2022-04-07 15:25:13,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {3842#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:25:13,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {4168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3842#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 15:25:13,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {3794#true} ~cond := #in~cond; {4168#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 15:25:13,218 INFO L272 TraceCheckUtils]: 12: Hoare triple {3794#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 20 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {3794#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3794#true} is VALID [2022-04-07 15:25:13,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3794#true} {3794#true} #61#return; {3794#true} is VALID [2022-04-07 15:25:13,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:25:13,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {3794#true} assume !(0 == ~cond); {3794#true} is VALID [2022-04-07 15:25:13,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {3794#true} ~cond := #in~cond; {3794#true} is VALID [2022-04-07 15:25:13,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {3794#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 20 then 1 else 0)); {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {3794#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {3794#true} call #t~ret6 := main(); {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3794#true} {3794#true} #71#return; {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {3794#true} assume true; {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {3794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {3794#true} call ULTIMATE.init(); {3794#true} is VALID [2022-04-07 15:25:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 34 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-07 15:25:13,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 15:25:13,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038541717] [2022-04-07 15:25:13,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 15:25:13,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312951477] [2022-04-07 15:25:13,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312951477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 15:25:13,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 15:25:13,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 33 [2022-04-07 15:25:13,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128857096] [2022-04-07 15:25:13,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 15:25:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64 [2022-04-07 15:25:13,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 15:25:13,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 15:25:14,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 15:25:14,891 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-07 15:25:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 15:25:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-07 15:25:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2022-04-07 15:25:14,892 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 15:25:18,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 15:26:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:26:13,357 INFO L93 Difference]: Finished difference Result 136 states and 158 transitions. [2022-04-07 15:26:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-07 15:26:13,357 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 64 [2022-04-07 15:26:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 15:26:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 15:26:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-07 15:26:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 15:26:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-07 15:26:13,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 93 transitions. [2022-04-07 15:26:21,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 92 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 15:26:21,095 INFO L225 Difference]: With dead ends: 136 [2022-04-07 15:26:21,095 INFO L226 Difference]: Without dead ends: 134 [2022-04-07 15:26:21,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=657, Invalid=2419, Unknown=4, NotChecked=0, Total=3080 [2022-04-07 15:26:21,097 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-07 15:26:21,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 252 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 449 Invalid, 0 Unknown, 83 Unchecked, 5.0s Time] [2022-04-07 15:26:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-07 15:26:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2022-04-07 15:26:21,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 15:26:21,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 15:26:21,183 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 15:26:21,183 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 15:26:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:26:21,186 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2022-04-07 15:26:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-04-07 15:26:21,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:26:21,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:26:21,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 134 states. [2022-04-07 15:26:21,187 INFO L87 Difference]: Start difference. First operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 134 states. [2022-04-07 15:26:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 15:26:21,190 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2022-04-07 15:26:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2022-04-07 15:26:21,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 15:26:21,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 15:26:21,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 15:26:21,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 15:26:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 98 states have internal predecessors, (107), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 15:26:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2022-04-07 15:26:21,193 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 64 [2022-04-07 15:26:21,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 15:26:21,193 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2022-04-07 15:26:21,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 30 states have internal predecessors, (59), 13 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-07 15:26:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2022-04-07 15:26:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-07 15:26:21,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 15:26:21,194 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 15:26:21,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-07 15:26:21,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-07 15:26:21,405 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 15:26:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 15:26:21,406 INFO L85 PathProgramCache]: Analyzing trace with hash 126000178, now seen corresponding path program 4 times [2022-04-07 15:26:21,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 15:26:21,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432210893] [2022-04-07 15:26:21,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 15:26:21,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 15:26:21,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 15:26:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386774403] [2022-04-07 15:26:21,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 15:26:21,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 15:26:21,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 15:26:21,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 15:26:21,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 15:26:21,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 15:26:21,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 15:26:21,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-07 15:26:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 15:26:21,514 INFO L286 TraceCheckSpWp]: Computing forward predicates...