/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:53:07,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:53:07,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:53:07,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:53:07,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:53:07,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:53:07,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:53:07,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:53:07,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:53:07,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:53:07,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:53:07,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:53:07,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:53:07,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:53:07,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:53:07,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:53:07,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:53:07,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:53:07,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:53:07,189 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:53:07,190 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:53:07,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:53:07,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:53:07,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:53:07,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:53:07,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:53:07,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:53:07,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:53:07,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:53:07,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:53:07,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:53:07,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:53:07,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:53:07,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:53:07,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:53:07,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:53:07,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:53:07,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:53:07,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:53:07,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:53:07,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:53:07,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:53:07,221 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:53:07,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:53:07,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:53:07,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:53:07,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:53:07,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:53:07,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:53:07,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:53:07,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:53:07,249 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:53:07,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:53:07,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:53:07,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:53:07,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:53:07,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:53:07,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:53:07,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:53:07,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:53:07,251 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:53:07,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:53:07,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:53:07,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:53:07,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:53:07,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:53:07,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:53:07,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:53:07,460 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:53:07,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c [2022-04-27 12:53:07,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c26ffd6/09714b85014847108e56c9e23247bf9a/FLAG6b4737019 [2022-04-27 12:53:07,903 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:53:07,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c [2022-04-27 12:53:07,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c26ffd6/09714b85014847108e56c9e23247bf9a/FLAG6b4737019 [2022-04-27 12:53:08,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c26ffd6/09714b85014847108e56c9e23247bf9a [2022-04-27 12:53:08,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:53:08,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:53:08,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:53:08,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:53:08,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:53:08,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af6cec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08, skipping insertion in model container [2022-04-27 12:53:08,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:53:08,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:53:08,478 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c[490,503] [2022-04-27 12:53:08,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:53:08,514 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:53:08,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c[490,503] [2022-04-27 12:53:08,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:53:08,546 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:53:08,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08 WrapperNode [2022-04-27 12:53:08,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:53:08,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:53:08,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:53:08,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:53:08,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:53:08,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:53:08,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:53:08,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:53:08,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (1/1) ... [2022-04-27 12:53:08,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:53:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:08,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:53:08,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:53:08,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:53:08,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:53:08,630 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:53:08,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:53:08,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:53:08,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:53:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:53:08,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:53:08,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:53:08,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:53:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:53:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:53:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:53:08,688 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:53:08,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:53:08,836 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:53:08,843 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:53:08,843 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:53:08,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:53:08 BoogieIcfgContainer [2022-04-27 12:53:08,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:53:08,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:53:08,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:53:08,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:53:08,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:53:08" (1/3) ... [2022-04-27 12:53:08,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f5d899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:53:08, skipping insertion in model container [2022-04-27 12:53:08,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:53:08" (2/3) ... [2022-04-27 12:53:08,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f5d899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:53:08, skipping insertion in model container [2022-04-27 12:53:08,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:53:08" (3/3) ... [2022-04-27 12:53:08,851 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound2.c [2022-04-27 12:53:08,862 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:53:08,862 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:53:08,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:53:08,906 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7e93dc6f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b65ac0b [2022-04-27 12:53:08,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:53:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:53:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:53:08,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:08,919 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:08,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-27 12:53:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:08,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110842736] [2022-04-27 12:53:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:53:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:53:09,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:53:09,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:53:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:53:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:53:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:53:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:53:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:53:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:53:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:53:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:53:09,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:53:09,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-27 12:53:09,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:53:09,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-27 12:53:09,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-27 12:53:09,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {42#true} is VALID [2022-04-27 12:53:09,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:09,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-27 12:53:09,224 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:09,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,226 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-27 12:53:09,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-27 12:53:09,226 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:09,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,227 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-27 12:53:09,227 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-27 12:53:09,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:53:09,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:53:09,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:53:09,228 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-27 12:53:09,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:53:09,229 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-27 12:53:09,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:53:09,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:53:09,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:53:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:09,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110842736] [2022-04-27 12:53:09,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110842736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:53:09,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:53:09,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:53:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615619634] [2022-04-27 12:53:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:09,238 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:53:09,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:09,245 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:09,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:09,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:53:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:53:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:53:09,324 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:09,580 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-27 12:53:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:53:09,581 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 12:53:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:09,582 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:53:09,591 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-27 12:53:09,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-27 12:53:09,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:09,732 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:53:09,732 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:53:09,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-27 12:53:09,737 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:09,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:53:09,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:53:09,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:09,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:09,767 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:09,767 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:09,772 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:53:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:53:09,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:09,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:09,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:53:09,774 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-27 12:53:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:09,778 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-27 12:53:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-27 12:53:09,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:09,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:09,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:09,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-27 12:53:09,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-27 12:53:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:09,784 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-27 12:53:09,784 INFO L496 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, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 12:53:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:53:09,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:09,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:09,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:53:09,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-27 12:53:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:09,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661936223] [2022-04-27 12:53:09,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:09,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:09,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948739249] [2022-04-27 12:53:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:09,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:09,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:09,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:53:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:53:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:09,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:10,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {292#true} is VALID [2022-04-27 12:53:10,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {300#(<= ~counter~0 0)} {292#true} #98#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {300#(<= ~counter~0 0)} call #t~ret8 := main(); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {300#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #78#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,142 INFO L272 TraceCheckUtils]: 11: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,144 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #80#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {300#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,145 INFO L272 TraceCheckUtils]: 17: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,147 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #82#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,148 INFO L272 TraceCheckUtils]: 22: Hoare triple {300#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,148 INFO L290 TraceCheckUtils]: 23: Hoare triple {300#(<= ~counter~0 0)} ~cond := #in~cond; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {300#(<= ~counter~0 0)} assume !(0 == ~cond); {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {300#(<= ~counter~0 0)} assume true; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,150 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {300#(<= ~counter~0 0)} {300#(<= ~counter~0 0)} #84#return; {300#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:10,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {379#(<= |main_#t~post6| 0)} is VALID [2022-04-27 12:53:10,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {379#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {293#false} is VALID [2022-04-27 12:53:10,152 INFO L272 TraceCheckUtils]: 29: Hoare triple {293#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {293#false} is VALID [2022-04-27 12:53:10,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {293#false} ~cond := #in~cond; {293#false} is VALID [2022-04-27 12:53:10,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {293#false} assume 0 == ~cond; {293#false} is VALID [2022-04-27 12:53:10,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-27 12:53:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:10,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:53:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:10,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661936223] [2022-04-27 12:53:10,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:10,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948739249] [2022-04-27 12:53:10,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948739249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:53:10,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:53:10,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:53:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474638048] [2022-04-27 12:53:10,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:10,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:53:10,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:10,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:10,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:10,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:53:10,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:53:10,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:53:10,180 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:10,274 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-27 12:53:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:53:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:53:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:53:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-27 12:53:10,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-27 12:53:10,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:10,329 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:53:10,329 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:53:10,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:53:10,331 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:10,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:53:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:53:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:53:10,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:10,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:10,342 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:10,343 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:10,345 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:53:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:53:10,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:10,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:10,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:53:10,347 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-27 12:53:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:10,349 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 12:53:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:53:10,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:10,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:10,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:10,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-27 12:53:10,359 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-27 12:53:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:10,359 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-27 12:53:10,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-27 12:53:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:53:10,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:10,362 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:53:10,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:10,591 WARN L477 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-27 12:53:10,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-27 12:53:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:10,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038134931] [2022-04-27 12:53:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:10,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:10,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505748553] [2022-04-27 12:53:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:10,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:10,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:10,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:10,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:53:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:10,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:53:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:10,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:10,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:53:10,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:53:10,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:10,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:53:10,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:53:10,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {587#true} is VALID [2022-04-27 12:53:10,848 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:10,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:10,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:10,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:10,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:53:10,849 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:10,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:10,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:10,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:10,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:10,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:10,853 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:10,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:10,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:10,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:10,856 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:10,856 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:10,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:10,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:10,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:10,857 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:10,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:10,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 2);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:10,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:53:10,858 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:53:10,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:53:10,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:53:10,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:53:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:10,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:11,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {588#false} assume !false; {588#false} is VALID [2022-04-27 12:53:11,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2022-04-27 12:53:11,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2022-04-27 12:53:11,132 INFO L272 TraceCheckUtils]: 30: Hoare triple {588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {588#false} is VALID [2022-04-27 12:53:11,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {643#(<= 1 main_~b~0)} assume !(0 != ~b~0); {588#false} is VALID [2022-04-27 12:53:11,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {643#(<= 1 main_~b~0)} assume !!(#t~post6 < 2);havoc #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:11,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:11,145 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #84#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:11,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:11,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:11,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:11,146 INFO L272 TraceCheckUtils]: 22: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:11,146 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {587#true} {643#(<= 1 main_~b~0)} #82#return; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:11,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:11,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:11,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:11,147 INFO L272 TraceCheckUtils]: 17: Hoare triple {643#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:11,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {639#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {643#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:11,148 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {632#(not (= |assume_abort_if_not_#in~cond| 0))} {587#true} #80#return; {639#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:11,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:11,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {632#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:11,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#true} ~cond := #in~cond; {758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:53:11,149 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:11,149 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #78#return; {587#true} is VALID [2022-04-27 12:53:11,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:11,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {587#true} assume !(0 == ~cond); {587#true} is VALID [2022-04-27 12:53:11,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {587#true} ~cond := #in~cond; {587#true} is VALID [2022-04-27 12:53:11,150 INFO L272 TraceCheckUtils]: 6: Hoare triple {587#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {587#true} is VALID [2022-04-27 12:53:11,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {587#true} is VALID [2022-04-27 12:53:11,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {587#true} call #t~ret8 := main(); {587#true} is VALID [2022-04-27 12:53:11,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #98#return; {587#true} is VALID [2022-04-27 12:53:11,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2022-04-27 12:53:11,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {587#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {587#true} is VALID [2022-04-27 12:53:11,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2022-04-27 12:53:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038134931] [2022-04-27 12:53:11,157 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:11,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505748553] [2022-04-27 12:53:11,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505748553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:53:11,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:53:11,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-27 12:53:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623982586] [2022-04-27 12:53:11,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:53:11,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:53:11,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:11,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:11,182 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-27 12:53:11,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:53:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:53:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:53:11,184 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:11,473 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-27 12:53:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:53:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:53:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:53:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 12:53:11,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 12:53:11,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:11,556 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:53:11,556 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 12:53:11,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:53:11,558 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 30 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:11,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 12:53:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-27 12:53:11,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:11,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:11,577 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:11,577 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:11,580 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:53:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:53:11,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:11,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:11,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:53:11,582 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-27 12:53:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:11,584 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-27 12:53:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-27 12:53:11,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:11,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:11,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:11,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-27 12:53:11,587 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-27 12:53:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:11,588 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-27 12:53:11,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-27 12:53:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:53:11,589 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:11,589 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-27 12:53:11,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:53:11,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-27 12:53:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:11,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544388432] [2022-04-27 12:53:11,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:11,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:11,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635744003] [2022-04-27 12:53:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:11,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:11,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:53:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:11,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:53:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:11,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:12,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:53:12,127 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:12,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {1068#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:12,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1072#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:12,128 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1072#(not (= |assume_abort_if_not_#in~cond| 0))} {1027#true} #80#return; {1079#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:12,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:12,129 INFO L272 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,130 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #82#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:12,130 INFO L272 TraceCheckUtils]: 22: Hoare triple {1083#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,136 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1083#(<= 1 main_~b~0)} #84#return; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:12,136 INFO L290 TraceCheckUtils]: 27: Hoare triple {1083#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:12,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(#t~post6 < 2);havoc #t~post6; {1083#(<= 1 main_~b~0)} is VALID [2022-04-27 12:53:12,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {1083#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:53:12,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:53:12,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 2);havoc #t~post7; {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-27 12:53:12,141 INFO L272 TraceCheckUtils]: 32: Hoare triple {1123#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:12,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:12,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:53:12,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:53:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:12,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:12,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {1028#false} assume !false; {1028#false} is VALID [2022-04-27 12:53:12,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {1137#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1028#false} is VALID [2022-04-27 12:53:12,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1137#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:12,340 INFO L272 TraceCheckUtils]: 32: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1133#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:12,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 2);havoc #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:53:12,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:53:12,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {1027#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1153#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-27 12:53:12,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {1027#true} assume !!(#t~post6 < 2);havoc #t~post6; {1027#true} is VALID [2022-04-27 12:53:12,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {1027#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1027#true} is VALID [2022-04-27 12:53:12,344 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1027#true} {1027#true} #84#return; {1027#true} is VALID [2022-04-27 12:53:12,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L272 TraceCheckUtils]: 22: Hoare triple {1027#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1027#true} {1027#true} #82#return; {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {1027#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {1027#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1027#true} is VALID [2022-04-27 12:53:12,345 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1027#true} {1027#true} #80#return; {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L272 TraceCheckUtils]: 11: Hoare triple {1027#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1027#true} {1027#true} #78#return; {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {1027#true} assume !(0 == ~cond); {1027#true} is VALID [2022-04-27 12:53:12,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {1027#true} ~cond := #in~cond; {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {1027#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {1027#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {1027#true} call #t~ret8 := main(); {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1027#true} {1027#true} #98#return; {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1027#true} assume true; {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1027#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1027#true} is VALID [2022-04-27 12:53:12,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {1027#true} call ULTIMATE.init(); {1027#true} is VALID [2022-04-27 12:53:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:12,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544388432] [2022-04-27 12:53:12,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:12,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635744003] [2022-04-27 12:53:12,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635744003] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:53:12,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:53:12,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 12:53:12,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464401073] [2022-04-27 12:53:12,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:53:12,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:12,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:12,368 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-27 12:53:12,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:12,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:12,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:53:12,369 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:12,598 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:53:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:12,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-27 12:53:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:53:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:53:12,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:53:12,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:12,645 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:53:12,645 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 12:53:12,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:53:12,647 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:12,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:12,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 12:53:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 12:53:12,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:12,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:12,665 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:12,665 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:12,667 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:53:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:53:12,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:12,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:12,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:53:12,669 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-27 12:53:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:12,671 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 12:53:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:53:12,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:12,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:12,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:12,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-27 12:53:12,673 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-27 12:53:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:12,674 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-27 12:53:12,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:53:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 12:53:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:53:12,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:12,675 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1] [2022-04-27 12:53:12,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:12,879 WARN L477 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-27 12:53:12,880 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-27 12:53:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:12,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116494745] [2022-04-27 12:53:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:12,900 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046487452] [2022-04-27 12:53:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:12,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:12,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:12,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:12,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:53:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:12,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:53:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:12,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:13,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2022-04-27 12:53:13,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {1460#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1468#(<= ~counter~0 0)} {1460#true} #98#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {1468#(<= ~counter~0 0)} call #t~ret8 := main(); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,192 INFO L272 TraceCheckUtils]: 6: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #78#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,196 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #80#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {1468#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,196 INFO L272 TraceCheckUtils]: 17: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,198 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #82#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,198 INFO L272 TraceCheckUtils]: 22: Hoare triple {1468#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(<= ~counter~0 0)} ~cond := #in~cond; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {1468#(<= ~counter~0 0)} assume !(0 == ~cond); {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {1468#(<= ~counter~0 0)} assume true; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,209 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1468#(<= ~counter~0 0)} {1468#(<= ~counter~0 0)} #84#return; {1468#(<= ~counter~0 0)} is VALID [2022-04-27 12:53:13,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {1468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:53:13,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {1547#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:53:13,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {1547#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1547#(<= ~counter~0 1)} is VALID [2022-04-27 12:53:13,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {1547#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1557#(<= |main_#t~post7| 1)} is VALID [2022-04-27 12:53:13,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {1557#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1461#false} is VALID [2022-04-27 12:53:13,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {1461#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {1461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {1461#false} assume !(#t~post6 < 2);havoc #t~post6; {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L272 TraceCheckUtils]: 35: Hoare triple {1461#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {1461#false} ~cond := #in~cond; {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L290 TraceCheckUtils]: 37: Hoare triple {1461#false} assume 0 == ~cond; {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L290 TraceCheckUtils]: 38: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2022-04-27 12:53:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:13,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:53:13,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:13,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116494745] [2022-04-27 12:53:13,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:13,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046487452] [2022-04-27 12:53:13,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046487452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:53:13,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:53:13,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:53:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025286130] [2022-04-27 12:53:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:13,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:53:13,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:13,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:13,246 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-27 12:53:13,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:13,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:13,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:13,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:53:13,247 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:13,379 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:53:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-27 12:53:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:53:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-27 12:53:13,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-27 12:53:13,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:13,441 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:53:13,441 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 12:53:13,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:53:13,442 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:13,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:53:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 12:53:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-27 12:53:13,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:13,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:13,466 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:13,466 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:13,470 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:53:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:53:13,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:13,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:13,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:53:13,471 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-27 12:53:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:13,473 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-27 12:53:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:53:13,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:13,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:13,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:13,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:53:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-27 12:53:13,476 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-27 12:53:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:13,476 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-27 12:53:13,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:53:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-27 12:53:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 12:53:13,477 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:13,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2022-04-27 12:53:13,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:13,691 WARN L477 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-27 12:53:13,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-27 12:53:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833414402] [2022-04-27 12:53:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:13,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917698916] [2022-04-27 12:53:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:13,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:13,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:13,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:13,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:53:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:13,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:53:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:13,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:14,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:53:14,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:53:14,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:53:14,060 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:14,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {1869#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:14,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1873#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:14,062 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1873#(not (= |assume_abort_if_not_#in~cond| 0))} {1828#true} #80#return; {1880#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:14,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {1880#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,062 INFO L272 TraceCheckUtils]: 17: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,063 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,063 INFO L272 TraceCheckUtils]: 22: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,064 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 2);havoc #t~post7; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,067 INFO L272 TraceCheckUtils]: 32: Hoare triple {1884#(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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,068 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {1884#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:53:14,068 INFO L272 TraceCheckUtils]: 37: Hoare triple {1884#(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)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:14,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:14,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:53:14,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:53:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:53:14,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:14,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {1829#false} assume !false; {1829#false} is VALID [2022-04-27 12:53:14,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {1952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1829#false} is VALID [2022-04-27 12:53:14,284 INFO L290 TraceCheckUtils]: 38: Hoare triple {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:14,285 INFO L272 TraceCheckUtils]: 37: Hoare triple {1968#(= 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)); {1948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:14,286 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,286 INFO L272 TraceCheckUtils]: 32: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 2);havoc #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 2);havoc #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,291 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,291 INFO L290 TraceCheckUtils]: 24: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,291 INFO L272 TraceCheckUtils]: 22: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,292 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1828#true} {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,292 INFO L272 TraceCheckUtils]: 17: Hoare triple {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {1828#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1968#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:53:14,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1828#true} {1828#true} #80#return; {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {1828#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1828#true} {1828#true} #78#return; {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#true} assume !(0 == ~cond); {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#true} ~cond := #in~cond; {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {1828#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {1828#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {1828#true} call #t~ret8 := main(); {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1828#true} {1828#true} #98#return; {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1828#true} assume true; {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1828#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1828#true} call ULTIMATE.init(); {1828#true} is VALID [2022-04-27 12:53:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:53:14,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833414402] [2022-04-27 12:53:14,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917698916] [2022-04-27 12:53:14,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917698916] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:53:14,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:53:14,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:53:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275297722] [2022-04-27 12:53:14,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 41 [2022-04-27 12:53:14,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:14,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 12:53:14,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:53:14,328 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 12:53:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:14,640 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-27 12:53:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:14,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 41 [2022-04-27 12:53:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 12:53:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 12:53:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:14,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:53:14,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:14,708 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:53:14,708 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 12:53:14,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 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-27 12:53:14,709 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:14,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:53:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 12:53:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 12:53:14,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:14,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:14,741 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:14,741 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:14,744 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:53:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:53:14,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:14,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:14,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:53:14,745 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:53:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:14,748 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:53:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:53:14,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:14,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:14,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:14,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 12:53:14,752 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-27 12:53:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:14,752 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 12:53:14,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-27 12:53:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 12:53:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 12:53:14,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:14,753 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1] [2022-04-27 12:53:14,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:14,967 WARN L477 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-27 12:53:14,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-27 12:53:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:14,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928223384] [2022-04-27 12:53:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:14,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:14,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455257281] [2022-04-27 12:53:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:14,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:14,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:14,983 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:15,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:53:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:15,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:53:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:15,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:15,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:53:15,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:53:15,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:53:15,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:53:15,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2359#true} is VALID [2022-04-27 12:53:15,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:15,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {2385#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:15,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2389#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:15,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2389#(not (= |assume_abort_if_not_#in~cond| 0))} {2359#true} #78#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:53:15,317 INFO L272 TraceCheckUtils]: 11: Hoare triple {2396#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,318 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2396#(<= 1 main_~x~0)} #80#return; {2396#(<= 1 main_~x~0)} is VALID [2022-04-27 12:53:15,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,318 INFO L272 TraceCheckUtils]: 17: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,319 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,319 INFO L272 TraceCheckUtils]: 22: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,321 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 2);havoc #t~post7; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,327 INFO L272 TraceCheckUtils]: 32: Hoare triple {2415#(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 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,328 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,328 INFO L272 TraceCheckUtils]: 37: Hoare triple {2415#(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)); {2359#true} is VALID [2022-04-27 12:53:15,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,329 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2415#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:53:15,330 INFO L272 TraceCheckUtils]: 42: Hoare triple {2415#(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)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:15,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:15,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:53:15,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:53:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:53:15,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:53:15,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {2360#false} assume !false; {2360#false} is VALID [2022-04-27 12:53:15,553 INFO L290 TraceCheckUtils]: 44: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2360#false} is VALID [2022-04-27 12:53:15,553 INFO L290 TraceCheckUtils]: 43: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:15,554 INFO L272 TraceCheckUtils]: 42: Hoare triple {2514#(= 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)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:15,555 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,556 INFO L272 TraceCheckUtils]: 37: Hoare triple {2514#(= 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)); {2359#true} is VALID [2022-04-27 12:53:15,559 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,559 INFO L272 TraceCheckUtils]: 32: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 2);havoc #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 2);havoc #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,562 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,562 INFO L272 TraceCheckUtils]: 22: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,563 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2359#true} {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,563 INFO L272 TraceCheckUtils]: 17: Hoare triple {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {2359#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2514#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:53:15,564 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2359#true} {2359#true} #80#return; {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L272 TraceCheckUtils]: 11: Hoare triple {2359#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2359#true} {2359#true} #78#return; {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {2359#true} assume !(0 == ~cond); {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2359#true} ~cond := #in~cond; {2359#true} is VALID [2022-04-27 12:53:15,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {2359#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {2359#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {2359#true} call #t~ret8 := main(); {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2359#true} {2359#true} #98#return; {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {2359#true} assume true; {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {2359#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {2359#true} call ULTIMATE.init(); {2359#true} is VALID [2022-04-27 12:53:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:53:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:53:15,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928223384] [2022-04-27 12:53:15,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:53:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455257281] [2022-04-27 12:53:15,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455257281] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:53:15,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:53:15,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:53:15,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306867529] [2022-04-27 12:53:15,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:53:15,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:53:15,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:53:15,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:15,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:15,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:53:15,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:53:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:53:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:53:15,595 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:15,841 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-27 12:53:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:53:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-27 12:53:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:53:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:53:15,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:53:15,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:53:15,905 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:53:15,905 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 12:53:15,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 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-27 12:53:15,906 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:53:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:53:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 12:53:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 12:53:15,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:53:15,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:15,936 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:15,936 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:15,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:15,938 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:53:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:53:15,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:15,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:15,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:53:15,939 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-27 12:53:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:53:15,942 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-27 12:53:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-27 12:53:15,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:53:15,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:53:15,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:53:15,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:53:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:53:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-27 12:53:15,947 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-27 12:53:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:53:15,949 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-27 12:53:15,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 12:53:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-27 12:53:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 12:53:15,950 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:53:15,950 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 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-27 12:53:15,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:53:16,163 WARN L477 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-27 12:53:16,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:53:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:53:16,164 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-27 12:53:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:53:16,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401220916] [2022-04-27 12:53:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:53:16,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:53:16,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375425438] [2022-04-27 12:53:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:53:16,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:53:16,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:53:16,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:53:16,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:53:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:16,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 12:53:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:53:16,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:53:23,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {2938#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #98#return; {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret8 := main(); {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {2938#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~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; {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L272 TraceCheckUtils]: 6: Hoare triple {2938#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:23,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:23,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:23,921 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2938#true} {2938#true} #78#return; {2938#true} is VALID [2022-04-27 12:53:23,921 INFO L272 TraceCheckUtils]: 11: Hoare triple {2938#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {2938#true} ~cond := #in~cond; {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:53:23,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {2979#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:23,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2983#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:53:23,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2983#(not (= |assume_abort_if_not_#in~cond| 0))} {2938#true} #80#return; {2990#(<= 1 main_~y~0)} is VALID [2022-04-27 12:53:23,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {2990#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,923 INFO L272 TraceCheckUtils]: 17: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:23,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:23,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:23,924 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #82#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,924 INFO L272 TraceCheckUtils]: 22: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:23,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:23,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:23,925 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 2);havoc #t~post6; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 2);havoc #t~post7; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,928 INFO L272 TraceCheckUtils]: 32: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2022-04-27 12:53:23,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {2938#true} assume !(0 == ~cond); {2938#true} is VALID [2022-04-27 12:53:23,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {2938#true} assume true; {2938#true} is VALID [2022-04-27 12:53:23,929 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2938#true} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #86#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,929 INFO L272 TraceCheckUtils]: 37: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:23,932 INFO L290 TraceCheckUtils]: 39: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:23,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:23,934 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #88#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,934 INFO L272 TraceCheckUtils]: 42: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2938#true} is VALID [2022-04-27 12:53:23,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {2938#true} ~cond := #in~cond; {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:23,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {3061#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:23,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:53:23,936 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3065#(not (= |__VERIFIER_assert_#in~cond| 0))} {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} #90#return; {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 12:53:23,937 INFO L272 TraceCheckUtils]: 47: Hoare triple {2994#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:53:23,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {3090#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:53:23,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {3094#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2939#false} is VALID [2022-04-27 12:53:23,938 INFO L290 TraceCheckUtils]: 50: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2022-04-27 12:53:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 12:53:23,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:54:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:54:01,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401220916] [2022-04-27 12:54:01,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:54:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375425438] [2022-04-27 12:54:01,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375425438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:54:01,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:54:01,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-27 12:54:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682641046] [2022-04-27 12:54:01,593 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:54:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:54:01,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:54:01,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:01,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:01,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:54:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:54:01,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:54:01,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:54:01,627 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:03,537 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-27 12:54:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:54:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-27 12:54:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:54:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 12:54:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 12:54:03,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 12:54:03,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:54:03,600 INFO L225 Difference]: With dead ends: 65 [2022-04-27 12:54:03,600 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 12:54:03,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:54:03,601 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:54:03,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 12:54:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 12:54:03,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 12:54:03,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:54:03,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:03,637 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:03,637 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:03,639 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 12:54:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 12:54:03,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:03,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:03,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 12:54:03,640 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-27 12:54:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:54:03,643 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 12:54:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 12:54:03,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:54:03,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:54:03,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:54:03,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:54:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:54:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-27 12:54:03,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-27 12:54:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:54:03,646 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-27 12:54:03,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 12:54:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-27 12:54:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-27 12:54:03,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:54:03,647 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:03,666 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-27 12:54:03,847 WARN L477 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-27 12:54:03,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:54:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:54:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-27 12:54:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:54:03,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410064839] [2022-04-27 12:54:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:54:03,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:54:03,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818518346] [2022-04-27 12:54:03,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:54:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:54:03,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:54:03,862 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-27 12:54:03,875 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-27 12:54:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:54:03,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 12:54:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:54:03,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 12:54:03,962 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 12:54:03,963 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:54:03,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:54:04,187 WARN L477 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-27 12:54:04,190 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:54:04,193 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:54:04,239 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:54:04,240 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:54:04,241 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 12:54:04,242 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 12:54:04,243 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 12:54:04,243 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:54:04,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:54:04 BoogieIcfgContainer [2022-04-27 12:54:04,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:54:04,246 INFO L158 Benchmark]: Toolchain (without parser) took 55932.57ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 125.4MB in the beginning and 165.4MB in the end (delta: -39.9MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2022-04-27 12:54:04,246 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 142.3MB in the beginning and 142.2MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:54:04,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.89ms. Allocated memory is still 176.2MB. Free memory was 125.2MB in the beginning and 149.6MB in the end (delta: -24.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-04-27 12:54:04,247 INFO L158 Benchmark]: Boogie Preprocessor took 27.06ms. Allocated memory is still 176.2MB. Free memory was 149.6MB in the beginning and 148.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:54:04,247 INFO L158 Benchmark]: RCFGBuilder took 269.72ms. Allocated memory is still 176.2MB. Free memory was 148.1MB in the beginning and 134.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 12:54:04,247 INFO L158 Benchmark]: TraceAbstraction took 55398.71ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 134.4MB in the beginning and 165.4MB in the end (delta: -30.9MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2022-04-27 12:54:04,249 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.10ms. Allocated memory is still 176.2MB. Free memory was 142.3MB in the beginning and 142.2MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.89ms. Allocated memory is still 176.2MB. Free memory was 125.2MB in the beginning and 149.6MB in the end (delta: -24.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.06ms. Allocated memory is still 176.2MB. Free memory was 149.6MB in the beginning and 148.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 269.72ms. Allocated memory is still 176.2MB. Free memory was 148.1MB in the beginning and 134.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 55398.71ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 134.4MB in the beginning and 165.4MB in the end (delta: -30.9MB). Peak memory consumption was 32.2MB. 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=5, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=1, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=1, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L40] COND TRUE counter++<2 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1, b=2, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L46] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L46] COND TRUE counter++<2 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=2, y=2, yy=4] [L40] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=2, y=2, yy=4] [L40] COND FALSE !(counter++<2) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.3s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 993 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 664 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 454 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 329 mSDtfsCounter, 454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 403 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 48.1s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1000 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 287/328 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 12:54:04,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...