/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/egcd-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:46:39,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:46:39,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:46:39,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:46:39,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:46:39,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:46:39,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:46:39,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:46:39,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:46:39,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:46:39,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:46:39,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:46:39,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:46:39,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:46:39,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:46:39,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:46:39,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:46:39,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:46:39,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:46:39,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:46:39,368 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:46:39,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:46:39,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:46:39,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:46:39,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:46:39,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:46:39,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:46:39,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:46:39,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:46:39,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:46:39,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:46:39,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:46:39,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:46:39,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:46:39,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:46:39,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:46:39,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:46:39,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:46:39,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:46:39,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:46:39,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:46:39,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:46:39,391 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-14 14:46:39,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:46:39,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:46:39,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:46:39,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:46:39,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:46:39,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:46:39,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:46:39,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:46:39,411 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:46:39,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:46:39,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:46:39,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:46:39,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:46:39,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:46:39,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:46:39,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:46:39,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:46:39,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:46:39,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:46:39,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:46:39,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:46:39,415 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:46:39,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:46:39,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:46:39,415 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-14 14:46:39,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:46:39,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:46:39,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:46:39,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:46:39,602 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:46:39,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-14 14:46:39,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020d0022c/7a6f244668414b05874f753b03cf6dee/FLAG1254995fd [2022-04-14 14:46:39,975 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:46:39,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-14 14:46:39,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020d0022c/7a6f244668414b05874f753b03cf6dee/FLAG1254995fd [2022-04-14 14:46:40,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020d0022c/7a6f244668414b05874f753b03cf6dee [2022-04-14 14:46:40,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:46:40,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:46:40,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:46:40,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:46:40,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:46:40,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549f7e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40, skipping insertion in model container [2022-04-14 14:46:40,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:46:40,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:46:40,535 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/egcd-ll.c[489,502] [2022-04-14 14:46:40,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:46:40,566 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:46:40,573 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/egcd-ll.c[489,502] [2022-04-14 14:46:40,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:46:40,586 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:46:40,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40 WrapperNode [2022-04-14 14:46:40,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:46:40,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:46:40,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:46:40,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:46:40,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:46:40,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:46:40,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:46:40,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:46:40,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (1/1) ... [2022-04-14 14:46:40,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:46:40,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:40,635 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-14 14:46:40,637 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-14 14:46:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:46:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:46:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:46:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:46:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:46:40,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:46:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:46:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:46:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:46:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:46:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 14:46:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:46:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:46:40,718 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:46:40,719 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:46:40,884 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:46:40,889 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:46:40,889 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 14:46:40,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:46:40 BoogieIcfgContainer [2022-04-14 14:46:40,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:46:40,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:46:40,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:46:40,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:46:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:46:40" (1/3) ... [2022-04-14 14:46:40,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76066295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:46:40, skipping insertion in model container [2022-04-14 14:46:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:46:40" (2/3) ... [2022-04-14 14:46:40,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76066295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:46:40, skipping insertion in model container [2022-04-14 14:46:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:46:40" (3/3) ... [2022-04-14 14:46:40,898 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll.c [2022-04-14 14:46:40,901 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:46:40,901 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:46:40,953 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:46:40,975 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-14 14:46:40,976 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:46:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 14:46:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 14:46:40,997 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:40,997 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:46:40,998 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:41,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2012836591, now seen corresponding path program 1 times [2022-04-14 14:46:41,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:41,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769083856] [2022-04-14 14:46:41,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:41,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:41,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:46:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:41,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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(10, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-14 14:46:41,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-14 14:46:41,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2022-04-14 14:46:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 14:46:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:41,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 14:46:41,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 14:46:41,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 14:46:41,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-14 14:46:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 14:46:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:41,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 14:46:41,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 14:46:41,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 14:46:41,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-14 14:46:41,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:46:41,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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(10, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-14 14:46:41,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-14 14:46:41,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2022-04-14 14:46:41,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-14 14:46:41,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37#true} is VALID [2022-04-14 14:46:41,208 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-14 14:46:41,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 14:46:41,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 14:46:41,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 14:46:41,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-14 14:46:41,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-14 14:46:41,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 14:46:41,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 14:46:41,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 14:46:41,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-14 14:46:41,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {38#false} is VALID [2022-04-14 14:46:41,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} assume false; {38#false} is VALID [2022-04-14 14:46:41,210 INFO L272 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {38#false} is VALID [2022-04-14 14:46:41,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-14 14:46:41,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-14 14:46:41,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-14 14:46:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:46:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:46:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769083856] [2022-04-14 14:46:41,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769083856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:46:41,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:46:41,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 14:46:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417099116] [2022-04-14 14:46:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:46:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 14:46:41,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:46:41,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 14:46:41,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:41,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 14:46:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:46:41,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 14:46:41,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:46:41,253 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 14:46:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:41,408 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-04-14 14:46:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 14:46:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 14:46:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:46:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 14:46:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-14 14:46:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 14:46:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-14 14:46:41,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-14 14:46:41,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:41,539 INFO L225 Difference]: With dead ends: 61 [2022-04-14 14:46:41,539 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 14:46:41,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:46:41,549 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:46:41,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:46:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 14:46:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 14:46:41,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:46:41,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:46:41,596 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:46:41,596 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:46:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:41,599 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-14 14:46:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-14 14:46:41,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:41,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:41,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-14 14:46:41,600 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-14 14:46:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:41,603 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-14 14:46:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-14 14:46:41,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:41,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:41,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:46:41,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:46:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:46:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-14 14:46:41,620 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2022-04-14 14:46:41,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:46:41,620 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-14 14:46:41,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 14:46:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-14 14:46:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 14:46:41,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:41,621 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:46:41,622 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 14:46:41,622 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1952740121, now seen corresponding path program 1 times [2022-04-14 14:46:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:41,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021327536] [2022-04-14 14:46:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:41,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:46:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103458713] [2022-04-14 14:46:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:41,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:46:41,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:41,651 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-14 14:46:41,653 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-14 14:46:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:41,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 14:46:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:41,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:46:41,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2022-04-14 14:46:41,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#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(10, 2);call #Ultimate.allocInit(12, 3); {244#true} is VALID [2022-04-14 14:46:41,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-14 14:46:41,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #81#return; {244#true} is VALID [2022-04-14 14:46:41,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret6 := main(); {244#true} is VALID [2022-04-14 14:46:41,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {244#true} is VALID [2022-04-14 14:46:41,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {244#true} is VALID [2022-04-14 14:46:41,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#true} ~cond := #in~cond; {244#true} is VALID [2022-04-14 14:46:41,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#true} assume !(0 == ~cond); {244#true} is VALID [2022-04-14 14:46:41,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-14 14:46:41,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {244#true} {244#true} #63#return; {244#true} is VALID [2022-04-14 14:46:41,839 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {244#true} is VALID [2022-04-14 14:46:41,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#true} ~cond := #in~cond; {244#true} is VALID [2022-04-14 14:46:41,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#true} assume !(0 == ~cond); {244#true} is VALID [2022-04-14 14:46:41,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-14 14:46:41,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {244#true} {244#true} #65#return; {244#true} is VALID [2022-04-14 14:46:41,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {244#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-14 14:46:41,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-14 14:46:41,843 INFO L272 TraceCheckUtils]: 18: Hoare triple {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:41,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {304#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:41,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {245#false} is VALID [2022-04-14 14:46:41,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-04-14 14:46:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:46:41,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:46:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:46:41,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021327536] [2022-04-14 14:46:41,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:46:41,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103458713] [2022-04-14 14:46:41,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103458713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:46:41,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:46:41,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 14:46:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226836720] [2022-04-14 14:46:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:46:41,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 14:46:41,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:46:41,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 14:46:41,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:41,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:46:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:46:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:46:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 14:46:41,861 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 14:46:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:42,024 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 14:46:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:46:42,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-14 14:46:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:46:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 14:46:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 14:46:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 14:46:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 14:46:42,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-14 14:46:42,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:42,082 INFO L225 Difference]: With dead ends: 45 [2022-04-14 14:46:42,083 INFO L226 Difference]: Without dead ends: 43 [2022-04-14 14:46:42,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-14 14:46:42,084 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:46:42,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:46:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-14 14:46:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-14 14:46:42,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:46:42,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,099 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,100 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:42,102 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-14 14:46:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-14 14:46:42,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:42,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:42,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-14 14:46:42,109 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-14 14:46:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:42,116 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-14 14:46:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-14 14:46:42,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:42,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:42,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:46:42,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:46:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2022-04-14 14:46:42,127 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 22 [2022-04-14 14:46:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:46:42,128 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2022-04-14 14:46:42,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 14:46:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-14 14:46:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 14:46:42,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:42,132 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:46:42,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 14:46:42,333 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-14 14:46:42,333 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:42,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash 652987931, now seen corresponding path program 1 times [2022-04-14 14:46:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:42,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69736379] [2022-04-14 14:46:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:42,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:42,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:46:42,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038353677] [2022-04-14 14:46:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:46:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:42,356 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-14 14:46:42,356 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-14 14:46:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:42,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 14:46:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:42,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:46:42,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-14 14:46:42,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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(10, 2);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-14 14:46:42,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-14 14:46:42,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #81#return; {538#true} is VALID [2022-04-14 14:46:42,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret6 := main(); {538#true} is VALID [2022-04-14 14:46:42,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {538#true} is VALID [2022-04-14 14:46:42,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {538#true} is VALID [2022-04-14 14:46:42,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-14 14:46:42,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-14 14:46:42,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-14 14:46:42,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #63#return; {538#true} is VALID [2022-04-14 14:46:42,608 INFO L272 TraceCheckUtils]: 11: Hoare triple {538#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {538#true} is VALID [2022-04-14 14:46:42,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#true} ~cond := #in~cond; {579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:46:42,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:46:42,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:46:42,610 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {583#(not (= |assume_abort_if_not_#in~cond| 0))} {538#true} #65#return; {590#(<= 1 main_~y~0)} is VALID [2022-04-14 14:46:42,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {590#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:42,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:42,611 INFO L272 TraceCheckUtils]: 18: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {538#true} is VALID [2022-04-14 14:46:42,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-14 14:46:42,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-14 14:46:42,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-14 14:46:42,612 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {538#true} {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:42,613 INFO L272 TraceCheckUtils]: 23: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:42,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {616#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:42,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {620#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-14 14:46:42,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-14 14:46:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 14:46:42,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:46:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:46:42,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69736379] [2022-04-14 14:46:42,615 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:46:42,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038353677] [2022-04-14 14:46:42,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038353677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:46:42,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:46:42,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 14:46:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872118095] [2022-04-14 14:46:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:46:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 14:46:42,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:46:42,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 14:46:42,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:42,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 14:46:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:46:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 14:46:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-14 14:46:42,635 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 14:46:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:42,925 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-14 14:46:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 14:46:42,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-14 14:46:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:46:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 14:46:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-14 14:46:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 14:46:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-14 14:46:42,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-14 14:46:42,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:42,977 INFO L225 Difference]: With dead ends: 49 [2022-04-14 14:46:42,977 INFO L226 Difference]: Without dead ends: 47 [2022-04-14 14:46:42,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 14:46:42,978 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:46:42,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 14:46:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-14 14:46:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-14 14:46:42,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:46:42,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,992 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,992 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:42,994 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-14 14:46:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-14 14:46:42,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:42,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:42,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-14 14:46:42,995 INFO L87 Difference]: Start difference. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-14 14:46:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:42,997 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-14 14:46:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-14 14:46:42,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:42,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:42,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:46:42,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:46:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:46:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-14 14:46:42,999 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 27 [2022-04-14 14:46:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:46:42,999 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-14 14:46:43,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 14:46:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-14 14:46:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 14:46:43,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:43,000 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:46:43,033 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-14 14:46:43,208 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-14 14:46:43,208 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:43,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1028398105, now seen corresponding path program 1 times [2022-04-14 14:46:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:43,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918575085] [2022-04-14 14:46:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:43,220 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:46:43,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285379738] [2022-04-14 14:46:43,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:46:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:43,222 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-14 14:46:43,242 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-14 14:46:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:43,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 14:46:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:43,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:46:43,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2022-04-14 14:46:43,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#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(10, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-04-14 14:46:43,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #81#return; {870#true} is VALID [2022-04-14 14:46:43,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret6 := main(); {870#true} is VALID [2022-04-14 14:46:43,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {870#true} is VALID [2022-04-14 14:46:43,444 INFO L272 TraceCheckUtils]: 6: Hoare triple {870#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} ~cond := #in~cond; {896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 14:46:43,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:46:43,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 14:46:43,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#(not (= |assume_abort_if_not_#in~cond| 0))} {870#true} #63#return; {907#(<= 1 main_~x~0)} is VALID [2022-04-14 14:46:43,445 INFO L272 TraceCheckUtils]: 11: Hoare triple {907#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {870#true} {907#(<= 1 main_~x~0)} #65#return; {907#(<= 1 main_~x~0)} is VALID [2022-04-14 14:46:43,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 14:46:43,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 14:46:43,447 INFO L272 TraceCheckUtils]: 18: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,448 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {870#true} {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #67#return; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 14:46:43,448 INFO L272 TraceCheckUtils]: 23: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,449 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {870#true} {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #69#return; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 14:46:43,450 INFO L272 TraceCheckUtils]: 28: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:43,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:43,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-04-14 14:46:43,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-04-14 14:46:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 14:46:43,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:46:43,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-04-14 14:46:43,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-04-14 14:46:43,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:43,606 INFO L272 TraceCheckUtils]: 28: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:43,606 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {870#true} {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:46:43,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,607 INFO L272 TraceCheckUtils]: 23: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,607 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {870#true} {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:46:43,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,608 INFO L272 TraceCheckUtils]: 18: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:46:43,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 14:46:43,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {870#true} {870#true} #65#return; {870#true} is VALID [2022-04-14 14:46:43,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {870#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {870#true} {870#true} #63#return; {870#true} is VALID [2022-04-14 14:46:43,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-14 14:46:43,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-14 14:46:43,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {870#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-14 14:46:43,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {870#true} is VALID [2022-04-14 14:46:43,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret6 := main(); {870#true} is VALID [2022-04-14 14:46:43,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #81#return; {870#true} is VALID [2022-04-14 14:46:43,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-14 14:46:43,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#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(10, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-04-14 14:46:43,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2022-04-14 14:46:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-14 14:46:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:46:43,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918575085] [2022-04-14 14:46:43,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:46:43,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285379738] [2022-04-14 14:46:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285379738] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:46:43,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:46:43,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-14 14:46:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235896099] [2022-04-14 14:46:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:46:43,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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 32 [2022-04-14 14:46:43,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:46:43,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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-14 14:46:43,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:43,628 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:46:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:46:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:46:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:46:43,629 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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-14 14:46:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:43,814 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-14 14:46:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:46:43,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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 32 [2022-04-14 14:46:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:46:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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-14 14:46:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 14:46:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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-14 14:46:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 14:46:43,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-14 14:46:43,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:43,869 INFO L225 Difference]: With dead ends: 71 [2022-04-14 14:46:43,869 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 14:46:43,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-14 14:46:43,870 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:46:43,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:46:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 14:46:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-14 14:46:43,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:46:43,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:43,891 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:43,891 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:43,894 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-14 14:46:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-14 14:46:43,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:43,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:43,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-14 14:46:43,895 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-14 14:46:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:43,897 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-14 14:46:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-14 14:46:43,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:43,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:43,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:46:43,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:46:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-04-14 14:46:43,900 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 32 [2022-04-14 14:46:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:46:43,900 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-04-14 14:46:43,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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-14 14:46:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-14 14:46:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 14:46:43,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:43,901 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:46:43,918 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-14 14:46:44,118 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-14 14:46:44,118 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash -134474469, now seen corresponding path program 1 times [2022-04-14 14:46:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:44,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192911898] [2022-04-14 14:46:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:44,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:46:44,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072964523] [2022-04-14 14:46:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:44,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:46:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:44,135 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-14 14:46:44,140 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-14 14:46:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:44,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 14:46:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:44,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:46:44,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {1424#true} call ULTIMATE.init(); {1424#true} is VALID [2022-04-14 14:46:44,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1424#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(10, 2);call #Ultimate.allocInit(12, 3); {1424#true} is VALID [2022-04-14 14:46:44,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-14 14:46:44,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1424#true} {1424#true} #81#return; {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1424#true} call #t~ret6 := main(); {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {1424#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L272 TraceCheckUtils]: 6: Hoare triple {1424#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1424#true} {1424#true} #63#return; {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L272 TraceCheckUtils]: 11: Hoare triple {1424#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-14 14:46:44,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1424#true} {1424#true} #65#return; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {1424#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {1424#true} assume !false; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L272 TraceCheckUtils]: 18: Hoare triple {1424#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1424#true} {1424#true} #67#return; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L272 TraceCheckUtils]: 23: Hoare triple {1424#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-14 14:46:44,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1424#true} {1424#true} #69#return; {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {1424#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-14 14:46:44,267 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1424#true} {1424#true} #71#return; {1424#true} is VALID [2022-04-14 14:46:44,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {1424#true} assume !(~a~0 != ~b~0); {1528#(= main_~b~0 main_~a~0)} is VALID [2022-04-14 14:46:44,269 INFO L272 TraceCheckUtils]: 34: Hoare triple {1528#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:44,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:44,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {1536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1425#false} is VALID [2022-04-14 14:46:44,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2022-04-14 14:46:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 14:46:44,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:46:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:46:44,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192911898] [2022-04-14 14:46:44,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:46:44,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072964523] [2022-04-14 14:46:44,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072964523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:46:44,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:46:44,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 14:46:44,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162736046] [2022-04-14 14:46:44,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:46:44,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-14 14:46:44,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:46:44,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 14:46:44,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:44,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:46:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:46:44,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:46:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 14:46:44,289 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 14:46:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:44,422 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-04-14 14:46:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:46:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-14 14:46:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:46:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 14:46:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-14 14:46:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 14:46:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-14 14:46:44,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-14 14:46:44,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:44,453 INFO L225 Difference]: With dead ends: 73 [2022-04-14 14:46:44,453 INFO L226 Difference]: Without dead ends: 71 [2022-04-14 14:46:44,453 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-14 14:46:44,454 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:46:44,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:46:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-14 14:46:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-14 14:46:44,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:46:44,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:44,475 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:44,475 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:44,477 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-14 14:46:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-14 14:46:44,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:44,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:44,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-14 14:46:44,478 INFO L87 Difference]: Start difference. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-14 14:46:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:44,480 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-14 14:46:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-14 14:46:44,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:44,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:44,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:46:44,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:46:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 14:46:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-14 14:46:44,483 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 38 [2022-04-14 14:46:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:46:44,483 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-14 14:46:44,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 14:46:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-14 14:46:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 14:46:44,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:44,484 INFO L499 BasicCegarLoop]: trace histogram [4, 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] [2022-04-14 14:46:44,502 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-14 14:46:44,700 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-14 14:46:44,700 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 251096952, now seen corresponding path program 1 times [2022-04-14 14:46:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:44,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517999680] [2022-04-14 14:46:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:44,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:44,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:46:44,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124796880] [2022-04-14 14:46:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:44,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:46:44,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:44,713 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-14 14:46:44,714 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-14 14:46:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:44,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 14:46:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:44,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:46:44,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {1910#true} call ULTIMATE.init(); {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#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(10, 2);call #Ultimate.allocInit(12, 3); {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1910#true} {1910#true} #81#return; {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {1910#true} call #t~ret6 := main(); {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {1910#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L272 TraceCheckUtils]: 6: Hoare triple {1910#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-14 14:46:44,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1910#true} {1910#true} #63#return; {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L272 TraceCheckUtils]: 11: Hoare triple {1910#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-14 14:46:44,940 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1910#true} {1910#true} #65#return; {1910#true} is VALID [2022-04-14 14:46:44,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {1910#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,941 INFO L290 TraceCheckUtils]: 17: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,941 INFO L272 TraceCheckUtils]: 18: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1910#true} is VALID [2022-04-14 14:46:44,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-14 14:46:44,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-14 14:46:44,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-14 14:46:44,942 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,942 INFO L272 TraceCheckUtils]: 23: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1910#true} is VALID [2022-04-14 14:46:44,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-14 14:46:44,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-14 14:46:44,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-14 14:46:44,943 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,943 INFO L272 TraceCheckUtils]: 28: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1910#true} is VALID [2022-04-14 14:46:44,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-14 14:46:44,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-14 14:46:44,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-14 14:46:44,944 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #71#return; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:46:44,946 INFO L272 TraceCheckUtils]: 36: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2024#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:44,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {2024#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2028#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:44,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {2028#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1911#false} is VALID [2022-04-14 14:46:44,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {1911#false} assume !false; {1911#false} is VALID [2022-04-14 14:46:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 14:46:44,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:46:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:46:44,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517999680] [2022-04-14 14:46:44,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:46:44,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124796880] [2022-04-14 14:46:44,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124796880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:46:44,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:46:44,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 14:46:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864746641] [2022-04-14 14:46:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:46:44,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-04-14 14:46:44,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:46:44,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:46:45,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:45,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:46:45,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:46:45,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:46:45,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 14:46:45,002 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:46:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:45,144 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-04-14 14:46:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:46:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-04-14 14:46:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:46:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:46:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-14 14:46:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:46:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-14 14:46:45,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-14 14:46:45,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:46:45,185 INFO L225 Difference]: With dead ends: 81 [2022-04-14 14:46:45,185 INFO L226 Difference]: Without dead ends: 78 [2022-04-14 14:46:45,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 14:46:45,186 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:46:45,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:46:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-14 14:46:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-14 14:46:45,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:46:45,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 14:46:45,212 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 14:46:45,213 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 14:46:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:45,215 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-14 14:46:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-14 14:46:45,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:45,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:45,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-14 14:46:45,216 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-14 14:46:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:46:45,218 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-14 14:46:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-14 14:46:45,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:46:45,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:46:45,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:46:45,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:46:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 14:46:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-14 14:46:45,221 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 40 [2022-04-14 14:46:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:46:45,221 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-14 14:46:45,221 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:46:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-14 14:46:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 14:46:45,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:46:45,221 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1] [2022-04-14 14:46:45,240 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-14 14:46:45,440 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-14 14:46:45,442 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:46:45,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:46:45,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1098226535, now seen corresponding path program 1 times [2022-04-14 14:46:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:46:45,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752499057] [2022-04-14 14:46:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:46:45,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:46:45,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514323140] [2022-04-14 14:46:45,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:46:45,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:46:45,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:46:45,454 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-14 14:46:45,468 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-14 14:46:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:45,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 14:46:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:46:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:46:45,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#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(10, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #81#return; {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret6 := main(); {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:46:45,658 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2430#true} {2430#true} #63#return; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2430#true} {2430#true} #65#return; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#true} assume !false; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L272 TraceCheckUtils]: 18: Hoare triple {2430#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:46:45,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:46:45,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:46:45,660 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2430#true} {2430#true} #67#return; {2430#true} is VALID [2022-04-14 14:46:45,660 INFO L272 TraceCheckUtils]: 23: Hoare triple {2430#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:46:45,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {2430#true} ~cond := #in~cond; {2507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:45,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {2507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:46:45,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:46:45,666 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} {2430#true} #69#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:46:45,671 INFO L272 TraceCheckUtils]: 28: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:46:45,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:46:45,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:46:45,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:46:45,678 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2430#true} {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #71#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:46:45,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:46:45,678 INFO L272 TraceCheckUtils]: 34: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:46:45,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:46:45,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:46:45,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:46:45,679 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2430#true} {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #73#return; {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:46:45,680 INFO L272 TraceCheckUtils]: 39: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:46:45,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:46:45,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2431#false} is VALID [2022-04-14 14:46:45,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-14 14:46:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:46:45,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:47:03,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-14 14:47:03,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2431#false} is VALID [2022-04-14 14:47:03,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:03,048 INFO L272 TraceCheckUtils]: 39: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:03,048 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2430#true} {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #73#return; {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:03,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:47:03,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:47:03,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:47:03,049 INFO L272 TraceCheckUtils]: 34: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:47:03,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:03,050 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2430#true} {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #71#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:03,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:47:03,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:47:03,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:47:03,050 INFO L272 TraceCheckUtils]: 28: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:47:03,051 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} {2430#true} #69#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:03,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:47:03,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {2621#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {2430#true} ~cond := #in~cond; {2621#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:47:03,052 INFO L272 TraceCheckUtils]: 23: Hoare triple {2430#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2430#true} {2430#true} #67#return; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L272 TraceCheckUtils]: 18: Hoare triple {2430#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#true} assume !false; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2430#true} {2430#true} #65#return; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:47:03,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2430#true} {2430#true} #63#return; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret6 := main(); {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #81#return; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#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(10, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-14 14:47:03,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2022-04-14 14:47:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:47:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:03,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752499057] [2022-04-14 14:47:03,054 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:03,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514323140] [2022-04-14 14:47:03,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514323140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:47:03,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:47:03,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-14 14:47:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478447130] [2022-04-14 14:47:03,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:47:03,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-14 14:47:03,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:03,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 14:47:03,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:03,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 14:47:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:03,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 14:47:03,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:47:03,079 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 14:47:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:03,360 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-14 14:47:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 14:47:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-14 14:47:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 14:47:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-14 14:47:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 14:47:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-14 14:47:03,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-14 14:47:03,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:03,400 INFO L225 Difference]: With dead ends: 85 [2022-04-14 14:47:03,400 INFO L226 Difference]: Without dead ends: 81 [2022-04-14 14:47:03,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-14 14:47:03,401 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:03,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 14:47:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-14 14:47:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-14 14:47:03,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:03,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 14:47:03,423 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 14:47:03,423 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 14:47:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:03,425 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-14 14:47:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-14 14:47:03,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:03,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:03,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-14 14:47:03,426 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-14 14:47:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:03,428 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-14 14:47:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-14 14:47:03,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:03,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:03,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:03,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 14:47:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-14 14:47:03,431 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 43 [2022-04-14 14:47:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:03,431 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-14 14:47:03,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 14:47:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-14 14:47:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 14:47:03,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:03,432 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:03,465 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-14 14:47:03,632 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-14 14:47:03,632 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:03,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash -17648356, now seen corresponding path program 2 times [2022-04-14 14:47:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542359014] [2022-04-14 14:47:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:03,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:03,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:03,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [186237170] [2022-04-14 14:47:03,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 14:47:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:03,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:03,653 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-14 14:47:03,671 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-14 14:47:03,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 14:47:03,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 14:47:03,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 14:47:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:03,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:03,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {3114#true} call ULTIMATE.init(); {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#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(10, 2);call #Ultimate.allocInit(12, 3); {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3114#true} {3114#true} #81#return; {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {3114#true} call #t~ret6 := main(); {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {3114#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {3114#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:03,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3114#true} {3114#true} #63#return; {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {3114#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3114#true} {3114#true} #65#return; {3114#true} is VALID [2022-04-14 14:47:03,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {3114#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:03,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:03,969 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:03,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:03,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:03,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,970 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3114#true} {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:03,970 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:03,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:03,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:03,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,971 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3114#true} {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #69#return; {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:03,971 INFO L272 TraceCheckUtils]: 28: Hoare triple {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:03,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:03,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:03,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,972 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3114#true} {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:03,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:03,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {3167#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-14 14:47:03,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} assume !false; {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-14 14:47:03,973 INFO L272 TraceCheckUtils]: 36: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:03,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:03,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:03,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:03,974 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3114#true} {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} #67#return; {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-14 14:47:03,974 INFO L272 TraceCheckUtils]: 41: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:03,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:03,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {3248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3115#false} is VALID [2022-04-14 14:47:03,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#false} assume !false; {3115#false} is VALID [2022-04-14 14:47:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 14:47:03,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:47:04,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#false} assume !false; {3115#false} is VALID [2022-04-14 14:47:04,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {3248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3115#false} is VALID [2022-04-14 14:47:04,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:04,155 INFO L272 TraceCheckUtils]: 41: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:04,155 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3114#true} {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:04,155 INFO L290 TraceCheckUtils]: 39: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:04,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:04,156 INFO L272 TraceCheckUtils]: 36: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:04,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:04,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 14:47:04,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 14:47:04,285 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3114#true} {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #71#return; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 14:47:04,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:04,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:04,285 INFO L272 TraceCheckUtils]: 28: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:04,286 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3114#true} {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #69#return; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 14:47:04,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:04,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:04,286 INFO L272 TraceCheckUtils]: 23: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:04,287 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3114#true} {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #67#return; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 14:47:04,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:04,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:04,287 INFO L272 TraceCheckUtils]: 18: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:04,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !false; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 14:47:04,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {3114#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 14:47:04,288 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3114#true} {3114#true} #65#return; {3114#true} is VALID [2022-04-14 14:47:04,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:04,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:04,288 INFO L272 TraceCheckUtils]: 11: Hoare triple {3114#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3114#true} {3114#true} #63#return; {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {3114#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {3114#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {3114#true} call #t~ret6 := main(); {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3114#true} {3114#true} #81#return; {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#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(10, 2);call #Ultimate.allocInit(12, 3); {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {3114#true} call ULTIMATE.init(); {3114#true} is VALID [2022-04-14 14:47:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 14:47:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:04,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542359014] [2022-04-14 14:47:04,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:04,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186237170] [2022-04-14 14:47:04,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186237170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:47:04,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:47:04,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 14:47:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346677062] [2022-04-14 14:47:04,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:47:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-14 14:47:04,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:04,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 14:47:04,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:04,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 14:47:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 14:47:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 14:47:04,421 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 14:47:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:06,929 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-04-14 14:47:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 14:47:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-14 14:47:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 14:47:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-14 14:47:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 14:47:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-14 14:47:06,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-14 14:47:07,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:07,230 INFO L225 Difference]: With dead ends: 107 [2022-04-14 14:47:07,230 INFO L226 Difference]: Without dead ends: 100 [2022-04-14 14:47:07,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 14:47:07,231 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:07,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 147 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 14:47:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-14 14:47:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2022-04-14 14:47:07,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:07,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 14:47:07,264 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 14:47:07,270 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 14:47:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:07,273 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-14 14:47:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-14 14:47:07,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:07,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:07,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-14 14:47:07,274 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-14 14:47:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:07,276 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-14 14:47:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-14 14:47:07,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:07,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:07,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:07,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 14:47:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-04-14 14:47:07,292 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 45 [2022-04-14 14:47:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:07,292 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-04-14 14:47:07,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 14:47:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-04-14 14:47:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 14:47:07,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:47:07,294 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:07,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 14:47:07,501 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-14 14:47:07,501 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:47:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:47:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash -152607915, now seen corresponding path program 1 times [2022-04-14 14:47:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:47:07,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652481259] [2022-04-14 14:47:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:47:07,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:47:07,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855587632] [2022-04-14 14:47:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:47:07,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:47:07,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:47:07,512 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-14 14:47:07,514 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-14 14:47:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:07,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 14:47:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:47:07,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:47:07,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {3883#true} call ULTIMATE.init(); {3883#true} is VALID [2022-04-14 14:47:07,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#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(10, 2);call #Ultimate.allocInit(12, 3); {3883#true} is VALID [2022-04-14 14:47:07,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3883#true} {3883#true} #81#return; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {3883#true} call #t~ret6 := main(); {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {3883#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3883#true} {3883#true} #63#return; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {3883#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} #65#return; {3883#true} is VALID [2022-04-14 14:47:07,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:07,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:07,853 INFO L272 TraceCheckUtils]: 18: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,854 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:07,854 INFO L272 TraceCheckUtils]: 23: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,854 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:07,855 INFO L272 TraceCheckUtils]: 28: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,855 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #71#return; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:07,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 14:47:07,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:07,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:07,856 INFO L272 TraceCheckUtils]: 36: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #67#return; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:07,857 INFO L272 TraceCheckUtils]: 41: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,859 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #69#return; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:07,859 INFO L272 TraceCheckUtils]: 46: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:07,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:07,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:07,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:07,860 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #71#return; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:07,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 14:47:07,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-14 14:47:07,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-14 14:47:07,862 INFO L272 TraceCheckUtils]: 54: Hoare triple {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:07,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:07,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {4057#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3884#false} is VALID [2022-04-14 14:47:07,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {3884#false} assume !false; {3884#false} is VALID [2022-04-14 14:47:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-14 14:47:07,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:47:08,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {3884#false} assume !false; {3884#false} is VALID [2022-04-14 14:47:08,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {4057#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3884#false} is VALID [2022-04-14 14:47:08,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:47:08,069 INFO L272 TraceCheckUtils]: 54: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:47:08,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,073 INFO L290 TraceCheckUtils]: 51: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,073 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #71#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,073 INFO L272 TraceCheckUtils]: 46: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #69#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L272 TraceCheckUtils]: 41: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #67#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,074 INFO L290 TraceCheckUtils]: 39: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L290 TraceCheckUtils]: 38: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,074 INFO L290 TraceCheckUtils]: 37: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,075 INFO L272 TraceCheckUtils]: 36: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,077 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #71#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,077 INFO L272 TraceCheckUtils]: 28: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #69#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L272 TraceCheckUtils]: 23: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #67#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,078 INFO L272 TraceCheckUtils]: 18: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 14:47:08,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} #65#return; {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L272 TraceCheckUtils]: 11: Hoare triple {3883#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3883#true} {3883#true} #63#return; {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {3883#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {3883#true} call #t~ret6 := main(); {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3883#true} {3883#true} #81#return; {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#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(10, 2);call #Ultimate.allocInit(12, 3); {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {3883#true} call ULTIMATE.init(); {3883#true} is VALID [2022-04-14 14:47:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-14 14:47:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:47:08,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652481259] [2022-04-14 14:47:08,080 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:47:08,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855587632] [2022-04-14 14:47:08,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855587632] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:47:08,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:47:08,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-14 14:47:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71096521] [2022-04-14 14:47:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:47:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-04-14 14:47:08,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:47:08,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:08,101 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-14 14:47:08,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 14:47:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:47:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 14:47:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 14:47:08,102 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:08,218 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-04-14 14:47:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 14:47:08,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-04-14 14:47:08,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:47:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-14 14:47:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-14 14:47:08,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-14 14:47:08,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:47:08,248 INFO L225 Difference]: With dead ends: 85 [2022-04-14 14:47:08,248 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 14:47:08,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:47:08,249 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:47:08,249 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:47:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 14:47:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 14:47:08,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:47:08,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:47:08,250 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:47:08,250 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:47:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:08,250 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:47:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:47:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:08,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:08,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 14:47:08,250 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 14:47:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:47:08,250 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 14:47:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:47:08,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:08,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:47:08,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:47:08,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:47:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 14:47:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 14:47:08,251 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-04-14 14:47:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:47:08,251 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 14:47:08,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 14:47:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 14:47:08,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:47:08,253 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 14:47:08,269 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-14 14:47:08,463 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-14 14:47:08,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 14:47:12,060 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-14 14:47:12,060 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-14 14:47:12,060 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-14 14:47:12,060 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-14 14:47:12,061 INFO L882 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-14 14:47:12,061 INFO L882 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-14 14:47:12,061 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-14 14:47:12,061 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 50) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (let ((.cse2 (+ .cse0 .cse1))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~b~0 .cse2) (= main_~a~0 .cse2) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))))) [2022-04-14 14:47:12,061 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 18 57) no Hoare annotation was computed. [2022-04-14 14:47:12,061 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-14 14:47:12,061 INFO L885 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: true [2022-04-14 14:47:12,061 INFO L878 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~y~0)) [2022-04-14 14:47:12,061 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (let ((.cse2 (+ .cse0 .cse1))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~b~0 .cse2) (= main_~a~0 .cse2) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))))) [2022-04-14 14:47:12,061 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 18 57) no Hoare annotation was computed. [2022-04-14 14:47:12,061 INFO L882 garLoopResultBuilder]: For program point L36(lines 33 50) no Hoare annotation was computed. [2022-04-14 14:47:12,061 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-14 14:47:12,061 INFO L878 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-14 14:47:12,062 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 18 57) the Hoare annotation is: true [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse4 (* main_~q~0 main_~x~0)) (.cse5 (* main_~y~0 main_~s~0))) (let ((.cse0 (= main_~b~0 (+ .cse4 .cse5))) (.cse1 (= main_~s~0 1)) (.cse3 (= main_~p~0 1)) (.cse2 (<= 1 main_~y~0))) (or (and (= main_~r~0 0) .cse0 .cse1 .cse2 (= main_~a~0 main_~x~0) .cse3) (and (= main_~b~0 main_~a~0) .cse0 .cse1 (= main_~q~0 0) .cse2 .cse3) (let ((.cse6 (* main_~y~0 main_~r~0)) (.cse7 (* main_~p~0 main_~x~0))) (let ((.cse8 (+ .cse6 .cse7))) (and (= (+ .cse4 main_~a~0 .cse5) (+ .cse6 main_~b~0 .cse7)) (= main_~b~0 .cse8) (= main_~a~0 .cse8) .cse2 (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))))))) [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L878 garLoopResultBuilder]: At program point L41-2(lines 33 50) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-14 14:47:12,062 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 14:47:12,062 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 14:47:12,062 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 14:47:12,062 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-14 14:47:12,063 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-14 14:47:12,063 INFO L882 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-14 14:47:12,063 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-14 14:47:12,063 INFO L882 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-14 14:47:12,063 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-14 14:47:12,065 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:47:12,066 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 14:47:12,068 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 14:47:12,071 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 14:47:12,071 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 14:47:12,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:47:12 BoogieIcfgContainer [2022-04-14 14:47:12,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 14:47:12,095 INFO L158 Benchmark]: Toolchain (without parser) took 31681.38ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 132.9MB in the beginning and 171.1MB in the end (delta: -38.2MB). Peak memory consumption was 101.1MB. Max. memory is 8.0GB. [2022-04-14 14:47:12,095 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 184.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 14:47:12,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.22ms. Allocated memory is still 184.5MB. Free memory was 132.6MB in the beginning and 159.3MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 14:47:12,096 INFO L158 Benchmark]: Boogie Preprocessor took 19.29ms. Allocated memory is still 184.5MB. Free memory was 159.3MB in the beginning and 157.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 14:47:12,096 INFO L158 Benchmark]: RCFGBuilder took 283.43ms. Allocated memory is still 184.5MB. Free memory was 157.9MB in the beginning and 146.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 14:47:12,096 INFO L158 Benchmark]: TraceAbstraction took 31203.46ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 145.7MB in the beginning and 171.1MB in the end (delta: -25.4MB). Peak memory consumption was 114.7MB. Max. memory is 8.0GB. [2022-04-14 14:47:12,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 184.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.22ms. Allocated memory is still 184.5MB. Free memory was 132.6MB in the beginning and 159.3MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.29ms. Allocated memory is still 184.5MB. Free memory was 159.3MB in the beginning and 157.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.43ms. Allocated memory is still 184.5MB. Free memory was 157.9MB in the beginning and 146.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 31203.46ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 145.7MB in the beginning and 171.1MB in the end (delta: -25.4MB). Peak memory consumption was 114.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.1s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 995 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 684 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 583 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 311 mSDtfsCounter, 583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 51 PreInvPairs, 84 NumberOfFragments, 378 HoareAnnotationTreeSize, 51 FomulaSimplifications, 136 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1838 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 1506 SizeOfPredicates, 16 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 373/406 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((q * x + a + y * s == y * r + b + p * x && a == y * r + p * x) && 1 <= y) && p * s == q * r + 1 RESULT: Ultimate proved your program to be correct! [2022-04-14 14:47:12,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...