/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/fermat1-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:15:14,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:15:14,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:15:14,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:15:14,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:15:14,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:15:14,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:15:14,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:15:14,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:15:14,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:15:14,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:15:14,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:15:14,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:15:14,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:15:14,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:15:14,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:15:14,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:15:14,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:15:14,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:15:14,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:15:14,435 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:15:14,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:15:14,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:15:14,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:15:14,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:15:14,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:15:14,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:15:14,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:15:14,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:15:14,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:15:14,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:15:14,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:15:14,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:15:14,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:15:14,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:15:14,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:15:14,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:15:14,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:15:14,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:15:14,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:15:14,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:15:14,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:15:14,446 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 13:15:14,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:15:14,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:15:14,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:15:14,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:15:14,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:15:14,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:15:14,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:15:14,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:15:14,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:15:14,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:15:14,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:15:14,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:15:14,465 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:15:14,466 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:15:14,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:15:14,466 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 13:15:14,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:15:14,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:15:14,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:15:14,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:15:14,692 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:15:14,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-27 13:15:14,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd782bfec/d7f0f4c8b909440cbd2cf337172e31d0/FLAG96537000b [2022-04-27 13:15:15,101 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:15:15,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-27 13:15:15,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd782bfec/d7f0f4c8b909440cbd2cf337172e31d0/FLAG96537000b [2022-04-27 13:15:15,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd782bfec/d7f0f4c8b909440cbd2cf337172e31d0 [2022-04-27 13:15:15,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:15:15,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:15:15,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:15:15,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:15:15,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:15:15,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa9b356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15, skipping insertion in model container [2022-04-27 13:15:15,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:15:15,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:15:15,280 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/fermat1-ll_unwindbound10.c[535,548] [2022-04-27 13:15:15,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:15:15,302 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:15:15,319 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/fermat1-ll_unwindbound10.c[535,548] [2022-04-27 13:15:15,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:15:15,334 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:15:15,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15 WrapperNode [2022-04-27 13:15:15,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:15:15,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:15:15,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:15:15,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:15:15,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:15:15,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:15:15,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:15:15,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:15:15,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (1/1) ... [2022-04-27 13:15:15,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:15:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:15,401 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 13:15:15,407 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 13:15:15,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:15:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:15:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:15:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:15:15,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:15:15,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:15:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:15:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:15:15,430 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:15:15,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:15:15,473 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:15:15,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:15:15,654 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:15:15,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:15:15,659 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:15:15,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:15:15 BoogieIcfgContainer [2022-04-27 13:15:15,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:15:15,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:15:15,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:15:15,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:15:15,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:15:15" (1/3) ... [2022-04-27 13:15:15,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166515f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:15:15, skipping insertion in model container [2022-04-27 13:15:15,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:15" (2/3) ... [2022-04-27 13:15:15,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166515f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:15:15, skipping insertion in model container [2022-04-27 13:15:15,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:15:15" (3/3) ... [2022-04-27 13:15:15,672 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2022-04-27 13:15:15,681 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:15:15,681 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:15:15,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:15:15,754 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@4449a507, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b78d76f [2022-04-27 13:15:15,754 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:15:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:15:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:15:15,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:15,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:15,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:15,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-27 13:15:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157936895] [2022-04-27 13:15:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:15,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:15,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209483281] [2022-04-27 13:15:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:15,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:15,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:15,890 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 13:15:15,891 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 13:15:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:15,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:15:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:15,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:16,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-27 13:15:16,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:15:16,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:15:16,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-27 13:15:16,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-27 13:15:16,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:15:16,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-27 13:15:16,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:15:16,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:15:16,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:15:16,036 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:15:16,036 INFO L272 TraceCheckUtils]: 11: Hoare triple {41#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {41#false} is VALID [2022-04-27 13:15:16,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:15:16,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:15:16,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:15:16,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:15:16,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-27 13:15:16,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:15:16,037 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-27 13:15:16,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:15:16,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:15:16,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:15:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 13:15:16,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:16,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:16,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157936895] [2022-04-27 13:15:16,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:16,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209483281] [2022-04-27 13:15:16,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209483281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:16,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:16,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:15:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041771926] [2022-04-27 13:15:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:16,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:15:16,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:16,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:16,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:15:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:15:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:15:16,094 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:16,152 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-27 13:15:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:15:16,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:15:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:15:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:15:16,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-27 13:15:16,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:16,246 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:15:16,246 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:15:16,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:15:16,251 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:16,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:15:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:15:16,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:16,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,273 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,273 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:16,277 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:15:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:15:16,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:16,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:16,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-27 13:15:16,278 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-27 13:15:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:16,281 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:15:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:15:16,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:16,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:16,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:16,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:15:16,285 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-27 13:15:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:16,285 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:15:16,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:15:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:15:16,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:16,286 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:16,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:15:16,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-27 13:15:16,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:16,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-27 13:15:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:16,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083303876] [2022-04-27 13:15:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:16,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:16,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048626375] [2022-04-27 13:15:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:16,510 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 13:15:16,512 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 13:15:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:16,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:15:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:16,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:16,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-27 13:15:16,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {315#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,755 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:16,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {364#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:15:16,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {308#false} is VALID [2022-04-27 13:15:16,757 INFO L272 TraceCheckUtils]: 19: Hoare triple {308#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {308#false} is VALID [2022-04-27 13:15:16,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-27 13:15:16,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-27 13:15:16,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-27 13:15:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:16,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:16,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083303876] [2022-04-27 13:15:16,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048626375] [2022-04-27 13:15:16,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048626375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:16,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:16,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:15:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999070292] [2022-04-27 13:15:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:16,761 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:15:16,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:16,762 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:16,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:15:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:15:16,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:15:16,778 INFO L87 Difference]: Start difference. First operand 32 states and 41 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:16,875 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 13:15:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:15:16,876 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:15:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:16,877 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:15:16,885 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:15:16,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 13:15:16,920 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 13:15:16,923 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:15:16,923 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:15:16,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 13:15:16,926 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:16,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:15:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 13:15:16,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:16,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,939 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,940 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:16,945 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:15:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:15:16,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:16,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:16,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 13:15:16,948 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 13:15:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:16,955 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:15:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:15:16,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:16,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:16,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:16,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:15:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 13:15:16,964 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-27 13:15:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:16,965 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 13:15:16,965 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:15:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:15:16,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:15:16,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:16,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:16,989 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 13:15:17,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-27 13:15:17,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-27 13:15:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:17,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806963498] [2022-04-27 13:15:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:17,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:17,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175798403] [2022-04-27 13:15:17,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:17,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:17,200 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 13:15:17,201 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 13:15:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:17,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:15:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:17,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:17,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-27 13:15:17,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#true} is VALID [2022-04-27 13:15:17,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:15:17,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-27 13:15:17,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-27 13:15:17,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {554#true} is VALID [2022-04-27 13:15:17,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-27 13:15:17,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:15:17,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:15:17,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:15:17,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-27 13:15:17,578 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {554#true} is VALID [2022-04-27 13:15:17,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:15:17,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:15:17,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:15:17,579 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-27 13:15:19,582 WARN L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-27 13:15:19,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:15:19,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:15:21,587 WARN L272 TraceCheckUtils]: 19: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 13:15:21,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:21,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-27 13:15:21,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-27 13:15:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:21,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:21,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806963498] [2022-04-27 13:15:21,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:21,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175798403] [2022-04-27 13:15:21,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175798403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:21,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:21,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:15:21,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491277817] [2022-04-27 13:15:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:15:21,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:21,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:15:23,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:23,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:15:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:15:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:15:23,269 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:15:25,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:15:27,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:15:31,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:15:34,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:15:40,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:15:40,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:40,599 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:15:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:15:40,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:15:40,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:15:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:15:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:15:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:15:40,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 13:15:45,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:45,133 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:15:45,134 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:15:45,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:15:45,135 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:45,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 10.5s Time] [2022-04-27 13:15:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:15:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:15:45,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:45,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:45,156 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:45,156 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:45,158 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:15:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:15:45,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:45,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:45,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 13:15:45,159 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 13:15:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:45,160 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:15:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:15:45,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:45,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:45,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:45,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-27 13:15:45,163 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-27 13:15:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:45,164 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-27 13:15:45,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:15:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:15:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:15:45,164 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:45,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:45,182 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 13:15:45,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:45,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-27 13:15:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:45,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064281348] [2022-04-27 13:15:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:45,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:45,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157545889] [2022-04-27 13:15:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:45,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:45,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:45,380 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 13:15:45,380 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 13:15:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:45,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:15:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:45,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:45,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:15:45,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:15:45,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:15:45,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:15:45,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:15:45,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {877#true} is VALID [2022-04-27 13:15:45,562 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:15:45,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:15:45,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:15:45,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:15:45,562 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:15:45,562 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {877#true} is VALID [2022-04-27 13:15:45,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:15:45,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:15:45,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:15:45,563 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:15:45,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:15:45,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:15:45,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 10);havoc #t~post6; {877#true} is VALID [2022-04-27 13:15:45,565 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:15:45,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:45,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:45,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:45,567 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-27 13:15:45,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {953#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:15:45,568 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:45,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:45,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:15:45,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:15:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:45,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:45,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:15:45,971 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:15:45,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:15:45,972 INFO L272 TraceCheckUtils]: 25: Hoare triple {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:15:45,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {957#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:15:45,975 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} {877#true} #94#return; {984#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-27 13:15:45,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:45,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {946#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:15:45,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {997#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:15:45,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {877#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:15:45,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 10);havoc #t~post6; {877#true} is VALID [2022-04-27 13:15:45,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-27 13:15:45,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {877#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {877#true} is VALID [2022-04-27 13:15:45,979 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:15:45,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:15:45,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:15:45,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:15:45,980 INFO L272 TraceCheckUtils]: 11: Hoare triple {877#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {877#true} is VALID [2022-04-27 13:15:45,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:15:45,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:15:45,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:15:45,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:15:45,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {877#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {877#true} is VALID [2022-04-27 13:15:45,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {877#true} is VALID [2022-04-27 13:15:45,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:15:45,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:15:45,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:15:45,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {877#true} is VALID [2022-04-27 13:15:45,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:15:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:45,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:45,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064281348] [2022-04-27 13:15:45,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:45,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157545889] [2022-04-27 13:15:45,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157545889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:45,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:45,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:15:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044362491] [2022-04-27 13:15:45,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:45,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:15:45,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:45,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:15:46,005 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 13:15:46,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:15:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:15:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:15:46,007 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:15:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:46,428 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-27 13:15:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:15:46,429 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:15:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:15:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:15:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:15:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:15:46,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 13:15:46,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:46,471 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:15:46,471 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:15:46,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:15:46,472 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:46,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 171 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:15:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:15:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 13:15:46,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:46,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:46,482 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:46,483 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:46,485 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:15:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:15:46,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:46,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:46,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-27 13:15:46,485 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-27 13:15:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:46,487 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:15:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:15:46,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:46,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:46,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:46,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:15:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-27 13:15:46,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-27 13:15:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:46,490 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-27 13:15:46,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:15:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:15:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 13:15:46,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:46,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:46,513 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 13:15:46,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:46,691 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-27 13:15:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47831537] [2022-04-27 13:15:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:46,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:46,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590462143] [2022-04-27 13:15:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:46,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:46,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:46,703 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 13:15:46,704 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 13:15:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:46,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:15:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:46,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:46,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-27 13:15:46,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#(<= ~counter~0 0)} {1324#true} #102#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#(<= ~counter~0 0)} call #t~ret9 := main(); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {1332#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #90#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {1332#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(<= ~counter~0 0)} ~cond := #in~cond; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(<= ~counter~0 0)} assume !(0 == ~cond); {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(<= ~counter~0 0)} assume true; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1332#(<= ~counter~0 0)} {1332#(<= ~counter~0 0)} #92#return; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1332#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:46,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {1332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {1381#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {1381#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {1381#(<= ~counter~0 1)} ~cond := #in~cond; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {1381#(<= ~counter~0 1)} assume !(0 == ~cond); {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {1381#(<= ~counter~0 1)} assume true; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,908 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1381#(<= ~counter~0 1)} {1381#(<= ~counter~0 1)} #94#return; {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {1381#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1381#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:46,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {1381#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:15:46,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1325#false} is VALID [2022-04-27 13:15:46,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {1325#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {1325#false} assume !(#t~post8 < 10);havoc #t~post8; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {1325#false} assume !(#t~post6 < 10);havoc #t~post6; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L272 TraceCheckUtils]: 31: Hoare triple {1325#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {1325#false} ~cond := #in~cond; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {1325#false} assume 0 == ~cond; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-27 13:15:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:46,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:46,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:46,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47831537] [2022-04-27 13:15:46,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:46,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590462143] [2022-04-27 13:15:46,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590462143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:46,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:46,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:15:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37226060] [2022-04-27 13:15:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:46,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 13:15:46,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:46,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:15:46,930 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 13:15:46,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:15:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:46,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:15:46,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:15:46,931 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:15:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,024 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-27 13:15:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:15:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-27 13:15:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:15:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:15:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:15:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:15:47,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 13:15:47,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:47,078 INFO L225 Difference]: With dead ends: 97 [2022-04-27 13:15:47,078 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 13:15:47,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 13:15:47,079 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:47,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 13:15:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 13:15:47,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:47,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:15:47,091 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:15:47,091 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:15:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,093 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 13:15:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 13:15:47,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:47,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:47,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-27 13:15:47,094 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-27 13:15:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,095 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-27 13:15:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 13:15:47,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:47,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:47,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:47,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:15:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-27 13:15:47,098 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-27 13:15:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:47,098 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-27 13:15:47,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 13:15:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-27 13:15:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:15:47,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:47,099 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:47,115 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 13:15:47,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:47,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-27 13:15:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331524367] [2022-04-27 13:15:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:47,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:47,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:47,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1852651696] [2022-04-27 13:15:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:47,326 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 13:15:47,327 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 13:15:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:47,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:15:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:47,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:47,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-27 13:15:47,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1782#(<= ~counter~0 0)} {1774#true} #102#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {1782#(<= ~counter~0 0)} call #t~ret9 := main(); {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {1782#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {1782#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#(<= ~counter~0 0)} ~cond := #in~cond; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {1782#(<= ~counter~0 0)} assume !(0 == ~cond); {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} #90#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,528 INFO L272 TraceCheckUtils]: 11: Hoare triple {1782#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {1782#(<= ~counter~0 0)} ~cond := #in~cond; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#(<= ~counter~0 0)} assume !(0 == ~cond); {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#(<= ~counter~0 0)} assume true; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,529 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1782#(<= ~counter~0 0)} {1782#(<= ~counter~0 0)} #92#return; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1782#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:47,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,532 INFO L272 TraceCheckUtils]: 19: Hoare triple {1831#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {1831#(<= ~counter~0 1)} ~cond := #in~cond; {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {1831#(<= ~counter~0 1)} assume !(0 == ~cond); {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {1831#(<= ~counter~0 1)} assume true; {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,535 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1831#(<= ~counter~0 1)} {1831#(<= ~counter~0 1)} #94#return; {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {1831#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1831#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:47,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {1831#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,536 INFO L272 TraceCheckUtils]: 27: Hoare triple {1856#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {1856#(<= ~counter~0 2)} ~cond := #in~cond; {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {1856#(<= ~counter~0 2)} assume !(0 == ~cond); {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {1856#(<= ~counter~0 2)} assume true; {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,538 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1856#(<= ~counter~0 2)} {1856#(<= ~counter~0 2)} #96#return; {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {1856#(<= ~counter~0 2)} assume !(~r~0 > 0); {1856#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:47,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {1856#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1881#(<= |main_#t~post8| 2)} is VALID [2022-04-27 13:15:47,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {1881#(<= |main_#t~post8| 2)} assume !(#t~post8 < 10);havoc #t~post8; {1775#false} is VALID [2022-04-27 13:15:47,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#false} is VALID [2022-04-27 13:15:47,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} assume !(#t~post6 < 10);havoc #t~post6; {1775#false} is VALID [2022-04-27 13:15:47,539 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1775#false} is VALID [2022-04-27 13:15:47,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-27 13:15:47,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-27 13:15:47,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-27 13:15:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:47,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:47,717 INFO L290 TraceCheckUtils]: 40: Hoare triple {1775#false} assume !false; {1775#false} is VALID [2022-04-27 13:15:47,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {1775#false} assume 0 == ~cond; {1775#false} is VALID [2022-04-27 13:15:47,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {1775#false} ~cond := #in~cond; {1775#false} is VALID [2022-04-27 13:15:47,717 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1775#false} is VALID [2022-04-27 13:15:47,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#false} assume !(#t~post6 < 10);havoc #t~post6; {1775#false} is VALID [2022-04-27 13:15:47,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#false} is VALID [2022-04-27 13:15:47,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {1921#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {1775#false} is VALID [2022-04-27 13:15:47,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {1925#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1921#(< |main_#t~post8| 10)} is VALID [2022-04-27 13:15:47,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {1925#(< ~counter~0 10)} assume !(~r~0 > 0); {1925#(< ~counter~0 10)} is VALID [2022-04-27 13:15:47,719 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1774#true} {1925#(< ~counter~0 10)} #96#return; {1925#(< ~counter~0 10)} is VALID [2022-04-27 13:15:47,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-27 13:15:47,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-27 13:15:47,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-27 13:15:47,719 INFO L272 TraceCheckUtils]: 27: Hoare triple {1925#(< ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1774#true} is VALID [2022-04-27 13:15:47,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {1925#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {1925#(< ~counter~0 10)} is VALID [2022-04-27 13:15:47,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {1950#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1925#(< ~counter~0 10)} is VALID [2022-04-27 13:15:47,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {1950#(< ~counter~0 9)} assume !!(0 != ~r~0); {1950#(< ~counter~0 9)} is VALID [2022-04-27 13:15:47,721 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1774#true} {1950#(< ~counter~0 9)} #94#return; {1950#(< ~counter~0 9)} is VALID [2022-04-27 13:15:47,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-27 13:15:47,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-27 13:15:47,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-27 13:15:47,721 INFO L272 TraceCheckUtils]: 19: Hoare triple {1950#(< ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1774#true} is VALID [2022-04-27 13:15:47,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {1950#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {1950#(< ~counter~0 9)} is VALID [2022-04-27 13:15:47,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {1975#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1950#(< ~counter~0 9)} is VALID [2022-04-27 13:15:47,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {1975#(< ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,722 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1774#true} {1975#(< ~counter~0 8)} #92#return; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-27 13:15:47,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-27 13:15:47,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-27 13:15:47,723 INFO L272 TraceCheckUtils]: 11: Hoare triple {1975#(< ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1774#true} is VALID [2022-04-27 13:15:47,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1774#true} {1975#(< ~counter~0 8)} #90#return; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {1774#true} assume true; {1774#true} is VALID [2022-04-27 13:15:47,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {1774#true} assume !(0 == ~cond); {1774#true} is VALID [2022-04-27 13:15:47,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {1774#true} ~cond := #in~cond; {1774#true} is VALID [2022-04-27 13:15:47,724 INFO L272 TraceCheckUtils]: 6: Hoare triple {1975#(< ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1774#true} is VALID [2022-04-27 13:15:47,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {1975#(< ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {1975#(< ~counter~0 8)} call #t~ret9 := main(); {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1975#(< ~counter~0 8)} {1774#true} #102#return; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1975#(< ~counter~0 8)} assume true; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1774#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1975#(< ~counter~0 8)} is VALID [2022-04-27 13:15:47,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {1774#true} call ULTIMATE.init(); {1774#true} is VALID [2022-04-27 13:15:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:15:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:47,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331524367] [2022-04-27 13:15:47,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:47,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852651696] [2022-04-27 13:15:47,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852651696] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:15:47,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:15:47,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-27 13:15:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139299349] [2022-04-27 13:15:47,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-27 13:15:47,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:47,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:15:47,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:47,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:15:47,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:47,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:15:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:15:47,752 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:15:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,876 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-27 13:15:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:15:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-27 13:15:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:15:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:15:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:15:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:15:47,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-27 13:15:47,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:47,935 INFO L225 Difference]: With dead ends: 106 [2022-04-27 13:15:47,936 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:15:47,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:15:47,936 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:47,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:15:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:15:47,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:47,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:15:47,954 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:15:47,954 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:15:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,955 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-27 13:15:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-27 13:15:47,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:47,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:47,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-27 13:15:47,956 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-27 13:15:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:47,958 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-27 13:15:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-27 13:15:47,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:47,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:47,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:47,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:15:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-27 13:15:47,960 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-27 13:15:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:47,960 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-27 13:15:47,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-27 13:15:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-27 13:15:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:15:47,961 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:47,961 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:47,979 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 13:15:48,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:48,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-27 13:15:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:48,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944525821] [2022-04-27 13:15:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:48,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:48,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385926488] [2022-04-27 13:15:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:48,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:48,188 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 13:15:48,189 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 13:15:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:48,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:15:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:48,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:48,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2410#true} is VALID [2022-04-27 13:15:48,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#(<= ~counter~0 0)} {2410#true} #102#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#(<= ~counter~0 0)} call #t~ret9 := main(); {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {2418#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {2418#(<= ~counter~0 0)} ~cond := #in~cond; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {2418#(<= ~counter~0 0)} assume !(0 == ~cond); {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} #90#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,421 INFO L272 TraceCheckUtils]: 11: Hoare triple {2418#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {2418#(<= ~counter~0 0)} ~cond := #in~cond; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {2418#(<= ~counter~0 0)} assume !(0 == ~cond); {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#(<= ~counter~0 0)} assume true; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,424 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2418#(<= ~counter~0 0)} {2418#(<= ~counter~0 0)} #92#return; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2418#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:48,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {2418#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {2467#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {2467#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {2467#(<= ~counter~0 1)} ~cond := #in~cond; {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {2467#(<= ~counter~0 1)} assume !(0 == ~cond); {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {2467#(<= ~counter~0 1)} assume true; {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,427 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2467#(<= ~counter~0 1)} {2467#(<= ~counter~0 1)} #94#return; {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2467#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:48,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {2467#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {2492#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,429 INFO L272 TraceCheckUtils]: 27: Hoare triple {2492#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {2492#(<= ~counter~0 2)} ~cond := #in~cond; {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {2492#(<= ~counter~0 2)} assume !(0 == ~cond); {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {2492#(<= ~counter~0 2)} assume true; {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,430 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2492#(<= ~counter~0 2)} {2492#(<= ~counter~0 2)} #96#return; {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {2492#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2492#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:48,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {2492#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2517#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:15:48,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {2517#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {2411#false} is VALID [2022-04-27 13:15:48,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2411#false} is VALID [2022-04-27 13:15:48,431 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} assume !(#t~post8 < 10);havoc #t~post8; {2411#false} is VALID [2022-04-27 13:15:48,431 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#false} is VALID [2022-04-27 13:15:48,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} assume !(#t~post6 < 10);havoc #t~post6; {2411#false} is VALID [2022-04-27 13:15:48,432 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2411#false} is VALID [2022-04-27 13:15:48,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} ~cond := #in~cond; {2411#false} is VALID [2022-04-27 13:15:48,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} assume 0 == ~cond; {2411#false} is VALID [2022-04-27 13:15:48,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-27 13:15:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:48,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:48,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {2411#false} assume !false; {2411#false} is VALID [2022-04-27 13:15:48,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {2411#false} assume 0 == ~cond; {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {2411#false} ~cond := #in~cond; {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L272 TraceCheckUtils]: 39: Hoare triple {2411#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {2411#false} assume !(#t~post6 < 10);havoc #t~post6; {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {2411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {2411#false} assume !(#t~post8 < 10);havoc #t~post8; {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {2411#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2411#false} is VALID [2022-04-27 13:15:48,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {2569#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {2411#false} is VALID [2022-04-27 13:15:48,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {2573#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2569#(< |main_#t~post7| 10)} is VALID [2022-04-27 13:15:48,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {2573#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2573#(< ~counter~0 10)} is VALID [2022-04-27 13:15:48,634 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2410#true} {2573#(< ~counter~0 10)} #96#return; {2573#(< ~counter~0 10)} is VALID [2022-04-27 13:15:48,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-27 13:15:48,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-27 13:15:48,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-27 13:15:48,634 INFO L272 TraceCheckUtils]: 27: Hoare triple {2573#(< ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2410#true} is VALID [2022-04-27 13:15:48,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {2573#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {2573#(< ~counter~0 10)} is VALID [2022-04-27 13:15:48,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {2598#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2573#(< ~counter~0 10)} is VALID [2022-04-27 13:15:48,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {2598#(< ~counter~0 9)} assume !!(0 != ~r~0); {2598#(< ~counter~0 9)} is VALID [2022-04-27 13:15:48,636 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2410#true} {2598#(< ~counter~0 9)} #94#return; {2598#(< ~counter~0 9)} is VALID [2022-04-27 13:15:48,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-27 13:15:48,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-27 13:15:48,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-27 13:15:48,636 INFO L272 TraceCheckUtils]: 19: Hoare triple {2598#(< ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2410#true} is VALID [2022-04-27 13:15:48,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {2598#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2598#(< ~counter~0 9)} is VALID [2022-04-27 13:15:48,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {2623#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2598#(< ~counter~0 9)} is VALID [2022-04-27 13:15:48,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(< ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,638 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2410#true} {2623#(< ~counter~0 8)} #92#return; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-27 13:15:48,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-27 13:15:48,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-27 13:15:48,638 INFO L272 TraceCheckUtils]: 11: Hoare triple {2623#(< ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2410#true} is VALID [2022-04-27 13:15:48,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2410#true} {2623#(< ~counter~0 8)} #90#return; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {2410#true} assume true; {2410#true} is VALID [2022-04-27 13:15:48,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {2410#true} assume !(0 == ~cond); {2410#true} is VALID [2022-04-27 13:15:48,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {2410#true} ~cond := #in~cond; {2410#true} is VALID [2022-04-27 13:15:48,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {2623#(< ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2410#true} is VALID [2022-04-27 13:15:48,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {2623#(< ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {2623#(< ~counter~0 8)} call #t~ret9 := main(); {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2623#(< ~counter~0 8)} {2410#true} #102#return; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {2623#(< ~counter~0 8)} assume true; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {2410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2623#(< ~counter~0 8)} is VALID [2022-04-27 13:15:48,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {2410#true} call ULTIMATE.init(); {2410#true} is VALID [2022-04-27 13:15:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:15:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:48,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944525821] [2022-04-27 13:15:48,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:48,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385926488] [2022-04-27 13:15:48,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385926488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:48,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:48,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:15:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79760208] [2022-04-27 13:15:48,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-27 13:15:48,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:48,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:15:48,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:48,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:15:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:15:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:15:48,694 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:15:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,011 INFO L93 Difference]: Finished difference Result 189 states and 244 transitions. [2022-04-27 13:15:49,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:15:49,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 43 [2022-04-27 13:15:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:15:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:15:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:15:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:15:49,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-27 13:15:49,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:49,118 INFO L225 Difference]: With dead ends: 189 [2022-04-27 13:15:49,118 INFO L226 Difference]: Without dead ends: 152 [2022-04-27 13:15:49,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:15:49,119 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:49,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 179 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:15:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-27 13:15:49,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2022-04-27 13:15:49,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:49,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:15:49,164 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:15:49,164 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:15:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,167 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-27 13:15:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-27 13:15:49,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:49,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:49,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 152 states. [2022-04-27 13:15:49,169 INFO L87 Difference]: Start difference. First operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 152 states. [2022-04-27 13:15:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,172 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-27 13:15:49,172 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-27 13:15:49,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:49,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:49,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:49,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 101 states have internal predecessors, (124), 25 states have call successors, (25), 13 states have call predecessors, (25), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:15:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2022-04-27 13:15:49,176 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 43 [2022-04-27 13:15:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:49,176 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2022-04-27 13:15:49,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 8 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-27 13:15:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2022-04-27 13:15:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:15:49,177 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:49,177 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:49,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 13:15:49,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:49,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:49,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-27 13:15:49,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:49,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550443116] [2022-04-27 13:15:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:49,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:49,405 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:49,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682461047] [2022-04-27 13:15:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:49,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:49,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:49,407 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 13:15:49,408 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 13:15:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:49,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:15:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:49,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:49,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {3440#true} call ULTIMATE.init(); {3440#true} is VALID [2022-04-27 13:15:49,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {3440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3440#true} is VALID [2022-04-27 13:15:49,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-27 13:15:49,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3440#true} {3440#true} #102#return; {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {3440#true} call #t~ret9 := main(); {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {3440#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L272 TraceCheckUtils]: 6: Hoare triple {3440#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3440#true} {3440#true} #90#return; {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L272 TraceCheckUtils]: 11: Hoare triple {3440#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-27 13:15:49,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3440#true} {3440#true} #92#return; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {3440#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {3440#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {3440#true} assume !!(#t~post6 < 10);havoc #t~post6; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L272 TraceCheckUtils]: 19: Hoare triple {3440#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3440#true} {3440#true} #94#return; {3440#true} is VALID [2022-04-27 13:15:49,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {3440#true} assume !!(0 != ~r~0); {3517#(not (= main_~r~0 0))} is VALID [2022-04-27 13:15:49,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {3517#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3517#(not (= main_~r~0 0))} is VALID [2022-04-27 13:15:49,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {3517#(not (= main_~r~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3517#(not (= main_~r~0 0))} is VALID [2022-04-27 13:15:49,590 INFO L272 TraceCheckUtils]: 27: Hoare triple {3517#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3440#true} is VALID [2022-04-27 13:15:49,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-27 13:15:49,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-27 13:15:49,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-27 13:15:49,591 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3440#true} {3517#(not (= main_~r~0 0))} #96#return; {3517#(not (= main_~r~0 0))} is VALID [2022-04-27 13:15:49,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {3517#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:15:49,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:15:49,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:15:49,592 INFO L272 TraceCheckUtils]: 35: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3440#true} is VALID [2022-04-27 13:15:49,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {3440#true} ~cond := #in~cond; {3440#true} is VALID [2022-04-27 13:15:49,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {3440#true} assume !(0 == ~cond); {3440#true} is VALID [2022-04-27 13:15:49,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {3440#true} assume true; {3440#true} is VALID [2022-04-27 13:15:49,597 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3440#true} {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:15:49,598 INFO L290 TraceCheckUtils]: 40: Hoare triple {3542#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L290 TraceCheckUtils]: 41: Hoare triple {3441#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L290 TraceCheckUtils]: 42: Hoare triple {3441#false} assume !(#t~post6 < 10);havoc #t~post6; {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L272 TraceCheckUtils]: 43: Hoare triple {3441#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {3441#false} ~cond := #in~cond; {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {3441#false} assume 0 == ~cond; {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {3441#false} assume !false; {3441#false} is VALID [2022-04-27 13:15:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:15:49,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:49,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:49,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550443116] [2022-04-27 13:15:49,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:49,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682461047] [2022-04-27 13:15:49,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682461047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:49,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:49,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:15:49,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681131915] [2022-04-27 13:15:49,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:49,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-27 13:15:49,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:49,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:15:49,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:49,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:15:49,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:15:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:15:49,625 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:15:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,774 INFO L93 Difference]: Finished difference Result 227 states and 304 transitions. [2022-04-27 13:15:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:15:49,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-27 13:15:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:15:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:15:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:15:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:15:49,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 13:15:49,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:49,862 INFO L225 Difference]: With dead ends: 227 [2022-04-27 13:15:49,862 INFO L226 Difference]: Without dead ends: 172 [2022-04-27 13:15:49,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:15:49,863 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:49,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-27 13:15:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2022-04-27 13:15:49,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:49,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:15:49,900 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:15:49,900 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:15:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,904 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-04-27 13:15:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-04-27 13:15:49,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:49,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:49,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-27 13:15:49,906 INFO L87 Difference]: Start difference. First operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-27 13:15:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:49,910 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2022-04-27 13:15:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2022-04-27 13:15:49,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:49,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:49,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:49,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 115 states have internal predecessors, (143), 30 states have call successors, (30), 12 states have call predecessors, (30), 10 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:15:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 201 transitions. [2022-04-27 13:15:49,915 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 201 transitions. Word has length 47 [2022-04-27 13:15:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:49,915 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 201 transitions. [2022-04-27 13:15:49,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:15:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 201 transitions. [2022-04-27 13:15:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 13:15:49,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:49,916 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:49,941 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 13:15:50,131 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,SelfDestructingSolverStorable7 [2022-04-27 13:15:50,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-27 13:15:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317743735] [2022-04-27 13:15:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:50,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:50,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890548437] [2022-04-27 13:15:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:50,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:50,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:15:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:50,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:15:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:50,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:50,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-27 13:15:50,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4468#(<= ~counter~0 0)} {4460#true} #102#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {4468#(<= ~counter~0 0)} call #t~ret9 := main(); {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {4468#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {4468#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {4468#(<= ~counter~0 0)} ~cond := #in~cond; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {4468#(<= ~counter~0 0)} assume !(0 == ~cond); {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4468#(<= ~counter~0 0)} {4468#(<= ~counter~0 0)} #90#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {4468#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(<= ~counter~0 0)} ~cond := #in~cond; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(<= ~counter~0 0)} assume !(0 == ~cond); {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {4468#(<= ~counter~0 0)} assume true; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,403 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4468#(<= ~counter~0 0)} {4468#(<= ~counter~0 0)} #92#return; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {4468#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4468#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:50,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {4468#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {4517#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,405 INFO L272 TraceCheckUtils]: 19: Hoare triple {4517#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {4517#(<= ~counter~0 1)} ~cond := #in~cond; {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {4517#(<= ~counter~0 1)} assume !(0 == ~cond); {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {4517#(<= ~counter~0 1)} assume true; {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4517#(<= ~counter~0 1)} {4517#(<= ~counter~0 1)} #94#return; {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {4517#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4517#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:50,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {4517#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {4542#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,408 INFO L272 TraceCheckUtils]: 27: Hoare triple {4542#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {4542#(<= ~counter~0 2)} ~cond := #in~cond; {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {4542#(<= ~counter~0 2)} assume !(0 == ~cond); {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {4542#(<= ~counter~0 2)} assume true; {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,410 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4542#(<= ~counter~0 2)} {4542#(<= ~counter~0 2)} #96#return; {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {4542#(<= ~counter~0 2)} assume !(~r~0 > 0); {4542#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:50,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {4542#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {4567#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,411 INFO L272 TraceCheckUtils]: 35: Hoare triple {4567#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {4567#(<= ~counter~0 3)} ~cond := #in~cond; {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {4567#(<= ~counter~0 3)} assume !(0 == ~cond); {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,412 INFO L290 TraceCheckUtils]: 38: Hoare triple {4567#(<= ~counter~0 3)} assume true; {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,413 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4567#(<= ~counter~0 3)} {4567#(<= ~counter~0 3)} #98#return; {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {4567#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4567#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:50,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {4567#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4592#(<= |main_#t~post8| 3)} is VALID [2022-04-27 13:15:50,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {4592#(<= |main_#t~post8| 3)} assume !(#t~post8 < 10);havoc #t~post8; {4461#false} is VALID [2022-04-27 13:15:50,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4461#false} is VALID [2022-04-27 13:15:50,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} assume !(#t~post6 < 10);havoc #t~post6; {4461#false} is VALID [2022-04-27 13:15:50,414 INFO L272 TraceCheckUtils]: 45: Hoare triple {4461#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4461#false} is VALID [2022-04-27 13:15:50,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-27 13:15:50,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-27 13:15:50,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-27 13:15:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:50,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:50,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-27 13:15:50,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-27 13:15:50,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-27 13:15:50,632 INFO L272 TraceCheckUtils]: 45: Hoare triple {4461#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4461#false} is VALID [2022-04-27 13:15:50,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} assume !(#t~post6 < 10);havoc #t~post6; {4461#false} is VALID [2022-04-27 13:15:50,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {4461#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4461#false} is VALID [2022-04-27 13:15:50,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {4632#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {4461#false} is VALID [2022-04-27 13:15:50,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {4636#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4632#(< |main_#t~post8| 10)} is VALID [2022-04-27 13:15:50,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {4636#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4636#(< ~counter~0 10)} is VALID [2022-04-27 13:15:50,634 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4460#true} {4636#(< ~counter~0 10)} #98#return; {4636#(< ~counter~0 10)} is VALID [2022-04-27 13:15:50,634 INFO L290 TraceCheckUtils]: 38: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-27 13:15:50,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-27 13:15:50,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-27 13:15:50,634 INFO L272 TraceCheckUtils]: 35: Hoare triple {4636#(< ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4460#true} is VALID [2022-04-27 13:15:50,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {4636#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {4636#(< ~counter~0 10)} is VALID [2022-04-27 13:15:50,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {4661#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4636#(< ~counter~0 10)} is VALID [2022-04-27 13:15:50,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {4661#(< ~counter~0 9)} assume !(~r~0 > 0); {4661#(< ~counter~0 9)} is VALID [2022-04-27 13:15:50,636 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4460#true} {4661#(< ~counter~0 9)} #96#return; {4661#(< ~counter~0 9)} is VALID [2022-04-27 13:15:50,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-27 13:15:50,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-27 13:15:50,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-27 13:15:50,636 INFO L272 TraceCheckUtils]: 27: Hoare triple {4661#(< ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4460#true} is VALID [2022-04-27 13:15:50,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {4661#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {4661#(< ~counter~0 9)} is VALID [2022-04-27 13:15:50,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {4686#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4661#(< ~counter~0 9)} is VALID [2022-04-27 13:15:50,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {4686#(< ~counter~0 8)} assume !!(0 != ~r~0); {4686#(< ~counter~0 8)} is VALID [2022-04-27 13:15:50,637 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4460#true} {4686#(< ~counter~0 8)} #94#return; {4686#(< ~counter~0 8)} is VALID [2022-04-27 13:15:50,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-27 13:15:50,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-27 13:15:50,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-27 13:15:50,638 INFO L272 TraceCheckUtils]: 19: Hoare triple {4686#(< ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4460#true} is VALID [2022-04-27 13:15:50,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {4686#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4686#(< ~counter~0 8)} is VALID [2022-04-27 13:15:50,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {4711#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4686#(< ~counter~0 8)} is VALID [2022-04-27 13:15:50,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {4711#(< ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,639 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4460#true} {4711#(< ~counter~0 7)} #92#return; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-27 13:15:50,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-27 13:15:50,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-27 13:15:50,640 INFO L272 TraceCheckUtils]: 11: Hoare triple {4711#(< ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4460#true} is VALID [2022-04-27 13:15:50,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4460#true} {4711#(< ~counter~0 7)} #90#return; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-27 13:15:50,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} assume !(0 == ~cond); {4460#true} is VALID [2022-04-27 13:15:50,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} ~cond := #in~cond; {4460#true} is VALID [2022-04-27 13:15:50,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {4711#(< ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4460#true} is VALID [2022-04-27 13:15:50,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {4711#(< ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {4711#(< ~counter~0 7)} call #t~ret9 := main(); {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4711#(< ~counter~0 7)} {4460#true} #102#return; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {4711#(< ~counter~0 7)} assume true; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4711#(< ~counter~0 7)} is VALID [2022-04-27 13:15:50,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-27 13:15:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:15:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:50,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317743735] [2022-04-27 13:15:50,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:50,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890548437] [2022-04-27 13:15:50,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890548437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:50,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:50,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 13:15:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234313812] [2022-04-27 13:15:50,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:50,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-27 13:15:50,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:50,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:15:50,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:50,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:15:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:15:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:15:50,704 INFO L87 Difference]: Start difference. First operand 154 states and 201 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:15:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:51,255 INFO L93 Difference]: Finished difference Result 343 states and 458 transitions. [2022-04-27 13:15:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:15:51,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 49 [2022-04-27 13:15:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:15:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:15:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:15:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:15:51,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-27 13:15:51,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:51,414 INFO L225 Difference]: With dead ends: 343 [2022-04-27 13:15:51,415 INFO L226 Difference]: Without dead ends: 258 [2022-04-27 13:15:51,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-04-27 13:15:51,416 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:51,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 262 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:15:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-04-27 13:15:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2022-04-27 13:15:51,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:51,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:15:51,485 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:15:51,485 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:15:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:51,491 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2022-04-27 13:15:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-04-27 13:15:51,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:51,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:51,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 258 states. [2022-04-27 13:15:51,492 INFO L87 Difference]: Start difference. First operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 258 states. [2022-04-27 13:15:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:51,497 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2022-04-27 13:15:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 329 transitions. [2022-04-27 13:15:51,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:51,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:51,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:51,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 46 states have call successors, (46), 16 states have call predecessors, (46), 14 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-27 13:15:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 310 transitions. [2022-04-27 13:15:51,502 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 310 transitions. Word has length 49 [2022-04-27 13:15:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:51,503 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 310 transitions. [2022-04-27 13:15:51,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 10 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 13:15:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 310 transitions. [2022-04-27 13:15:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:15:51,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:51,503 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:51,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:15:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:51,722 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-27 13:15:51,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:51,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057528360] [2022-04-27 13:15:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:51,732 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:51,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554455016] [2022-04-27 13:15:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:51,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:51,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:51,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:51,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:15:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:15:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:52,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-27 13:15:52,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6099#(<= ~counter~0 0)} {6091#true} #102#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {6099#(<= ~counter~0 0)} call #t~ret9 := main(); {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {6099#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,033 INFO L272 TraceCheckUtils]: 6: Hoare triple {6099#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {6099#(<= ~counter~0 0)} ~cond := #in~cond; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {6099#(<= ~counter~0 0)} assume !(0 == ~cond); {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6099#(<= ~counter~0 0)} {6099#(<= ~counter~0 0)} #90#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {6099#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {6099#(<= ~counter~0 0)} ~cond := #in~cond; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {6099#(<= ~counter~0 0)} assume !(0 == ~cond); {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {6099#(<= ~counter~0 0)} assume true; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,043 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6099#(<= ~counter~0 0)} {6099#(<= ~counter~0 0)} #92#return; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {6099#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6099#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:52,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {6099#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {6148#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {6148#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {6148#(<= ~counter~0 1)} ~cond := #in~cond; {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {6148#(<= ~counter~0 1)} assume !(0 == ~cond); {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {6148#(<= ~counter~0 1)} assume true; {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,046 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6148#(<= ~counter~0 1)} {6148#(<= ~counter~0 1)} #94#return; {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {6148#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6148#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:52,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {6148#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {6173#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,047 INFO L272 TraceCheckUtils]: 27: Hoare triple {6173#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {6173#(<= ~counter~0 2)} ~cond := #in~cond; {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {6173#(<= ~counter~0 2)} assume !(0 == ~cond); {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {6173#(<= ~counter~0 2)} assume true; {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,049 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6173#(<= ~counter~0 2)} {6173#(<= ~counter~0 2)} #96#return; {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {6173#(<= ~counter~0 2)} assume !(~r~0 > 0); {6173#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:52,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {6173#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {6198#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,050 INFO L272 TraceCheckUtils]: 35: Hoare triple {6198#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {6198#(<= ~counter~0 3)} ~cond := #in~cond; {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {6198#(<= ~counter~0 3)} assume !(0 == ~cond); {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {6198#(<= ~counter~0 3)} assume true; {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,052 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6198#(<= ~counter~0 3)} {6198#(<= ~counter~0 3)} #98#return; {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {6198#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6198#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:52,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {6198#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {6223#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,053 INFO L272 TraceCheckUtils]: 43: Hoare triple {6223#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {6223#(<= ~counter~0 4)} ~cond := #in~cond; {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {6223#(<= ~counter~0 4)} assume !(0 == ~cond); {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {6223#(<= ~counter~0 4)} assume true; {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,054 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6223#(<= ~counter~0 4)} {6223#(<= ~counter~0 4)} #98#return; {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {6223#(<= ~counter~0 4)} assume !(~r~0 < 0); {6223#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:52,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {6223#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6248#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:15:52,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {6248#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {6092#false} is VALID [2022-04-27 13:15:52,055 INFO L272 TraceCheckUtils]: 51: Hoare triple {6092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6092#false} is VALID [2022-04-27 13:15:52,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-27 13:15:52,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-27 13:15:52,056 INFO L290 TraceCheckUtils]: 54: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-27 13:15:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:52,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:52,354 INFO L290 TraceCheckUtils]: 54: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-04-27 13:15:52,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {6092#false} assume 0 == ~cond; {6092#false} is VALID [2022-04-27 13:15:52,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {6092#false} ~cond := #in~cond; {6092#false} is VALID [2022-04-27 13:15:52,355 INFO L272 TraceCheckUtils]: 51: Hoare triple {6092#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6092#false} is VALID [2022-04-27 13:15:52,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {6276#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {6092#false} is VALID [2022-04-27 13:15:52,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {6280#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6276#(< |main_#t~post6| 10)} is VALID [2022-04-27 13:15:52,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {6280#(< ~counter~0 10)} assume !(~r~0 < 0); {6280#(< ~counter~0 10)} is VALID [2022-04-27 13:15:52,356 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6091#true} {6280#(< ~counter~0 10)} #98#return; {6280#(< ~counter~0 10)} is VALID [2022-04-27 13:15:52,356 INFO L290 TraceCheckUtils]: 46: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-27 13:15:52,357 INFO L290 TraceCheckUtils]: 45: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-27 13:15:52,357 INFO L290 TraceCheckUtils]: 44: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-27 13:15:52,357 INFO L272 TraceCheckUtils]: 43: Hoare triple {6280#(< ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6091#true} is VALID [2022-04-27 13:15:52,357 INFO L290 TraceCheckUtils]: 42: Hoare triple {6280#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {6280#(< ~counter~0 10)} is VALID [2022-04-27 13:15:52,357 INFO L290 TraceCheckUtils]: 41: Hoare triple {6305#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6280#(< ~counter~0 10)} is VALID [2022-04-27 13:15:52,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {6305#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6305#(< ~counter~0 9)} is VALID [2022-04-27 13:15:52,358 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6091#true} {6305#(< ~counter~0 9)} #98#return; {6305#(< ~counter~0 9)} is VALID [2022-04-27 13:15:52,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-27 13:15:52,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-27 13:15:52,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-27 13:15:52,359 INFO L272 TraceCheckUtils]: 35: Hoare triple {6305#(< ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6091#true} is VALID [2022-04-27 13:15:52,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {6305#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {6305#(< ~counter~0 9)} is VALID [2022-04-27 13:15:52,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {6330#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6305#(< ~counter~0 9)} is VALID [2022-04-27 13:15:52,360 INFO L290 TraceCheckUtils]: 32: Hoare triple {6330#(< ~counter~0 8)} assume !(~r~0 > 0); {6330#(< ~counter~0 8)} is VALID [2022-04-27 13:15:52,360 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6091#true} {6330#(< ~counter~0 8)} #96#return; {6330#(< ~counter~0 8)} is VALID [2022-04-27 13:15:52,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-27 13:15:52,361 INFO L290 TraceCheckUtils]: 29: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-27 13:15:52,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-27 13:15:52,361 INFO L272 TraceCheckUtils]: 27: Hoare triple {6330#(< ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6091#true} is VALID [2022-04-27 13:15:52,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {6330#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {6330#(< ~counter~0 8)} is VALID [2022-04-27 13:15:52,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {6355#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6330#(< ~counter~0 8)} is VALID [2022-04-27 13:15:52,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {6355#(< ~counter~0 7)} assume !!(0 != ~r~0); {6355#(< ~counter~0 7)} is VALID [2022-04-27 13:15:52,363 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6091#true} {6355#(< ~counter~0 7)} #94#return; {6355#(< ~counter~0 7)} is VALID [2022-04-27 13:15:52,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-27 13:15:52,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-27 13:15:52,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-27 13:15:52,363 INFO L272 TraceCheckUtils]: 19: Hoare triple {6355#(< ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6091#true} is VALID [2022-04-27 13:15:52,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {6355#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6355#(< ~counter~0 7)} is VALID [2022-04-27 13:15:52,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {6380#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6355#(< ~counter~0 7)} is VALID [2022-04-27 13:15:52,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {6380#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,365 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6091#true} {6380#(< ~counter~0 6)} #92#return; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-27 13:15:52,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-27 13:15:52,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-27 13:15:52,365 INFO L272 TraceCheckUtils]: 11: Hoare triple {6380#(< ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6091#true} is VALID [2022-04-27 13:15:52,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6091#true} {6380#(< ~counter~0 6)} #90#return; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {6091#true} assume true; {6091#true} is VALID [2022-04-27 13:15:52,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {6091#true} assume !(0 == ~cond); {6091#true} is VALID [2022-04-27 13:15:52,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {6091#true} ~cond := #in~cond; {6091#true} is VALID [2022-04-27 13:15:52,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {6380#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6091#true} is VALID [2022-04-27 13:15:52,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#(< ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#(< ~counter~0 6)} call #t~ret9 := main(); {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#(< ~counter~0 6)} {6091#true} #102#return; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#(< ~counter~0 6)} assume true; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6380#(< ~counter~0 6)} is VALID [2022-04-27 13:15:52,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {6091#true} call ULTIMATE.init(); {6091#true} is VALID [2022-04-27 13:15:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:15:52,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057528360] [2022-04-27 13:15:52,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554455016] [2022-04-27 13:15:52,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554455016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:52,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:52,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:15:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758511284] [2022-04-27 13:15:52,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:52,371 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-27 13:15:52,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:52,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:15:52,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:52,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:15:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:52,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:15:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:15:52,433 INFO L87 Difference]: Start difference. First operand 236 states and 310 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:15:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:53,228 INFO L93 Difference]: Finished difference Result 338 states and 453 transitions. [2022-04-27 13:15:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:15:53,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 55 [2022-04-27 13:15:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:15:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:15:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:15:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:15:53,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-27 13:15:53,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:53,369 INFO L225 Difference]: With dead ends: 338 [2022-04-27 13:15:53,369 INFO L226 Difference]: Without dead ends: 333 [2022-04-27 13:15:53,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:15:53,370 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 296 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:53,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 226 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:15:53,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-04-27 13:15:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 319. [2022-04-27 13:15:53,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:53,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-27 13:15:53,495 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-27 13:15:53,495 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-27 13:15:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:53,501 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2022-04-27 13:15:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 435 transitions. [2022-04-27 13:15:53,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:53,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:53,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) Second operand 333 states. [2022-04-27 13:15:53,503 INFO L87 Difference]: Start difference. First operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) Second operand 333 states. [2022-04-27 13:15:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:53,509 INFO L93 Difference]: Finished difference Result 333 states and 435 transitions. [2022-04-27 13:15:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 435 transitions. [2022-04-27 13:15:53,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:53,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:53,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:53,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 236 states have (on average 1.2372881355932204) internal successors, (292), 243 states have internal predecessors, (292), 64 states have call successors, (64), 20 states have call predecessors, (64), 18 states have return successors, (62), 55 states have call predecessors, (62), 62 states have call successors, (62) [2022-04-27 13:15:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 418 transitions. [2022-04-27 13:15:53,516 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 418 transitions. Word has length 55 [2022-04-27 13:15:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:53,517 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 418 transitions. [2022-04-27 13:15:53,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:15:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 418 transitions. [2022-04-27 13:15:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:15:53,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:53,518 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:53,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 13:15:53,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 13:15:53,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-27 13:15:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:53,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224076908] [2022-04-27 13:15:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:53,752 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:53,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1942198942] [2022-04-27 13:15:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:53,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:53,755 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:53,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:15:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:53,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:15:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:53,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:54,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2022-04-27 13:15:54,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #102#return; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret9 := main(); {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L272 TraceCheckUtils]: 6: Hoare triple {8022#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8022#true} {8022#true} #90#return; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {8022#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,029 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8022#true} {8022#true} #92#return; {8022#true} is VALID [2022-04-27 13:15:54,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {8022#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,030 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,030 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,031 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,035 INFO L272 TraceCheckUtils]: 27: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,036 INFO L290 TraceCheckUtils]: 30: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,036 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 > 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,037 INFO L272 TraceCheckUtils]: 35: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,037 INFO L290 TraceCheckUtils]: 36: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,038 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,039 INFO L272 TraceCheckUtils]: 43: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,039 INFO L290 TraceCheckUtils]: 46: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,040 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 < 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,041 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,041 INFO L272 TraceCheckUtils]: 51: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,041 INFO L290 TraceCheckUtils]: 52: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,041 INFO L290 TraceCheckUtils]: 53: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,041 INFO L290 TraceCheckUtils]: 54: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,042 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,042 INFO L290 TraceCheckUtils]: 56: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,043 INFO L272 TraceCheckUtils]: 59: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,044 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,051 INFO L290 TraceCheckUtils]: 64: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 10);havoc #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,058 INFO L290 TraceCheckUtils]: 68: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,058 INFO L272 TraceCheckUtils]: 69: Hoare triple {8220#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,059 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8022#true} {8220#(< 0 (+ main_~r~0 1))} #98#return; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,059 INFO L290 TraceCheckUtils]: 74: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-27 13:15:54,061 INFO L290 TraceCheckUtils]: 75: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,061 INFO L290 TraceCheckUtils]: 76: Hoare triple {8023#false} assume !!(#t~post8 < 10);havoc #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,061 INFO L272 TraceCheckUtils]: 77: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 79: Hoare triple {8023#false} assume !(0 == ~cond); {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 80: Hoare triple {8023#false} assume true; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8023#false} {8023#false} #98#return; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 82: Hoare triple {8023#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 83: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 84: Hoare triple {8023#false} assume !(#t~post8 < 10);havoc #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 85: Hoare triple {8023#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 86: Hoare triple {8023#false} assume !(#t~post6 < 10);havoc #t~post6; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L272 TraceCheckUtils]: 87: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 88: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-27 13:15:54,062 INFO L290 TraceCheckUtils]: 89: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2022-04-27 13:15:54,063 INFO L290 TraceCheckUtils]: 90: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-04-27 13:15:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 64 proven. 12 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-27 13:15:54,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 90: Hoare triple {8023#false} assume !false; {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 89: Hoare triple {8023#false} assume 0 == ~cond; {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 88: Hoare triple {8023#false} ~cond := #in~cond; {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L272 TraceCheckUtils]: 87: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {8023#false} assume !(#t~post6 < 10);havoc #t~post6; {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {8023#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 84: Hoare triple {8023#false} assume !(#t~post8 < 10);havoc #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,306 INFO L290 TraceCheckUtils]: 83: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {8023#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-27 13:15:54,307 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8022#true} {8023#false} #98#return; {8023#false} is VALID [2022-04-27 13:15:54,307 INFO L290 TraceCheckUtils]: 80: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,307 INFO L290 TraceCheckUtils]: 78: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,307 INFO L272 TraceCheckUtils]: 77: Hoare triple {8023#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {8023#false} assume !!(#t~post8 < 10);havoc #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,307 INFO L290 TraceCheckUtils]: 75: Hoare triple {8023#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8023#false} is VALID [2022-04-27 13:15:54,308 INFO L290 TraceCheckUtils]: 74: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8023#false} is VALID [2022-04-27 13:15:54,308 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8022#true} {8220#(< 0 (+ main_~r~0 1))} #98#return; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,309 INFO L272 TraceCheckUtils]: 69: Hoare triple {8220#(< 0 (+ main_~r~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,309 INFO L290 TraceCheckUtils]: 67: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {8220#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 10);havoc #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {8220#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8220#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:15:54,311 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,311 INFO L272 TraceCheckUtils]: 59: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,322 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,322 INFO L290 TraceCheckUtils]: 54: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,322 INFO L290 TraceCheckUtils]: 53: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,323 INFO L272 TraceCheckUtils]: 51: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 < 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,332 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,333 INFO L272 TraceCheckUtils]: 43: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {8075#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,334 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #98#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,334 INFO L272 TraceCheckUtils]: 35: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {8075#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {8075#(<= main_~v~0 1)} assume !(~r~0 > 0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,336 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #96#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,336 INFO L272 TraceCheckUtils]: 27: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {8075#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#(<= main_~v~0 1)} assume !!(0 != ~r~0); {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,337 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8022#true} {8075#(<= main_~v~0 1)} #94#return; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,338 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#(<= main_~v~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {8075#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {8075#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {8022#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8075#(<= main_~v~0 1)} is VALID [2022-04-27 13:15:54,339 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8022#true} {8022#true} #92#return; {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L272 TraceCheckUtils]: 11: Hoare triple {8022#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8022#true} {8022#true} #90#return; {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {8022#true} assume !(0 == ~cond); {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {8022#true} ~cond := #in~cond; {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {8022#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8022#true} is VALID [2022-04-27 13:15:54,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {8022#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8022#true} is VALID [2022-04-27 13:15:54,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {8022#true} call #t~ret9 := main(); {8022#true} is VALID [2022-04-27 13:15:54,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8022#true} {8022#true} #102#return; {8022#true} is VALID [2022-04-27 13:15:54,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {8022#true} assume true; {8022#true} is VALID [2022-04-27 13:15:54,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {8022#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8022#true} is VALID [2022-04-27 13:15:54,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {8022#true} call ULTIMATE.init(); {8022#true} is VALID [2022-04-27 13:15:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-04-27 13:15:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:54,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224076908] [2022-04-27 13:15:54,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:54,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942198942] [2022-04-27 13:15:54,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942198942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:54,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:54,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-27 13:15:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054852342] [2022-04-27 13:15:54,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-27 13:15:54,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:54,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:54,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:54,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:15:54,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:15:54,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:15:54,377 INFO L87 Difference]: Start difference. First operand 319 states and 418 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:54,806 INFO L93 Difference]: Finished difference Result 571 states and 778 transitions. [2022-04-27 13:15:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:15:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2022-04-27 13:15:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:15:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:15:54,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-27 13:15:54,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:54,907 INFO L225 Difference]: With dead ends: 571 [2022-04-27 13:15:54,907 INFO L226 Difference]: Without dead ends: 383 [2022-04-27 13:15:54,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:15:54,908 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:54,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 141 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:15:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-27 13:15:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2022-04-27 13:15:55,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:55,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 13:15:55,097 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 13:15:55,097 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 13:15:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:55,104 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-04-27 13:15:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 508 transitions. [2022-04-27 13:15:55,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:55,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:55,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) Second operand 383 states. [2022-04-27 13:15:55,106 INFO L87 Difference]: Start difference. First operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) Second operand 383 states. [2022-04-27 13:15:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:55,114 INFO L93 Difference]: Finished difference Result 383 states and 508 transitions. [2022-04-27 13:15:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 508 transitions. [2022-04-27 13:15:55,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:55,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:55,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:55,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 285 states have (on average 1.2456140350877194) internal successors, (355), 291 states have internal predecessors, (355), 76 states have call successors, (76), 20 states have call predecessors, (76), 18 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2022-04-27 13:15:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 505 transitions. [2022-04-27 13:15:55,123 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 505 transitions. Word has length 91 [2022-04-27 13:15:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:55,123 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 505 transitions. [2022-04-27 13:15:55,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 13:15:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 505 transitions. [2022-04-27 13:15:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:15:55,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:55,125 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:55,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:15:55,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:15:55,341 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-27 13:15:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:55,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283411561] [2022-04-27 13:15:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:55,359 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:55,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752378886] [2022-04-27 13:15:55,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:15:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:55,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:55,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 13:15:55,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:15:55,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:15:55,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:15:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:55,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:55,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10665#true} is VALID [2022-04-27 13:15:55,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10673#(<= ~counter~0 0)} {10665#true} #102#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {10673#(<= ~counter~0 0)} call #t~ret9 := main(); {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {10673#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {10673#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {10673#(<= ~counter~0 0)} ~cond := #in~cond; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {10673#(<= ~counter~0 0)} assume !(0 == ~cond); {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10673#(<= ~counter~0 0)} {10673#(<= ~counter~0 0)} #90#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,839 INFO L272 TraceCheckUtils]: 11: Hoare triple {10673#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {10673#(<= ~counter~0 0)} ~cond := #in~cond; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {10673#(<= ~counter~0 0)} assume !(0 == ~cond); {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {10673#(<= ~counter~0 0)} assume true; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10673#(<= ~counter~0 0)} {10673#(<= ~counter~0 0)} #92#return; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {10673#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10673#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:55,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {10673#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {10722#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,842 INFO L272 TraceCheckUtils]: 19: Hoare triple {10722#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {10722#(<= ~counter~0 1)} ~cond := #in~cond; {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {10722#(<= ~counter~0 1)} assume !(0 == ~cond); {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {10722#(<= ~counter~0 1)} assume true; {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,844 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10722#(<= ~counter~0 1)} {10722#(<= ~counter~0 1)} #94#return; {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {10722#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10722#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:55,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {10722#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {10747#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,845 INFO L272 TraceCheckUtils]: 27: Hoare triple {10747#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {10747#(<= ~counter~0 2)} ~cond := #in~cond; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {10747#(<= ~counter~0 2)} assume !(0 == ~cond); {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {10747#(<= ~counter~0 2)} assume true; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,847 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10747#(<= ~counter~0 2)} {10747#(<= ~counter~0 2)} #96#return; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {10747#(<= ~counter~0 2)} assume !(~r~0 > 0); {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:55,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {10747#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {10772#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,848 INFO L272 TraceCheckUtils]: 35: Hoare triple {10772#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {10772#(<= ~counter~0 3)} ~cond := #in~cond; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,849 INFO L290 TraceCheckUtils]: 37: Hoare triple {10772#(<= ~counter~0 3)} assume !(0 == ~cond); {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {10772#(<= ~counter~0 3)} assume true; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,850 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10772#(<= ~counter~0 3)} {10772#(<= ~counter~0 3)} #98#return; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {10772#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:55,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {10772#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {10797#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,851 INFO L272 TraceCheckUtils]: 43: Hoare triple {10797#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {10797#(<= ~counter~0 4)} ~cond := #in~cond; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,852 INFO L290 TraceCheckUtils]: 45: Hoare triple {10797#(<= ~counter~0 4)} assume !(0 == ~cond); {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {10797#(<= ~counter~0 4)} assume true; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,853 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10797#(<= ~counter~0 4)} {10797#(<= ~counter~0 4)} #98#return; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {10797#(<= ~counter~0 4)} assume !(~r~0 < 0); {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:55,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {10797#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {10822#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,854 INFO L272 TraceCheckUtils]: 51: Hoare triple {10822#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {10822#(<= ~counter~0 5)} ~cond := #in~cond; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {10822#(<= ~counter~0 5)} assume !(0 == ~cond); {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {10822#(<= ~counter~0 5)} assume true; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,856 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10822#(<= ~counter~0 5)} {10822#(<= ~counter~0 5)} #94#return; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {10822#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:55,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {10822#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {10847#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,857 INFO L272 TraceCheckUtils]: 59: Hoare triple {10847#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {10847#(<= ~counter~0 6)} ~cond := #in~cond; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {10847#(<= ~counter~0 6)} assume !(0 == ~cond); {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {10847#(<= ~counter~0 6)} assume true; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,859 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10847#(<= ~counter~0 6)} {10847#(<= ~counter~0 6)} #96#return; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,859 INFO L290 TraceCheckUtils]: 64: Hoare triple {10847#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:55,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {10847#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {10872#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,860 INFO L272 TraceCheckUtils]: 67: Hoare triple {10872#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {10872#(<= ~counter~0 7)} ~cond := #in~cond; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {10872#(<= ~counter~0 7)} assume !(0 == ~cond); {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {10872#(<= ~counter~0 7)} assume true; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,862 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10872#(<= ~counter~0 7)} {10872#(<= ~counter~0 7)} #96#return; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {10872#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:55,863 INFO L290 TraceCheckUtils]: 73: Hoare triple {10872#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10897#(<= |main_#t~post7| 7)} is VALID [2022-04-27 13:15:55,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {10897#(<= |main_#t~post7| 7)} assume !(#t~post7 < 10);havoc #t~post7; {10666#false} is VALID [2022-04-27 13:15:55,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-27 13:15:55,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {10666#false} assume !!(#t~post8 < 10);havoc #t~post8; {10666#false} is VALID [2022-04-27 13:15:55,863 INFO L272 TraceCheckUtils]: 77: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-27 13:15:55,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-27 13:15:55,863 INFO L290 TraceCheckUtils]: 79: Hoare triple {10666#false} assume !(0 == ~cond); {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {10666#false} assume true; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10666#false} {10666#false} #98#return; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {10666#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#false} assume !(#t~post8 < 10);havoc #t~post8; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#false} assume !(#t~post6 < 10);havoc #t~post6; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L272 TraceCheckUtils]: 87: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-27 13:15:55,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-27 13:15:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 58 proven. 110 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 13:15:55,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:56,238 INFO L290 TraceCheckUtils]: 90: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {10666#false} assume 0 == ~cond; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {10666#false} ~cond := #in~cond; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L272 TraceCheckUtils]: 87: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 86: Hoare triple {10666#false} assume !(#t~post6 < 10);havoc #t~post6; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 85: Hoare triple {10666#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {10666#false} assume !(#t~post8 < 10);havoc #t~post8; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {10666#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10665#true} {10666#false} #98#return; {10666#false} is VALID [2022-04-27 13:15:56,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,240 INFO L290 TraceCheckUtils]: 79: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,240 INFO L272 TraceCheckUtils]: 77: Hoare triple {10666#false} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,240 INFO L290 TraceCheckUtils]: 76: Hoare triple {10666#false} assume !!(#t~post8 < 10);havoc #t~post8; {10666#false} is VALID [2022-04-27 13:15:56,240 INFO L290 TraceCheckUtils]: 75: Hoare triple {10666#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10666#false} is VALID [2022-04-27 13:15:56,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {10997#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {10666#false} is VALID [2022-04-27 13:15:56,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {11001#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10997#(< |main_#t~post7| 10)} is VALID [2022-04-27 13:15:56,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {11001#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11001#(< ~counter~0 10)} is VALID [2022-04-27 13:15:56,241 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10665#true} {11001#(< ~counter~0 10)} #96#return; {11001#(< ~counter~0 10)} is VALID [2022-04-27 13:15:56,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,242 INFO L272 TraceCheckUtils]: 67: Hoare triple {11001#(< ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {11001#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {11001#(< ~counter~0 10)} is VALID [2022-04-27 13:15:56,242 INFO L290 TraceCheckUtils]: 65: Hoare triple {11026#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11001#(< ~counter~0 10)} is VALID [2022-04-27 13:15:56,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {11026#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11026#(< ~counter~0 9)} is VALID [2022-04-27 13:15:56,243 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10665#true} {11026#(< ~counter~0 9)} #96#return; {11026#(< ~counter~0 9)} is VALID [2022-04-27 13:15:56,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,243 INFO L272 TraceCheckUtils]: 59: Hoare triple {11026#(< ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {11026#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {11026#(< ~counter~0 9)} is VALID [2022-04-27 13:15:56,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {10872#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11026#(< ~counter~0 9)} is VALID [2022-04-27 13:15:56,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {10872#(<= ~counter~0 7)} assume !!(0 != ~r~0); {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:56,245 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10665#true} {10872#(<= ~counter~0 7)} #94#return; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:56,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,245 INFO L290 TraceCheckUtils]: 53: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,245 INFO L272 TraceCheckUtils]: 51: Hoare triple {10872#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {10872#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:56,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {10847#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10872#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:56,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {10847#(<= ~counter~0 6)} assume !(~r~0 < 0); {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:56,248 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10665#true} {10847#(<= ~counter~0 6)} #98#return; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:56,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,249 INFO L272 TraceCheckUtils]: 43: Hoare triple {10847#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {10847#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:56,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {10822#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10847#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:56,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {10822#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:56,252 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10665#true} {10822#(<= ~counter~0 5)} #98#return; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:56,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,252 INFO L272 TraceCheckUtils]: 35: Hoare triple {10822#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {10822#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:56,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {10797#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10822#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:56,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {10797#(<= ~counter~0 4)} assume !(~r~0 > 0); {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:56,254 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10665#true} {10797#(<= ~counter~0 4)} #96#return; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:56,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,254 INFO L272 TraceCheckUtils]: 27: Hoare triple {10797#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {10797#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:56,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {10772#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10797#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:56,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {10772#(<= ~counter~0 3)} assume !!(0 != ~r~0); {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:56,255 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10665#true} {10772#(<= ~counter~0 3)} #94#return; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:56,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,256 INFO L272 TraceCheckUtils]: 19: Hoare triple {10772#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {10772#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:56,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10772#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:56,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {10747#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10665#true} {10747#(<= ~counter~0 2)} #92#return; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,257 INFO L272 TraceCheckUtils]: 11: Hoare triple {10747#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10665#true} {10747#(<= ~counter~0 2)} #90#return; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-27 13:15:56,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {10665#true} assume !(0 == ~cond); {10665#true} is VALID [2022-04-27 13:15:56,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {10665#true} ~cond := #in~cond; {10665#true} is VALID [2022-04-27 13:15:56,258 INFO L272 TraceCheckUtils]: 6: Hoare triple {10747#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10665#true} is VALID [2022-04-27 13:15:56,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {10747#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {10747#(<= ~counter~0 2)} call #t~ret9 := main(); {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10747#(<= ~counter~0 2)} {10665#true} #102#return; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {10747#(<= ~counter~0 2)} assume true; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10747#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:56,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10665#true} is VALID [2022-04-27 13:15:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 32 proven. 26 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-27 13:15:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:56,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283411561] [2022-04-27 13:15:56,260 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:56,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752378886] [2022-04-27 13:15:56,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752378886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:56,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:56,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-27 13:15:56,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231380885] [2022-04-27 13:15:56,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 91 [2022-04-27 13:15:56,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:56,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 13:15:56,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:56,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:15:56,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:15:56,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:15:56,348 INFO L87 Difference]: Start difference. First operand 380 states and 505 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 13:15:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:57,077 INFO L93 Difference]: Finished difference Result 528 states and 707 transitions. [2022-04-27 13:15:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 13:15:57,078 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 91 [2022-04-27 13:15:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 13:15:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-27 13:15:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 13:15:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 221 transitions. [2022-04-27 13:15:57,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 221 transitions. [2022-04-27 13:15:57,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:57,240 INFO L225 Difference]: With dead ends: 528 [2022-04-27 13:15:57,240 INFO L226 Difference]: Without dead ends: 391 [2022-04-27 13:15:57,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=296, Unknown=0, NotChecked=0, Total=462 [2022-04-27 13:15:57,241 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:57,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 258 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:15:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-04-27 13:15:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 386. [2022-04-27 13:15:57,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:57,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 386 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:57,448 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 386 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:57,448 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 386 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:57,456 INFO L93 Difference]: Finished difference Result 391 states and 505 transitions. [2022-04-27 13:15:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 505 transitions. [2022-04-27 13:15:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:57,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:57,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 386 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 391 states. [2022-04-27 13:15:57,458 INFO L87 Difference]: Start difference. First operand has 386 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 391 states. [2022-04-27 13:15:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:57,466 INFO L93 Difference]: Finished difference Result 391 states and 505 transitions. [2022-04-27 13:15:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 505 transitions. [2022-04-27 13:15:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:57,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:57,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:57,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 293 states have (on average 1.2081911262798635) internal successors, (354), 293 states have internal predecessors, (354), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 500 transitions. [2022-04-27 13:15:57,476 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 500 transitions. Word has length 91 [2022-04-27 13:15:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:57,476 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 500 transitions. [2022-04-27 13:15:57,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 12 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 13:15:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 500 transitions. [2022-04-27 13:15:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 13:15:57,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:57,478 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:57,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 13:15:57,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 13:15:57,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-27 13:15:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:57,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930650716] [2022-04-27 13:15:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:57,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:57,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1532622956] [2022-04-27 13:15:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:57,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:57,713 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:15:57,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 13:15:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:57,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:15:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:57,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:58,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {13292#true} call ULTIMATE.init(); {13292#true} is VALID [2022-04-27 13:15:58,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {13292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {13300#(<= ~counter~0 0)} assume true; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13300#(<= ~counter~0 0)} {13292#true} #102#return; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {13300#(<= ~counter~0 0)} call #t~ret9 := main(); {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {13300#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {13300#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {13300#(<= ~counter~0 0)} ~cond := #in~cond; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {13300#(<= ~counter~0 0)} assume !(0 == ~cond); {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {13300#(<= ~counter~0 0)} assume true; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13300#(<= ~counter~0 0)} {13300#(<= ~counter~0 0)} #90#return; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,214 INFO L272 TraceCheckUtils]: 11: Hoare triple {13300#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {13300#(<= ~counter~0 0)} ~cond := #in~cond; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {13300#(<= ~counter~0 0)} assume !(0 == ~cond); {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {13300#(<= ~counter~0 0)} assume true; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,216 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13300#(<= ~counter~0 0)} {13300#(<= ~counter~0 0)} #92#return; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {13300#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {13300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {13349#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {13349#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {13349#(<= ~counter~0 1)} ~cond := #in~cond; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {13349#(<= ~counter~0 1)} assume !(0 == ~cond); {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {13349#(<= ~counter~0 1)} assume true; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,219 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13349#(<= ~counter~0 1)} {13349#(<= ~counter~0 1)} #94#return; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {13349#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {13349#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {13374#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,220 INFO L272 TraceCheckUtils]: 27: Hoare triple {13374#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {13374#(<= ~counter~0 2)} ~cond := #in~cond; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {13374#(<= ~counter~0 2)} assume !(0 == ~cond); {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {13374#(<= ~counter~0 2)} assume true; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,222 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13374#(<= ~counter~0 2)} {13374#(<= ~counter~0 2)} #96#return; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {13374#(<= ~counter~0 2)} assume !(~r~0 > 0); {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {13374#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {13399#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,223 INFO L272 TraceCheckUtils]: 35: Hoare triple {13399#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {13399#(<= ~counter~0 3)} ~cond := #in~cond; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {13399#(<= ~counter~0 3)} assume !(0 == ~cond); {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {13399#(<= ~counter~0 3)} assume true; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,228 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13399#(<= ~counter~0 3)} {13399#(<= ~counter~0 3)} #98#return; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {13399#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {13399#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {13424#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,229 INFO L272 TraceCheckUtils]: 43: Hoare triple {13424#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {13424#(<= ~counter~0 4)} ~cond := #in~cond; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {13424#(<= ~counter~0 4)} assume !(0 == ~cond); {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {13424#(<= ~counter~0 4)} assume true; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,231 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13424#(<= ~counter~0 4)} {13424#(<= ~counter~0 4)} #98#return; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {13424#(<= ~counter~0 4)} assume !(~r~0 < 0); {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {13424#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {13449#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,232 INFO L272 TraceCheckUtils]: 51: Hoare triple {13449#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {13449#(<= ~counter~0 5)} ~cond := #in~cond; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {13449#(<= ~counter~0 5)} assume !(0 == ~cond); {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {13449#(<= ~counter~0 5)} assume true; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,233 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13449#(<= ~counter~0 5)} {13449#(<= ~counter~0 5)} #94#return; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,234 INFO L290 TraceCheckUtils]: 56: Hoare triple {13449#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {13449#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {13474#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,235 INFO L272 TraceCheckUtils]: 59: Hoare triple {13474#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,235 INFO L290 TraceCheckUtils]: 60: Hoare triple {13474#(<= ~counter~0 6)} ~cond := #in~cond; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {13474#(<= ~counter~0 6)} assume !(0 == ~cond); {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {13474#(<= ~counter~0 6)} assume true; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,237 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13474#(<= ~counter~0 6)} {13474#(<= ~counter~0 6)} #96#return; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {13474#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {13474#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {13499#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,238 INFO L272 TraceCheckUtils]: 67: Hoare triple {13499#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {13499#(<= ~counter~0 7)} ~cond := #in~cond; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {13499#(<= ~counter~0 7)} assume !(0 == ~cond); {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {13499#(<= ~counter~0 7)} assume true; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,239 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13499#(<= ~counter~0 7)} {13499#(<= ~counter~0 7)} #96#return; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {13499#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {13499#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,240 INFO L290 TraceCheckUtils]: 74: Hoare triple {13524#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,241 INFO L272 TraceCheckUtils]: 75: Hoare triple {13524#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {13524#(<= ~counter~0 8)} ~cond := #in~cond; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {13524#(<= ~counter~0 8)} assume !(0 == ~cond); {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {13524#(<= ~counter~0 8)} assume true; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,242 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13524#(<= ~counter~0 8)} {13524#(<= ~counter~0 8)} #96#return; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {13524#(<= ~counter~0 8)} assume !(~r~0 > 0); {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,247 INFO L290 TraceCheckUtils]: 81: Hoare triple {13524#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,247 INFO L290 TraceCheckUtils]: 82: Hoare triple {13549#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,248 INFO L272 TraceCheckUtils]: 83: Hoare triple {13549#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,248 INFO L290 TraceCheckUtils]: 84: Hoare triple {13549#(<= ~counter~0 9)} ~cond := #in~cond; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,248 INFO L290 TraceCheckUtils]: 85: Hoare triple {13549#(<= ~counter~0 9)} assume !(0 == ~cond); {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {13549#(<= ~counter~0 9)} assume true; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,249 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13549#(<= ~counter~0 9)} {13549#(<= ~counter~0 9)} #98#return; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,249 INFO L290 TraceCheckUtils]: 88: Hoare triple {13549#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,250 INFO L290 TraceCheckUtils]: 89: Hoare triple {13549#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13574#(<= |main_#t~post8| 9)} is VALID [2022-04-27 13:15:58,250 INFO L290 TraceCheckUtils]: 90: Hoare triple {13574#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {13293#false} is VALID [2022-04-27 13:15:58,250 INFO L290 TraceCheckUtils]: 91: Hoare triple {13293#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13293#false} is VALID [2022-04-27 13:15:58,250 INFO L290 TraceCheckUtils]: 92: Hoare triple {13293#false} assume !(#t~post6 < 10);havoc #t~post6; {13293#false} is VALID [2022-04-27 13:15:58,250 INFO L272 TraceCheckUtils]: 93: Hoare triple {13293#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13293#false} is VALID [2022-04-27 13:15:58,250 INFO L290 TraceCheckUtils]: 94: Hoare triple {13293#false} ~cond := #in~cond; {13293#false} is VALID [2022-04-27 13:15:58,251 INFO L290 TraceCheckUtils]: 95: Hoare triple {13293#false} assume 0 == ~cond; {13293#false} is VALID [2022-04-27 13:15:58,251 INFO L290 TraceCheckUtils]: 96: Hoare triple {13293#false} assume !false; {13293#false} is VALID [2022-04-27 13:15:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:15:58,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:15:58,673 INFO L290 TraceCheckUtils]: 96: Hoare triple {13293#false} assume !false; {13293#false} is VALID [2022-04-27 13:15:58,674 INFO L290 TraceCheckUtils]: 95: Hoare triple {13293#false} assume 0 == ~cond; {13293#false} is VALID [2022-04-27 13:15:58,674 INFO L290 TraceCheckUtils]: 94: Hoare triple {13293#false} ~cond := #in~cond; {13293#false} is VALID [2022-04-27 13:15:58,674 INFO L272 TraceCheckUtils]: 93: Hoare triple {13293#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13293#false} is VALID [2022-04-27 13:15:58,674 INFO L290 TraceCheckUtils]: 92: Hoare triple {13293#false} assume !(#t~post6 < 10);havoc #t~post6; {13293#false} is VALID [2022-04-27 13:15:58,674 INFO L290 TraceCheckUtils]: 91: Hoare triple {13293#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13293#false} is VALID [2022-04-27 13:15:58,674 INFO L290 TraceCheckUtils]: 90: Hoare triple {13574#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {13293#false} is VALID [2022-04-27 13:15:58,675 INFO L290 TraceCheckUtils]: 89: Hoare triple {13549#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13574#(<= |main_#t~post8| 9)} is VALID [2022-04-27 13:15:58,675 INFO L290 TraceCheckUtils]: 88: Hoare triple {13549#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,675 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13292#true} {13549#(<= ~counter~0 9)} #98#return; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,676 INFO L290 TraceCheckUtils]: 84: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,676 INFO L272 TraceCheckUtils]: 83: Hoare triple {13549#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {13549#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {13524#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13549#(<= ~counter~0 9)} is VALID [2022-04-27 13:15:58,677 INFO L290 TraceCheckUtils]: 80: Hoare triple {13524#(<= ~counter~0 8)} assume !(~r~0 > 0); {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,677 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13292#true} {13524#(<= ~counter~0 8)} #96#return; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,677 INFO L290 TraceCheckUtils]: 77: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,678 INFO L290 TraceCheckUtils]: 76: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,678 INFO L272 TraceCheckUtils]: 75: Hoare triple {13524#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,678 INFO L290 TraceCheckUtils]: 74: Hoare triple {13524#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {13499#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13524#(<= ~counter~0 8)} is VALID [2022-04-27 13:15:58,679 INFO L290 TraceCheckUtils]: 72: Hoare triple {13499#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,680 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13292#true} {13499#(<= ~counter~0 7)} #96#return; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,680 INFO L290 TraceCheckUtils]: 68: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,680 INFO L272 TraceCheckUtils]: 67: Hoare triple {13499#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {13499#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {13474#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13499#(<= ~counter~0 7)} is VALID [2022-04-27 13:15:58,681 INFO L290 TraceCheckUtils]: 64: Hoare triple {13474#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,682 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13292#true} {13474#(<= ~counter~0 6)} #96#return; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,682 INFO L290 TraceCheckUtils]: 61: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,682 INFO L290 TraceCheckUtils]: 60: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,682 INFO L272 TraceCheckUtils]: 59: Hoare triple {13474#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,683 INFO L290 TraceCheckUtils]: 58: Hoare triple {13474#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {13449#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13474#(<= ~counter~0 6)} is VALID [2022-04-27 13:15:58,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {13449#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,684 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13292#true} {13449#(<= ~counter~0 5)} #94#return; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,684 INFO L290 TraceCheckUtils]: 53: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,684 INFO L272 TraceCheckUtils]: 51: Hoare triple {13449#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {13449#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {13424#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13449#(<= ~counter~0 5)} is VALID [2022-04-27 13:15:58,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {13424#(<= ~counter~0 4)} assume !(~r~0 < 0); {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,685 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13292#true} {13424#(<= ~counter~0 4)} #98#return; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,686 INFO L290 TraceCheckUtils]: 46: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,686 INFO L272 TraceCheckUtils]: 43: Hoare triple {13424#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {13424#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {13399#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13424#(<= ~counter~0 4)} is VALID [2022-04-27 13:15:58,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {13399#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,687 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13292#true} {13399#(<= ~counter~0 3)} #98#return; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,688 INFO L272 TraceCheckUtils]: 35: Hoare triple {13399#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,688 INFO L290 TraceCheckUtils]: 34: Hoare triple {13399#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,688 INFO L290 TraceCheckUtils]: 33: Hoare triple {13374#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13399#(<= ~counter~0 3)} is VALID [2022-04-27 13:15:58,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {13374#(<= ~counter~0 2)} assume !(~r~0 > 0); {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,689 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13292#true} {13374#(<= ~counter~0 2)} #96#return; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,689 INFO L272 TraceCheckUtils]: 27: Hoare triple {13374#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {13374#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {13349#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13374#(<= ~counter~0 2)} is VALID [2022-04-27 13:15:58,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {13349#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,691 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13292#true} {13349#(<= ~counter~0 1)} #94#return; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,691 INFO L272 TraceCheckUtils]: 19: Hoare triple {13349#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {13349#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {13300#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13349#(<= ~counter~0 1)} is VALID [2022-04-27 13:15:58,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {13300#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,692 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13292#true} {13300#(<= ~counter~0 0)} #92#return; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L272 TraceCheckUtils]: 11: Hoare triple {13300#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13292#true} {13300#(<= ~counter~0 0)} #90#return; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {13292#true} assume true; {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {13292#true} assume !(0 == ~cond); {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {13292#true} ~cond := #in~cond; {13292#true} is VALID [2022-04-27 13:15:58,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {13300#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13292#true} is VALID [2022-04-27 13:15:58,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {13300#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {13300#(<= ~counter~0 0)} call #t~ret9 := main(); {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13300#(<= ~counter~0 0)} {13292#true} #102#return; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {13300#(<= ~counter~0 0)} assume true; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {13292#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13300#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:58,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {13292#true} call ULTIMATE.init(); {13292#true} is VALID [2022-04-27 13:15:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-27 13:15:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:58,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930650716] [2022-04-27 13:15:58,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:58,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532622956] [2022-04-27 13:15:58,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532622956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:15:58,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:15:58,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-27 13:15:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606446012] [2022-04-27 13:15:58,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:15:58,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) Word has length 97 [2022-04-27 13:15:58,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:58,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-27 13:15:58,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:58,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 13:15:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 13:15:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:15:58,794 INFO L87 Difference]: Start difference. First operand 386 states and 500 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-27 13:15:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:59,585 INFO L93 Difference]: Finished difference Result 511 states and 681 transitions. [2022-04-27 13:15:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 13:15:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) Word has length 97 [2022-04-27 13:15:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-27 13:15:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-27 13:15:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-27 13:15:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-27 13:15:59,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-27 13:15:59,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:15:59,737 INFO L225 Difference]: With dead ends: 511 [2022-04-27 13:15:59,737 INFO L226 Difference]: Without dead ends: 380 [2022-04-27 13:15:59,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:15:59,739 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 121 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:15:59,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 241 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:15:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-04-27 13:15:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-04-27 13:15:59,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:59,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 380 states. Second operand has 380 states, 287 states have (on average 1.1881533101045296) internal successors, (341), 287 states have internal predecessors, (341), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:59,925 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand has 380 states, 287 states have (on average 1.1881533101045296) internal successors, (341), 287 states have internal predecessors, (341), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:59,925 INFO L87 Difference]: Start difference. First operand 380 states. Second operand has 380 states, 287 states have (on average 1.1881533101045296) internal successors, (341), 287 states have internal predecessors, (341), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:59,933 INFO L93 Difference]: Finished difference Result 380 states and 487 transitions. [2022-04-27 13:15:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 487 transitions. [2022-04-27 13:15:59,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:59,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:59,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 380 states, 287 states have (on average 1.1881533101045296) internal successors, (341), 287 states have internal predecessors, (341), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 380 states. [2022-04-27 13:15:59,936 INFO L87 Difference]: Start difference. First operand has 380 states, 287 states have (on average 1.1881533101045296) internal successors, (341), 287 states have internal predecessors, (341), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 380 states. [2022-04-27 13:15:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:59,944 INFO L93 Difference]: Finished difference Result 380 states and 487 transitions. [2022-04-27 13:15:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 487 transitions. [2022-04-27 13:15:59,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:59,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:59,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:59,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 287 states have (on average 1.1881533101045296) internal successors, (341), 287 states have internal predecessors, (341), 74 states have call successors, (74), 20 states have call predecessors, (74), 18 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 13:15:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 487 transitions. [2022-04-27 13:15:59,955 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 487 transitions. Word has length 97 [2022-04-27 13:15:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:59,955 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 487 transitions. [2022-04-27 13:15:59,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 12 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 10 states have call predecessors, (23), 11 states have call successors, (23) [2022-04-27 13:15:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 487 transitions. [2022-04-27 13:15:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 13:15:59,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:59,957 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:15:59,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:00,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:16:00,170 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:00,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-27 13:16:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:00,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438913924] [2022-04-27 13:16:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:00,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:00,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332604491] [2022-04-27 13:16:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:00,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:00,194 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:16:00,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 13:16:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:16:00,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:16:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:16:00,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:16:00,423 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:16:00,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:16:00,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:00,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:00,643 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:00,645 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:16:00,686 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:16:00,686 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:16:00,686 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:16:00,686 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:16:00,686 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 13:16:00,687 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:16:00,688 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:16:00,689 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 13:16:00,689 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 13:16:00,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:16:00 BoogieIcfgContainer [2022-04-27 13:16:00,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:16:00,690 INFO L158 Benchmark]: Toolchain (without parser) took 45562.99ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 123.2MB in the beginning and 88.1MB in the end (delta: 35.1MB). Peak memory consumption was 70.9MB. Max. memory is 8.0GB. [2022-04-27 13:16:00,691 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:16:00,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.02ms. Allocated memory is still 173.0MB. Free memory was 122.9MB in the beginning and 147.6MB in the end (delta: -24.8MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-27 13:16:00,691 INFO L158 Benchmark]: Boogie Preprocessor took 36.81ms. Allocated memory is still 173.0MB. Free memory was 147.6MB in the beginning and 146.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:16:00,691 INFO L158 Benchmark]: RCFGBuilder took 285.45ms. Allocated memory is still 173.0MB. Free memory was 146.1MB in the beginning and 134.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:16:00,691 INFO L158 Benchmark]: TraceAbstraction took 45028.17ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 133.5MB in the beginning and 88.1MB in the end (delta: 45.4MB). Peak memory consumption was 81.0MB. Max. memory is 8.0GB. [2022-04-27 13:16:00,692 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.11ms. Allocated memory is still 173.0MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.02ms. Allocated memory is still 173.0MB. Free memory was 122.9MB in the beginning and 147.6MB in the end (delta: -24.8MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.81ms. Allocated memory is still 173.0MB. Free memory was 147.6MB in the beginning and 146.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.45ms. Allocated memory is still 173.0MB. Free memory was 146.1MB in the beginning and 134.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 45028.17ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 133.5MB in the beginning and 88.1MB in the end (delta: 45.4MB). Peak memory consumption was 81.0MB. 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: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [\old(counter)=14, counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(counter)=0, A=7, counter=0, R=2] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [\old(counter)=0, A=7, counter=0, R=2] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [\old(counter)=0, A=7, counter=0, R=2, r=-3, u=5, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=1, counter++=0, r=-3, R=2, u=5, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=1, r=-3, R=2, u=5, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=7, counter=1, R=2, r=-3, u=5, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=2, counter++=1, R=2, r=-3, u=5, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=2, r=-3, R=2, u=5, v=1] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=7, counter=2, R=2, r=-3, u=5, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=3, counter++=2, r=-3, R=2, u=5, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=3, R=2, r=-3, u=5, v=1] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=7, counter=3, r=2, R=2, u=7, v=1] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=4, counter++=3, R=2, r=2, u=7, v=1] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=4, r=2, R=2, u=7, v=1] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=7, counter=4, R=2, r=2, u=7, v=1] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=5, counter++=4, R=2, r=2, u=7, v=1] [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=5, R=2, r=2, u=7, v=1] [L36] COND FALSE !(!(r != 0)) VAL [\old(counter)=0, A=7, counter=5, r=2, R=2, u=7, v=1] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=6, counter++=5, R=2, r=2, u=7, v=1] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=6, R=2, r=2, u=7, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=7, counter=6, r=1, R=2, u=7, v=3] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=7, counter++=6, R=2, r=1, u=7, v=3] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=7, r=1, R=2, u=7, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [\old(counter)=0, A=7, counter=7, r=-2, R=2, u=7, v=5] [L39] EXPR counter++ VAL [\old(counter)=0, A=7, counter=8, counter++=7, r=-2, R=2, u=7, v=5] [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=8, r=-2, R=2, u=7, v=5] [L41] COND TRUE !(r > 0) VAL [\old(counter)=0, A=7, counter=8, R=2, r=-2, u=7, v=5] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=9, counter++=8, r=-2, R=2, u=7, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=9, r=-2, R=2, u=7, v=5] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [\old(counter)=0, A=7, counter=9, r=5, R=2, u=9, v=5] [L47] EXPR counter++ VAL [\old(counter)=0, A=7, counter=10, counter++=9, r=5, R=2, u=9, v=5] [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(counter)=0, A=7, counter=10, R=2, r=5, u=9, v=5] [L49] COND TRUE !(r < 0) VAL [\old(counter)=0, A=7, counter=10, r=5, R=2, u=9, v=5] [L34] EXPR counter++ VAL [\old(counter)=0, A=7, counter=11, counter++=10, r=5, R=2, u=9, v=5] [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, \old(counter)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.9s, OverallIterations: 14, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 879 SdHoareTripleChecker+Valid, 11.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 868 mSDsluCounter, 2067 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 615 mSDtfsCounter, 777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 1044 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=12, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 80 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1121 ConstructedInterpolants, 0 QuantifiedInterpolants, 2555 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1931 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 934/1396 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 13:16:00,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...