/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:59:40,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:59:40,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:59:40,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:59:40,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:59:40,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:59:40,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:59:40,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:59:40,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:59:40,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:59:40,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:59:40,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:59:40,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:59:40,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:59:40,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:59:40,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:59:40,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:59:40,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:59:40,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:59:40,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:59:40,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:59:40,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:59:40,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:59:40,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:59:40,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:59:40,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:59:40,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:59:40,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:59:40,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:59:40,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:59:40,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:59:40,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:59:40,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:59:40,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:59:40,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:59:40,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:59:40,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:59:40,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:59:40,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:59:40,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:59:40,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:59:40,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:59:40,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:59:40,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:59:40,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:59:40,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:59:40,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:59:40,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:59:40,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:59:40,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:59:40,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:59:40,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:59:40,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:59:40,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:59:40,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:59:40,148 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:59:40,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:59:40,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:59:40,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:59:40,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:59:40,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:59:40,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:59:40,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:59:40,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:59:40,150 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:59:40,150 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:59:40,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:59:40,150 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:59:40,150 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 05:59:40,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:59:40,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:59:40,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:59:40,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:59:40,392 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:59:40,393 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-08 05:59:40,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0a4071b/c93210887a2c41bc90bc51e03cef50a1/FLAG955d0ea22 [2022-04-08 05:59:40,808 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:59:40,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-08 05:59:40,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0a4071b/c93210887a2c41bc90bc51e03cef50a1/FLAG955d0ea22 [2022-04-08 05:59:41,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c0a4071b/c93210887a2c41bc90bc51e03cef50a1 [2022-04-08 05:59:41,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:59:41,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:59:41,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:59:41,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:59:41,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:59:41,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77502d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41, skipping insertion in model container [2022-04-08 05:59:41,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:59:41,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:59:41,377 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-08 05:59:41,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:59:41,410 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:59:41,418 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-08 05:59:41,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:59:41,441 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:59:41,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41 WrapperNode [2022-04-08 05:59:41,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:59:41,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:59:41,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:59:41,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:59:41,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:59:41,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:59:41,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:59:41,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:59:41,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (1/1) ... [2022-04-08 05:59:41,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:59:41,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:41,520 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-08 05:59:41,535 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-08 05:59:41,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:59:41,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:59:41,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:59:41,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:59:41,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:59:41,560 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:59:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:59:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:59:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:59:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:59:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 05:59:41,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:59:41,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:59:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:59:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:59:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:59:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:59:41,626 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:59:41,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:59:41,809 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:59:41,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:59:41,816 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-08 05:59:41,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:59:41 BoogieIcfgContainer [2022-04-08 05:59:41,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:59:41,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:59:41,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:59:41,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:59:41,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:59:41" (1/3) ... [2022-04-08 05:59:41,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7076c028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:59:41, skipping insertion in model container [2022-04-08 05:59:41,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:59:41" (2/3) ... [2022-04-08 05:59:41,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7076c028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:59:41, skipping insertion in model container [2022-04-08 05:59:41,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:59:41" (3/3) ... [2022-04-08 05:59:41,824 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2022-04-08 05:59:41,830 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:59:41,830 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:59:41,863 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:59:41,868 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 05:59:41,868 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:59:41,882 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-08 05:59:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 05:59:41,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:41,889 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:59:41,889 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-08 05:59:41,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:41,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683147776] [2022-04-08 05:59:41,908 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-08 05:59:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345490884] [2022-04-08 05:59:41,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:42,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:42,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416109728] [2022-04-08 05:59:42,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:59:42,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:42,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:42,063 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-08 05:59:42,110 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-08 05:59:42,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:59:42,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:42,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 05:59:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:42,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:42,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-08 05:59:42,275 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-08 05:59:42,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 05:59:42,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-08 05:59:42,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-08 05:59:42,276 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-08 05:59:42,277 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-08 05:59:42,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:59:42,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-08 05:59:42,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-08 05:59:42,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-08 05:59:42,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#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)); {40#true} is VALID [2022-04-08 05:59:42,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-08 05:59:42,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-08 05:59:42,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-08 05:59:42,279 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-08 05:59:42,280 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-08 05:59:42,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-08 05:59:42,280 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-08 05:59:42,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-08 05:59:42,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-08 05:59:42,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-08 05:59:42,283 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-08 05:59:42,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:59:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:42,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345490884] [2022-04-08 05:59:42,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:42,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416109728] [2022-04-08 05:59:42,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416109728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:42,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:42,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 05:59:42,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:42,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683147776] [2022-04-08 05:59:42,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683147776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:42,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:42,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 05:59:42,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933778962] [2022-04-08 05:59:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:42,298 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), 1 states have call successors, (3) Word has length 22 [2022-04-08 05:59:42,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:42,303 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), 1 states have call successors, (3) [2022-04-08 05:59:42,330 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-08 05:59:42,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 05:59:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:42,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 05:59:42,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 05:59:42,364 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), 1 states have call successors, (3) [2022-04-08 05:59:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:42,463 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-08 05:59:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 05:59:42,463 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), 1 states have call successors, (3) Word has length 22 [2022-04-08 05:59:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:42,465 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), 1 states have call successors, (3) [2022-04-08 05:59:42,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 05:59:42,485 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), 1 states have call successors, (3) [2022-04-08 05:59:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-08 05:59:42,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-08 05:59:42,592 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-08 05:59:42,602 INFO L225 Difference]: With dead ends: 67 [2022-04-08 05:59:42,602 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 05:59:42,605 INFO L912 BasicCegarLoop]: 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-08 05:59:42,609 INFO L913 BasicCegarLoop]: 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-08 05:59:42,610 INFO L914 BasicCegarLoop]: 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-08 05:59:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 05:59:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 05:59:42,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:42,632 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-08 05:59:42,632 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-08 05:59:42,633 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-08 05:59:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:42,636 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 05:59:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 05:59:42,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:42,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:42,638 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-08 05:59:42,638 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-08 05:59:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:42,641 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 05:59:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 05:59:42,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:42,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:42,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:42,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:42,642 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-08 05:59:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 05:59:42,645 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-08 05:59:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:42,646 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 05:59:42,646 INFO L479 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), 1 states have call successors, (3) [2022-04-08 05:59:42,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 05:59:42,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 05:59:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 05:59:42,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:42,684 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:59:42,707 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-08 05:59:42,902 WARN L460 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-08 05:59:42,903 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-08 05:59:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:42,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324351642] [2022-04-08 05:59:42,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-08 05:59:42,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:42,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68700962] [2022-04-08 05:59:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:42,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:42,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:42,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812050778] [2022-04-08 05:59:42,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:59:42,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:42,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:42,926 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-08 05:59:42,927 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-08 05:59:42,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:59:42,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:42,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:59:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:43,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:43,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-08 05:59:43,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#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; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~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; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,194 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,196 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~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)); {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-08 05:59:43,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-08 05:59:43,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {370#false} is VALID [2022-04-08 05:59:43,202 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#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)); {370#false} is VALID [2022-04-08 05:59:43,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-08 05:59:43,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-08 05:59:43,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-08 05:59:43,203 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-08 05:59:43,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:59:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68700962] [2022-04-08 05:59:43,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812050778] [2022-04-08 05:59:43,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812050778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:43,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:43,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:59:43,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:43,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324351642] [2022-04-08 05:59:43,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324351642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:43,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:43,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:59:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522357436] [2022-04-08 05:59:43,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:43,206 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-08 05:59:43,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:43,207 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-08 05:59:43,228 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-08 05:59:43,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 05:59:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 05:59:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:59:43,229 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-08 05:59:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:43,334 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-08 05:59:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 05:59:43,334 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-08 05:59:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:59:43,335 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-08 05:59:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 05:59:43,337 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-08 05:59:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-08 05:59:43,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-08 05:59:43,386 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-08 05:59:43,387 INFO L225 Difference]: With dead ends: 41 [2022-04-08 05:59:43,388 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 05:59:43,388 INFO L912 BasicCegarLoop]: 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-08 05:59:43,389 INFO L913 BasicCegarLoop]: 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-08 05:59:43,389 INFO L914 BasicCegarLoop]: 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-08 05:59:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 05:59:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 05:59:43,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:59:43,402 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-08 05:59:43,402 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-08 05:59:43,402 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-08 05:59:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:43,404 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 05:59:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 05:59:43,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:43,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:43,406 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-08 05:59:43,406 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-08 05:59:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:59:43,408 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 05:59:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 05:59:43,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:59:43,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:59:43,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:59:43,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:59:43,409 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-08 05:59:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-08 05:59:43,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-08 05:59:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:59:43,411 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-08 05:59:43,412 INFO L479 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-08 05:59:43,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-08 05:59:43,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-08 05:59:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 05:59:43,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:59:43,449 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:59:43,478 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-08 05:59:43,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 05:59:43,666 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:59:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:59:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-08 05:59:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:43,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052268361] [2022-04-08 05:59:43,667 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:59:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-08 05:59:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:59:43,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735965279] [2022-04-08 05:59:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:59:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:59:43,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:59:43,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586539132] [2022-04-08 05:59:43,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:59:43,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:59:43,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:59:43,683 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-08 05:59:43,704 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-08 05:59:43,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:59:43,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:59:43,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 05:59:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:59:43,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:59:45,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-08 05:59:45,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#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; {659#true} is VALID [2022-04-08 05:59:45,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 05:59:45,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-08 05:59:45,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-08 05:59:45,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#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; {659#true} is VALID [2022-04-08 05:59:45,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-08 05:59:45,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 05:59:45,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 05:59:45,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 05:59:45,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-08 05:59:45,294 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#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)); {659#true} is VALID [2022-04-08 05:59:45,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-08 05:59:45,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-08 05:59:45,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-08 05:59:45,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-08 05:59:47,296 WARN L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(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-08 05:59:47,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(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; {712#(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-08 05:59:47,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(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; {712#(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-08 05:59:48,589 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(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)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:59:48,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:59:48,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-08 05:59:48,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-08 05:59:48,591 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-08 05:59:48,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:59:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:59:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735965279] [2022-04-08 05:59:48,592 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:59:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586539132] [2022-04-08 05:59:48,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586539132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:48,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:48,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:59:48,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:59:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052268361] [2022-04-08 05:59:48,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052268361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:59:48,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:59:48,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:59:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857711150] [2022-04-08 05:59:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:59:48,594 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-08 05:59:48,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:59:48,594 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-08 05:59:51,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 05:59:51,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:59:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:59:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:59:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:59:51,254 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-08 05:59:53,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 05:59:57,505 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-08 06:00:02,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:00:03,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:00:06,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:00:11,490 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-08 06:00:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:11,535 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-08 06:00:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:00:11,535 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-08 06:00:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:11,536 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-08 06:00:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 06:00:11,538 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-08 06:00:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 06:00:11,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 06:00:15,054 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-08 06:00:15,056 INFO L225 Difference]: With dead ends: 53 [2022-04-08 06:00:15,057 INFO L226 Difference]: Without dead ends: 51 [2022-04-08 06:00:15,057 INFO L912 BasicCegarLoop]: 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-08 06:00:15,058 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:15,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2022-04-08 06:00:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-08 06:00:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-08 06:00:15,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:15,098 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-08 06:00:15,099 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-08 06:00:15,099 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-08 06:00:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:15,102 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 06:00:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 06:00:15,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:15,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:15,103 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-08 06:00:15,104 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-08 06:00:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:15,106 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 06:00:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-08 06:00:15,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:15,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:15,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:15,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:15,108 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-08 06:00:15,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-08 06:00:15,110 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-08 06:00:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:15,111 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-08 06:00:15,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-08 06:00:15,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-08 06:00:21,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-08 06:00:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 06:00:21,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:21,457 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:21,475 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-08 06:00:21,657 WARN L460 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-08 06:00:21,658 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:21,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-08 06:00:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:21,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1304870446] [2022-04-08 06:00:21,659 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:21,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-08 06:00:21,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:21,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966057089] [2022-04-08 06:00:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:21,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:21,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1021915797] [2022-04-08 06:00:21,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:21,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:21,688 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-08 06:00:21,703 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-08 06:00:21,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:21,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:21,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:00:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:21,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:21,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 06:00:21,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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; {1042#true} is VALID [2022-04-08 06:00:21,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:00:21,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 06:00:21,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 06:00:21,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#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; {1042#true} is VALID [2022-04-08 06:00:21,943 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 06:00:21,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:00:21,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:00:21,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:00:21,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 06:00:21,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-08 06:00:21,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:00:21,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:00:21,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:00:21,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 06:00:21,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-08 06:00:21,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 06:00:21,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 10);havoc #t~post6; {1042#true} is VALID [2022-04-08 06:00:21,945 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-08 06:00:21,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:21,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:21,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:21,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* 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-08 06:00:21,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* 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); {1122#(= (+ (* 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-08 06:00:21,949 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* 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)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:00:21,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:21,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 06:00:21,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 06:00:21,951 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-08 06:00:21,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:22,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-08 06:00:22,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-08 06:00:22,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:00:22,417 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* 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)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:00:22,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(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); {1122#(= (+ (* 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-08 06:00:22,421 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(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-08 06:00:22,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:22,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:00:22,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:00:22,426 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-08 06:00:22,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 10);havoc #t~post6; {1042#true} is VALID [2022-04-08 06:00:22,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-08 06:00:22,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-08 06:00:22,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:00:22,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-08 06:00:22,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-08 06:00:22,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-08 06:00:22,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#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; {1042#true} is VALID [2022-04-08 06:00:22,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-08 06:00:22,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-08 06:00:22,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-08 06:00:22,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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; {1042#true} is VALID [2022-04-08 06:00:22,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-08 06:00:22,429 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-08 06:00:22,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:22,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966057089] [2022-04-08 06:00:22,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:22,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021915797] [2022-04-08 06:00:22,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021915797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:22,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:22,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 06:00:22,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:22,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1304870446] [2022-04-08 06:00:22,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1304870446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:22,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:22,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:00:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729852925] [2022-04-08 06:00:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 06:00:22,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:22,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:00:22,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:22,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:00:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:00:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:00:22,456 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:00:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:22,882 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 06:00:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:00:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-08 06:00:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:00:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 06:00:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:00:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 06:00:22,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 06:00:22,939 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-08 06:00:22,941 INFO L225 Difference]: With dead ends: 57 [2022-04-08 06:00:22,941 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 06:00:22,942 INFO L912 BasicCegarLoop]: 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-08 06:00:22,943 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:22,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 06:00:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-08 06:00:22,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:22,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:22,972 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:22,973 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:22,978 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:00:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:00:22,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:22,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:22,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-08 06:00:22,980 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-08 06:00:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:22,982 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 06:00:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-08 06:00:22,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:22,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:22,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:22,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:00:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-08 06:00:22,985 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-08 06:00:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:22,985 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-08 06:00:22,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:00:22,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-08 06:00:25,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 06:00:25,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 06:00:25,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:25,086 INFO L499 BasicCegarLoop]: 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-08 06:00:25,114 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-08 06:00:25,287 WARN L460 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-08 06:00:25,287 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-08 06:00:25,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:25,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [867855068] [2022-04-08 06:00:25,288 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:25,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-08 06:00:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:25,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169230315] [2022-04-08 06:00:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:25,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:25,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:25,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039768607] [2022-04-08 06:00:25,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:25,309 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-08 06:00:25,344 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-08 06:00:25,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:25,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:25,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:00:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:25,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:25,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-08 06:00:25,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~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; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,688 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,688 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~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)); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:25,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,691 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~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)); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,693 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:25,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-08 06:00:25,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1522#false} is VALID [2022-04-08 06:00:25,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-08 06:00:25,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 10);havoc #t~post8; {1522#false} is VALID [2022-04-08 06:00:25,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-08 06:00:25,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 10);havoc #t~post6; {1522#false} is VALID [2022-04-08 06:00:25,695 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#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)); {1522#false} is VALID [2022-04-08 06:00:25,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-08 06:00:25,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-08 06:00:25,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-08 06:00:25,696 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-08 06:00:25,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:00:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169230315] [2022-04-08 06:00:25,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039768607] [2022-04-08 06:00:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039768607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:25,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:25,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:00:25,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:25,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [867855068] [2022-04-08 06:00:25,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [867855068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:25,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:25,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:00:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273315442] [2022-04-08 06:00:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:25,698 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-08 06:00:25,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:25,698 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-08 06:00:25,727 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-08 06:00:25,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:00:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:25,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:00:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:00:25,735 INFO L87 Difference]: Start difference. First operand 36 states and 43 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-08 06:00:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:25,872 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-08 06:00:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:00:25,873 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-08 06:00:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:25,873 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-08 06:00:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 06:00:25,877 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-08 06:00:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-08 06:00:25,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-08 06:00:25,953 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-08 06:00:25,956 INFO L225 Difference]: With dead ends: 65 [2022-04-08 06:00:25,957 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 06:00:25,957 INFO L912 BasicCegarLoop]: 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-08 06:00:25,959 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:25,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 06:00:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-08 06:00:25,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:26,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:00:26,001 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:00:26,001 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:00:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:26,006 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 06:00:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 06:00:26,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:26,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:26,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 06:00:26,008 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 06:00:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:26,014 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-08 06:00:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 06:00:26,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:26,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:26,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:26,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:00:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-08 06:00:26,017 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-08 06:00:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:26,017 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-08 06:00:26,017 INFO L479 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-08 06:00:26,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-08 06:00:28,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-08 06:00:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 06:00:28,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:28,082 INFO L499 BasicCegarLoop]: 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-08 06:00:28,088 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-08 06:00:28,283 WARN L460 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-08 06:00:28,284 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-08 06:00:28,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:28,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724540520] [2022-04-08 06:00:28,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-08 06:00:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:28,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818811250] [2022-04-08 06:00:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:28,301 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:28,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135917230] [2022-04-08 06:00:28,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:28,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:28,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:28,303 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-08 06:00:28,319 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-08 06:00:28,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:28,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:28,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:00:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:28,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:28,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 06:00:28,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#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; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~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; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,608 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,608 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~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)); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,611 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:28,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~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)); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,615 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:28,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,620 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~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)); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,622 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:28,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-08 06:00:28,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 10);havoc #t~post8; {1937#false} is VALID [2022-04-08 06:00:28,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 06:00:28,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 10);havoc #t~post6; {1937#false} is VALID [2022-04-08 06:00:28,624 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#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)); {1937#false} is VALID [2022-04-08 06:00:28,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 06:00:28,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 06:00:28,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 06:00:28,625 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-08 06:00:28,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:28,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-08 06:00:28,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-08 06:00:28,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-08 06:00:28,875 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#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)); {1937#false} is VALID [2022-04-08 06:00:28,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 10);havoc #t~post6; {1937#false} is VALID [2022-04-08 06:00:28,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-08 06:00:28,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {1937#false} is VALID [2022-04-08 06:00:28,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 10)} is VALID [2022-04-08 06:00:28,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 10)} assume !(~r~0 > 0); {2087#(< ~counter~0 10)} is VALID [2022-04-08 06:00:28,881 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 10)} #96#return; {2087#(< ~counter~0 10)} is VALID [2022-04-08 06:00:28,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:00:28,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:00:28,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:00:28,881 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~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)); {1936#true} is VALID [2022-04-08 06:00:28,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {2087#(< ~counter~0 10)} is VALID [2022-04-08 06:00:28,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 10)} is VALID [2022-04-08 06:00:28,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 9)} assume !!(0 != ~r~0); {2112#(< ~counter~0 9)} is VALID [2022-04-08 06:00:28,883 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 9)} #94#return; {2112#(< ~counter~0 9)} is VALID [2022-04-08 06:00:28,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:00:28,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:00:28,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:00:28,884 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~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)); {1936#true} is VALID [2022-04-08 06:00:28,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2112#(< ~counter~0 9)} is VALID [2022-04-08 06:00:28,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 9)} is VALID [2022-04-08 06:00:28,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(< ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,885 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 8)} #92#return; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:00:28,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:00:28,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:00:28,886 INFO L272 TraceCheckUtils]: 11: Hoare triple {2137#(< ~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)); {1936#true} is VALID [2022-04-08 06:00:28,887 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 8)} #90#return; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-08 06:00:28,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-08 06:00:28,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-08 06:00:28,887 INFO L272 TraceCheckUtils]: 6: Hoare triple {2137#(< ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-08 06:00:28,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< ~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; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 8)} call #t~ret9 := main(); {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 8)} {1936#true} #102#return; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 8)} assume true; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#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; {2137#(< ~counter~0 8)} is VALID [2022-04-08 06:00:28,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-08 06:00:28,891 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-08 06:00:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818811250] [2022-04-08 06:00:28,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135917230] [2022-04-08 06:00:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135917230] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:00:28,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:00:28,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-08 06:00:28,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724540520] [2022-04-08 06:00:28,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724540520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:28,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:28,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:00:28,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028015458] [2022-04-08 06:00:28,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:28,893 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-08 06:00:28,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:28,895 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-08 06:00:28,924 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-08 06:00:28,924 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:00:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:00:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:00:28,926 INFO L87 Difference]: Start difference. First operand 44 states and 51 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-08 06:00:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:29,118 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-08 06:00:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:00:29,118 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-08 06:00:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:29,119 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-08 06:00:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 06:00:29,121 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-08 06:00:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-08 06:00:29,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-08 06:00:29,211 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-08 06:00:29,212 INFO L225 Difference]: With dead ends: 74 [2022-04-08 06:00:29,212 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 06:00:29,212 INFO L912 BasicCegarLoop]: 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-08 06:00:29,213 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:29,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:29,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 06:00:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-08 06:00:29,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:29,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:29,268 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:29,268 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:29,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:29,270 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 06:00:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 06:00:29,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:29,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:29,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-08 06:00:29,271 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-08 06:00:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:29,277 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 06:00:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 06:00:29,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:29,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:29,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:29,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-08 06:00:29,280 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-08 06:00:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:29,280 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-08 06:00:29,280 INFO L479 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-08 06:00:29,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-08 06:00:30,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-08 06:00:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 06:00:30,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:30,779 INFO L499 BasicCegarLoop]: 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-08 06:00:30,804 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-08 06:00:30,979 WARN L460 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-08 06:00:30,980 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-08 06:00:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1978518719] [2022-04-08 06:00:30,981 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-08 06:00:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:30,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124273639] [2022-04-08 06:00:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:30,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:30,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551918964] [2022-04-08 06:00:30,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:30,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:30,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:31,004 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-08 06:00:31,006 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-08 06:00:31,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:31,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:31,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:00:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:31,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:31,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 06:00:31,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#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; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(<= ~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; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {2557#(<= ~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)); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,298 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2557#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:31,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,300 INFO L272 TraceCheckUtils]: 19: Hoare triple {2606#(<= ~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)); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,301 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:31,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {2606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,303 INFO L272 TraceCheckUtils]: 27: Hoare triple {2631#(<= ~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)); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,305 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {2631#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2631#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:31,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {2631#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2656#(<= |main_#t~post7| 2)} is VALID [2022-04-08 06:00:31,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {2550#false} is VALID [2022-04-08 06:00:31,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 06:00:31,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 10);havoc #t~post8; {2550#false} is VALID [2022-04-08 06:00:31,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 06:00:31,306 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 10);havoc #t~post6; {2550#false} is VALID [2022-04-08 06:00:31,306 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#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)); {2550#false} is VALID [2022-04-08 06:00:31,306 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 06:00:31,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 06:00:31,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 06:00:31,307 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-08 06:00:31,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:31,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#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)); {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 10);havoc #t~post6; {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 10);havoc #t~post8; {2550#false} is VALID [2022-04-08 06:00:31,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-08 06:00:31,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {2550#false} is VALID [2022-04-08 06:00:31,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2708#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:00:31,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {2712#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2712#(< ~counter~0 10)} is VALID [2022-04-08 06:00:31,552 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 10)} #96#return; {2712#(< ~counter~0 10)} is VALID [2022-04-08 06:00:31,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:00:31,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:00:31,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:00:31,553 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#(< ~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)); {2549#true} is VALID [2022-04-08 06:00:31,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {2712#(< ~counter~0 10)} is VALID [2022-04-08 06:00:31,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {2737#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2712#(< ~counter~0 10)} is VALID [2022-04-08 06:00:31,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 9)} assume !!(0 != ~r~0); {2737#(< ~counter~0 9)} is VALID [2022-04-08 06:00:31,555 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 9)} #94#return; {2737#(< ~counter~0 9)} is VALID [2022-04-08 06:00:31,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:00:31,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:00:31,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:00:31,556 INFO L272 TraceCheckUtils]: 19: Hoare triple {2737#(< ~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)); {2549#true} is VALID [2022-04-08 06:00:31,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2737#(< ~counter~0 9)} is VALID [2022-04-08 06:00:31,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2737#(< ~counter~0 9)} is VALID [2022-04-08 06:00:31,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(< ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 8)} #92#return; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:00:31,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:00:31,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:00:31,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {2762#(< ~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)); {2549#true} is VALID [2022-04-08 06:00:31,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 8)} #90#return; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-08 06:00:31,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-08 06:00:31,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-08 06:00:31,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {2762#(< ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2549#true} is VALID [2022-04-08 06:00:31,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#(< ~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; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 8)} call #t~ret9 := main(); {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 8)} {2549#true} #102#return; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 8)} assume true; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#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; {2762#(< ~counter~0 8)} is VALID [2022-04-08 06:00:31,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-08 06:00:31,560 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-08 06:00:31,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124273639] [2022-04-08 06:00:31,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551918964] [2022-04-08 06:00:31,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551918964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:31,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:31,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 06:00:31,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1978518719] [2022-04-08 06:00:31,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1978518719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:31,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:31,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:00:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114875705] [2022-04-08 06:00:31,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:31,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-08 06:00:31,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:31,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:00:31,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:31,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:00:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:00:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:00:31,591 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:00:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:31,798 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-08 06:00:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:00:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-08 06:00:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:00:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 06:00:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:00:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-08 06:00:31,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-08 06:00:31,874 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-08 06:00:31,876 INFO L225 Difference]: With dead ends: 75 [2022-04-08 06:00:31,876 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 06:00:31,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:00:31,877 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:31,878 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 06:00:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 06:00:31,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:31,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:31,940 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:31,941 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:31,943 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 06:00:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 06:00:31,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:31,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:31,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 06:00:31,944 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-08 06:00:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:31,946 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-08 06:00:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 06:00:31,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:31,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:31,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:31,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:00:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-08 06:00:31,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-08 06:00:31,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:31,960 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-08 06:00:31,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-08 06:00:31,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-08 06:00:32,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-08 06:00:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 06:00:32,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:32,474 INFO L499 BasicCegarLoop]: 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-08 06:00:32,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 06:00:32,674 WARN L460 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-08 06:00:32,674 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-08 06:00:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:32,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900645232] [2022-04-08 06:00:32,675 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-08 06:00:32,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:32,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82736813] [2022-04-08 06:00:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:32,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:32,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850982144] [2022-04-08 06:00:32,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:32,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:32,691 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-08 06:00:32,701 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-08 06:00:32,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:32,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:32,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:00:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:32,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:32,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#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; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#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; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L272 TraceCheckUtils]: 11: Hoare triple {3184#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)); {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:00:32,923 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 10);havoc #t~post6; {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L272 TraceCheckUtils]: 19: Hoare triple {3184#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)); {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:00:32,924 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-08 06:00:32,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:00:32,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {3261#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:00:32,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(not (= main_~r~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:00:32,925 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(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)); {3184#true} is VALID [2022-04-08 06:00:32,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:00:32,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:00:32,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:00:32,926 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3184#true} {3261#(not (= main_~r~0 0))} #96#return; {3261#(not (= main_~r~0 0))} is VALID [2022-04-08 06:00:32,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:00:32,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:00:32,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:00:32,933 INFO L272 TraceCheckUtils]: 35: Hoare triple {3286#(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)); {3184#true} is VALID [2022-04-08 06:00:32,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-08 06:00:32,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-08 06:00:32,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-08 06:00:32,934 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3184#true} {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-08 06:00:32,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3185#false} is VALID [2022-04-08 06:00:32,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-08 06:00:32,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 10);havoc #t~post6; {3185#false} is VALID [2022-04-08 06:00:32,935 INFO L272 TraceCheckUtils]: 43: Hoare triple {3185#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)); {3185#false} is VALID [2022-04-08 06:00:32,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-08 06:00:32,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-08 06:00:32,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-08 06:00:32,938 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-08 06:00:32,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:00:32,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:32,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82736813] [2022-04-08 06:00:32,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:32,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850982144] [2022-04-08 06:00:32,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850982144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:32,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:32,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:00:32,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900645232] [2022-04-08 06:00:32,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900645232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:32,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:32,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:00:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413282454] [2022-04-08 06:00:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:32,940 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-08 06:00:32,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:32,941 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-08 06:00:32,969 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-08 06:00:32,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:00:32,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:32,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:00:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:00:32,970 INFO L87 Difference]: Start difference. First operand 54 states and 62 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-08 06:00:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:33,126 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-08 06:00:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:00:33,126 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-08 06:00:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:33,126 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-08 06:00:33,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 06:00:33,128 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-08 06:00:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-08 06:00:33,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-08 06:00:33,210 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-08 06:00:33,212 INFO L225 Difference]: With dead ends: 101 [2022-04-08 06:00:33,212 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 06:00:33,212 INFO L912 BasicCegarLoop]: 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-08 06:00:33,213 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:33,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 06:00:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-08 06:00:33,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:33,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:00:33,279 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:00:33,280 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:00:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:33,282 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 06:00:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 06:00:33,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:33,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:33,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-08 06:00:33,284 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-08 06:00:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:33,286 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 06:00:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 06:00:33,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:33,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:33,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:33,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:00:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-08 06:00:33,289 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-08 06:00:33,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:33,289 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-08 06:00:33,289 INFO L479 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-08 06:00:33,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-08 06:00:34,297 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-08 06:00:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-08 06:00:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 06:00:34,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:34,298 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:34,321 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-08 06:00:34,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 06:00:34,499 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-08 06:00:34,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12655025] [2022-04-08 06:00:34,500 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-08 06:00:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:34,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96475276] [2022-04-08 06:00:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:34,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:34,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:34,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826540351] [2022-04-08 06:00:34,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:34,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:34,532 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-08 06:00:34,540 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-08 06:00:34,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:34,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:34,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:00:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:34,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:34,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 06:00:34,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#(<= ~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; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,881 INFO L272 TraceCheckUtils]: 6: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,884 INFO L272 TraceCheckUtils]: 11: Hoare triple {3838#(<= ~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)); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,885 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3838#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:34,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {3887#(<= ~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)); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,889 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:34,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {3887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {3912#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,891 INFO L272 TraceCheckUtils]: 27: Hoare triple {3912#(<= ~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)); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,891 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,892 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:34,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {3912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {3937#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,894 INFO L272 TraceCheckUtils]: 35: Hoare triple {3937#(<= ~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)); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,896 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3937#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:34,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3962#(<= |main_#t~post8| 3)} is VALID [2022-04-08 06:00:34,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 10);havoc #t~post8; {3831#false} is VALID [2022-04-08 06:00:34,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 06:00:34,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 10);havoc #t~post6; {3831#false} is VALID [2022-04-08 06:00:34,897 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#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)); {3831#false} is VALID [2022-04-08 06:00:34,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 06:00:34,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 06:00:34,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 06:00:34,898 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-08 06:00:34,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:35,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-08 06:00:35,193 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-08 06:00:35,193 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-08 06:00:35,193 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#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)); {3831#false} is VALID [2022-04-08 06:00:35,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 10);havoc #t~post6; {3831#false} is VALID [2022-04-08 06:00:35,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-08 06:00:35,194 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {3831#false} is VALID [2022-04-08 06:00:35,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {4006#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4002#(< |main_#t~post8| 10)} is VALID [2022-04-08 06:00:35,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4006#(< ~counter~0 10)} is VALID [2022-04-08 06:00:35,196 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 10)} #98#return; {4006#(< ~counter~0 10)} is VALID [2022-04-08 06:00:35,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:00:35,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:00:35,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:00:35,196 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(< ~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)); {3830#true} is VALID [2022-04-08 06:00:35,196 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {4006#(< ~counter~0 10)} is VALID [2022-04-08 06:00:35,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4006#(< ~counter~0 10)} is VALID [2022-04-08 06:00:35,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 9)} assume !(~r~0 > 0); {4031#(< ~counter~0 9)} is VALID [2022-04-08 06:00:35,198 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 9)} #96#return; {4031#(< ~counter~0 9)} is VALID [2022-04-08 06:00:35,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:00:35,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:00:35,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:00:35,199 INFO L272 TraceCheckUtils]: 27: Hoare triple {4031#(< ~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)); {3830#true} is VALID [2022-04-08 06:00:35,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {4031#(< ~counter~0 9)} is VALID [2022-04-08 06:00:35,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4031#(< ~counter~0 9)} is VALID [2022-04-08 06:00:35,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 8)} assume !!(0 != ~r~0); {4056#(< ~counter~0 8)} is VALID [2022-04-08 06:00:35,201 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 8)} #94#return; {4056#(< ~counter~0 8)} is VALID [2022-04-08 06:00:35,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:00:35,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:00:35,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:00:35,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {4056#(< ~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)); {3830#true} is VALID [2022-04-08 06:00:35,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4056#(< ~counter~0 8)} is VALID [2022-04-08 06:00:35,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {4081#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4056#(< ~counter~0 8)} is VALID [2022-04-08 06:00:35,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {4081#(< ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 7)} #92#return; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:00:35,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:00:35,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:00:35,204 INFO L272 TraceCheckUtils]: 11: Hoare triple {4081#(< ~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)); {3830#true} is VALID [2022-04-08 06:00:35,204 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 7)} #90#return; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-08 06:00:35,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-08 06:00:35,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-08 06:00:35,205 INFO L272 TraceCheckUtils]: 6: Hoare triple {4081#(< ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-08 06:00:35,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {4081#(< ~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; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 7)} call #t~ret9 := main(); {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 7)} {3830#true} #102#return; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 7)} assume true; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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; {4081#(< ~counter~0 7)} is VALID [2022-04-08 06:00:35,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-08 06:00:35,207 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-08 06:00:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:35,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96475276] [2022-04-08 06:00:35,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:35,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826540351] [2022-04-08 06:00:35,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826540351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:35,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:35,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:00:35,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:35,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12655025] [2022-04-08 06:00:35,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12655025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:35,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:35,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:00:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728116284] [2022-04-08 06:00:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:35,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-08 06:00:35,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:35,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:35,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:35,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:00:35,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:00:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:00:35,255 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:35,524 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-08 06:00:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:00:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-08 06:00:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:35,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 06:00:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 06:00:35,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 06:00:35,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:35,602 INFO L225 Difference]: With dead ends: 118 [2022-04-08 06:00:35,603 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 06:00:35,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:00:35,604 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:35,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 06:00:35,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-08 06:00:35,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:35,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:35,693 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:35,694 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:35,696 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 06:00:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 06:00:35,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:35,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:35,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 06:00:35,697 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-08 06:00:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:35,699 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 06:00:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 06:00:35,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:35,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:35,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:35,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-08 06:00:35,703 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-08 06:00:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:35,703 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-08 06:00:35,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:35,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-08 06:00:37,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-08 06:00:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 06:00:37,832 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:37,832 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2022-04-08 06:00:37,848 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-08 06:00:38,035 WARN L460 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-08 06:00:38,035 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-08 06:00:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:38,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1862973906] [2022-04-08 06:00:38,036 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-08 06:00:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:38,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431615762] [2022-04-08 06:00:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:38,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:38,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914107377] [2022-04-08 06:00:38,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:00:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:38,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:38,064 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-08 06:00:38,071 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-08 06:00:38,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:00:38,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:38,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:00:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:38,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:38,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 06:00:38,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#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; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {4703#(<= ~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; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,453 INFO L272 TraceCheckUtils]: 6: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,455 INFO L272 TraceCheckUtils]: 11: Hoare triple {4703#(<= ~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)); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {4703#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4703#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:38,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {4703#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {4752#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,459 INFO L272 TraceCheckUtils]: 19: Hoare triple {4752#(<= ~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)); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,461 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:38,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {4752#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,465 INFO L272 TraceCheckUtils]: 27: Hoare triple {4777#(<= ~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)); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,467 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {4777#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4777#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:38,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {4777#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {4802#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,469 INFO L272 TraceCheckUtils]: 35: Hoare triple {4802#(<= ~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)); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,470 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {4802#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4802#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:38,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {4802#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4827#(<= |main_#t~post7| 3)} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 10);havoc #t~post8; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 10);havoc #t~post6; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#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)); {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 06:00:38,472 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 06:00:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:38,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#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)); {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 10);havoc #t~post6; {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 10);havoc #t~post8; {4696#false} is VALID [2022-04-08 06:00:38,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-08 06:00:38,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {4696#false} is VALID [2022-04-08 06:00:38,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {4883#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4879#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:00:38,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {4883#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4883#(< ~counter~0 10)} is VALID [2022-04-08 06:00:38,772 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 10)} #96#return; {4883#(< ~counter~0 10)} is VALID [2022-04-08 06:00:38,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:00:38,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:00:38,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:00:38,772 INFO L272 TraceCheckUtils]: 35: Hoare triple {4883#(< ~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)); {4695#true} is VALID [2022-04-08 06:00:38,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {4883#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {4883#(< ~counter~0 10)} is VALID [2022-04-08 06:00:38,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {4908#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4883#(< ~counter~0 10)} is VALID [2022-04-08 06:00:38,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {4908#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4908#(< ~counter~0 9)} is VALID [2022-04-08 06:00:38,774 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 9)} #96#return; {4908#(< ~counter~0 9)} is VALID [2022-04-08 06:00:38,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:00:38,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:00:38,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:00:38,775 INFO L272 TraceCheckUtils]: 27: Hoare triple {4908#(< ~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)); {4695#true} is VALID [2022-04-08 06:00:38,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {4908#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {4908#(< ~counter~0 9)} is VALID [2022-04-08 06:00:38,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {4933#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4908#(< ~counter~0 9)} is VALID [2022-04-08 06:00:38,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 8)} assume !!(0 != ~r~0); {4933#(< ~counter~0 8)} is VALID [2022-04-08 06:00:38,776 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 8)} #94#return; {4933#(< ~counter~0 8)} is VALID [2022-04-08 06:00:38,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:00:38,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:00:38,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:00:38,776 INFO L272 TraceCheckUtils]: 19: Hoare triple {4933#(< ~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)); {4695#true} is VALID [2022-04-08 06:00:38,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4933#(< ~counter~0 8)} is VALID [2022-04-08 06:00:38,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4933#(< ~counter~0 8)} is VALID [2022-04-08 06:00:38,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(< ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 7)} #92#return; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:00:38,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:00:38,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:00:38,778 INFO L272 TraceCheckUtils]: 11: Hoare triple {4958#(< ~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)); {4695#true} is VALID [2022-04-08 06:00:38,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 7)} #90#return; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-08 06:00:38,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-08 06:00:38,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-08 06:00:38,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {4958#(< ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4695#true} is VALID [2022-04-08 06:00:38,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {4958#(< ~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; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 7)} call #t~ret9 := main(); {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 7)} {4695#true} #102#return; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 7)} assume true; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#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; {4958#(< ~counter~0 7)} is VALID [2022-04-08 06:00:38,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-08 06:00:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 06:00:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:38,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431615762] [2022-04-08 06:00:38,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:38,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914107377] [2022-04-08 06:00:38,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914107377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:38,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:38,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 06:00:38,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:38,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1862973906] [2022-04-08 06:00:38,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1862973906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:38,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:38,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 06:00:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909619199] [2022-04-08 06:00:38,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:38,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-08 06:00:38,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:38,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:38,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:38,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 06:00:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:38,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 06:00:38,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:00:38,824 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:39,059 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-08 06:00:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:00:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-08 06:00:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 06:00:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-08 06:00:39,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-08 06:00:39,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:39,152 INFO L225 Difference]: With dead ends: 119 [2022-04-08 06:00:39,152 INFO L226 Difference]: Without dead ends: 82 [2022-04-08 06:00:39,152 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:39,153 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:39,153 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:00:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-08 06:00:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-08 06:00:39,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:39,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:39,243 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:39,243 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:39,253 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 06:00:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:00:39,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:39,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:39,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 06:00:39,254 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-08 06:00:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:39,256 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-08 06:00:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:00:39,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:39,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:39,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:39,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 06:00:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-08 06:00:39,259 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-08 06:00:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:39,259 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-08 06:00:39,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-08 06:00:39,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-08 06:00:39,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-08 06:00:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 06:00:39,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:39,869 INFO L499 BasicCegarLoop]: 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-08 06:00:39,875 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-08 06:00:40,071 WARN L460 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-08 06:00:40,071 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-08 06:00:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:40,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251011166] [2022-04-08 06:00:40,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-08 06:00:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:40,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926687105] [2022-04-08 06:00:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:40,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:40,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056806154] [2022-04-08 06:00:40,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:40,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:40,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:40,101 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-08 06:00:40,102 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-08 06:00:40,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:40,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:40,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:00:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:40,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:40,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 06:00:40,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~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; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~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)); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,460 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {5590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5590#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:40,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,462 INFO L272 TraceCheckUtils]: 19: Hoare triple {5639#(<= ~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)); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,464 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:40,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {5639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,466 INFO L272 TraceCheckUtils]: 27: Hoare triple {5664#(<= ~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)); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,467 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:40,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,470 INFO L272 TraceCheckUtils]: 35: Hoare triple {5689#(<= ~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)); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,470 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,472 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:40,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {5689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,474 INFO L272 TraceCheckUtils]: 43: Hoare triple {5714#(<= ~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)); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,476 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,476 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:40,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {5714#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5739#(<= |main_#t~post6| 4)} is VALID [2022-04-08 06:00:40,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {5583#false} is VALID [2022-04-08 06:00:40,477 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#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)); {5583#false} is VALID [2022-04-08 06:00:40,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 06:00:40,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 06:00:40,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 06:00:40,478 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-08 06:00:40,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:40,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-08 06:00:40,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-08 06:00:40,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-08 06:00:40,819 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#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)); {5583#false} is VALID [2022-04-08 06:00:40,819 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {5583#false} is VALID [2022-04-08 06:00:40,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {5771#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5767#(< |main_#t~post6| 10)} is VALID [2022-04-08 06:00:40,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 10)} assume !(~r~0 < 0); {5771#(< ~counter~0 10)} is VALID [2022-04-08 06:00:40,820 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 10)} #98#return; {5771#(< ~counter~0 10)} is VALID [2022-04-08 06:00:40,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:00:40,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:00:40,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:00:40,821 INFO L272 TraceCheckUtils]: 43: Hoare triple {5771#(< ~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)); {5582#true} is VALID [2022-04-08 06:00:40,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {5771#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {5771#(< ~counter~0 10)} is VALID [2022-04-08 06:00:40,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {5796#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5771#(< ~counter~0 10)} is VALID [2022-04-08 06:00:40,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {5796#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5796#(< ~counter~0 9)} is VALID [2022-04-08 06:00:40,823 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 9)} #98#return; {5796#(< ~counter~0 9)} is VALID [2022-04-08 06:00:40,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:00:40,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:00:40,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:00:40,823 INFO L272 TraceCheckUtils]: 35: Hoare triple {5796#(< ~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)); {5582#true} is VALID [2022-04-08 06:00:40,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {5796#(< ~counter~0 9)} is VALID [2022-04-08 06:00:40,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {5821#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5796#(< ~counter~0 9)} is VALID [2022-04-08 06:00:40,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 8)} assume !(~r~0 > 0); {5821#(< ~counter~0 8)} is VALID [2022-04-08 06:00:40,842 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 8)} #96#return; {5821#(< ~counter~0 8)} is VALID [2022-04-08 06:00:40,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:00:40,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:00:40,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:00:40,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {5821#(< ~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)); {5582#true} is VALID [2022-04-08 06:00:40,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {5821#(< ~counter~0 8)} is VALID [2022-04-08 06:00:40,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5821#(< ~counter~0 8)} is VALID [2022-04-08 06:00:40,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 7)} assume !!(0 != ~r~0); {5846#(< ~counter~0 7)} is VALID [2022-04-08 06:00:40,845 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 7)} #94#return; {5846#(< ~counter~0 7)} is VALID [2022-04-08 06:00:40,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:00:40,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:00:40,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:00:40,846 INFO L272 TraceCheckUtils]: 19: Hoare triple {5846#(< ~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)); {5582#true} is VALID [2022-04-08 06:00:40,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {5846#(< ~counter~0 7)} is VALID [2022-04-08 06:00:40,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 7)} is VALID [2022-04-08 06:00:40,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,848 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 6)} #92#return; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:00:40,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:00:40,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:00:40,849 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#(< ~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)); {5582#true} is VALID [2022-04-08 06:00:40,849 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 6)} #90#return; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-08 06:00:40,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-08 06:00:40,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-08 06:00:40,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#true} is VALID [2022-04-08 06:00:40,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#(< ~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; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 6)} call #t~ret9 := main(); {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 6)} {5582#true} #102#return; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 6)} assume true; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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; {5871#(< ~counter~0 6)} is VALID [2022-04-08 06:00:40,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-08 06:00:40,852 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-08 06:00:40,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:40,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926687105] [2022-04-08 06:00:40,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:40,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056806154] [2022-04-08 06:00:40,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056806154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:40,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:40,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:00:40,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:40,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251011166] [2022-04-08 06:00:40,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251011166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:40,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:40,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:00:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439149736] [2022-04-08 06:00:40,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-08 06:00:40,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:40,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:40,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:40,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:00:40,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:00:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:40,894 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:41,204 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-08 06:00:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 06:00:41,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-08 06:00:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 06:00:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 06:00:41,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 06:00:41,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:41,288 INFO L225 Difference]: With dead ends: 99 [2022-04-08 06:00:41,288 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 06:00:41,288 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-08 06:00:41,289 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:41,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 06:00:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-08 06:00:41,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:41,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:41,392 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:41,392 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:41,394 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 06:00:41,394 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:00:41,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:41,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:41,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 06:00:41,395 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-08 06:00:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:41,397 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-08 06:00:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:00:41,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:41,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:41,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:41,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-08 06:00:41,402 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-08 06:00:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:41,402 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-08 06:00:41,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:41,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-08 06:00:41,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-08 06:00:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-08 06:00:41,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:41,725 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2022-04-08 06:00:41,743 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-08 06:00:41,927 WARN L460 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-08 06:00:41,927 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-08 06:00:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1892432897] [2022-04-08 06:00:41,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:41,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-08 06:00:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:41,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246416691] [2022-04-08 06:00:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:41,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:41,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:41,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139252112] [2022-04-08 06:00:41,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:00:41,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:41,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:41,942 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-08 06:00:41,970 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-08 06:00:42,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:00:42,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:42,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:00:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:42,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:42,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 06:00:42,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#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; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {6503#(<= ~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; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,326 INFO L272 TraceCheckUtils]: 11: Hoare triple {6503#(<= ~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)); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,327 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6503#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:42,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {6552#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,329 INFO L272 TraceCheckUtils]: 19: Hoare triple {6552#(<= ~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)); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,337 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:42,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {6552#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {6577#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,338 INFO L272 TraceCheckUtils]: 27: Hoare triple {6577#(<= ~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)); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,340 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:42,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,342 INFO L272 TraceCheckUtils]: 35: Hoare triple {6602#(<= ~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)); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,343 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {6602#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6602#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:42,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {6602#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {6627#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,345 INFO L272 TraceCheckUtils]: 43: Hoare triple {6627#(<= ~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)); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,346 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {6627#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6627#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:42,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {6627#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6652#(<= |main_#t~post8| 4)} is VALID [2022-04-08 06:00:42,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 10);havoc #t~post8; {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 10);havoc #t~post6; {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#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)); {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 06:00:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:42,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:42,641 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-08 06:00:42,641 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-08 06:00:42,641 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-08 06:00:42,641 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#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)); {6496#false} is VALID [2022-04-08 06:00:42,641 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 10);havoc #t~post6; {6496#false} is VALID [2022-04-08 06:00:42,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-08 06:00:42,641 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {6496#false} is VALID [2022-04-08 06:00:42,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {6696#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6692#(< |main_#t~post8| 10)} is VALID [2022-04-08 06:00:42,642 INFO L290 TraceCheckUtils]: 48: Hoare triple {6696#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6696#(< ~counter~0 10)} is VALID [2022-04-08 06:00:42,642 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 10)} #98#return; {6696#(< ~counter~0 10)} is VALID [2022-04-08 06:00:42,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:00:42,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:00:42,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:00:42,643 INFO L272 TraceCheckUtils]: 43: Hoare triple {6696#(< ~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)); {6495#true} is VALID [2022-04-08 06:00:42,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {6696#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {6696#(< ~counter~0 10)} is VALID [2022-04-08 06:00:42,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6696#(< ~counter~0 10)} is VALID [2022-04-08 06:00:42,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(< ~counter~0 9)} is VALID [2022-04-08 06:00:42,644 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 9)} #98#return; {6721#(< ~counter~0 9)} is VALID [2022-04-08 06:00:42,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:00:42,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:00:42,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:00:42,645 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(< ~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)); {6495#true} is VALID [2022-04-08 06:00:42,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {6721#(< ~counter~0 9)} is VALID [2022-04-08 06:00:42,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {6746#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(< ~counter~0 9)} is VALID [2022-04-08 06:00:42,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 8)} assume !(~r~0 > 0); {6746#(< ~counter~0 8)} is VALID [2022-04-08 06:00:42,649 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 8)} #96#return; {6746#(< ~counter~0 8)} is VALID [2022-04-08 06:00:42,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:00:42,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:00:42,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:00:42,649 INFO L272 TraceCheckUtils]: 27: Hoare triple {6746#(< ~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)); {6495#true} is VALID [2022-04-08 06:00:42,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {6746#(< ~counter~0 8)} is VALID [2022-04-08 06:00:42,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {6771#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6746#(< ~counter~0 8)} is VALID [2022-04-08 06:00:42,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 7)} assume !!(0 != ~r~0); {6771#(< ~counter~0 7)} is VALID [2022-04-08 06:00:42,651 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 7)} #94#return; {6771#(< ~counter~0 7)} is VALID [2022-04-08 06:00:42,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:00:42,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:00:42,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:00:42,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {6771#(< ~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)); {6495#true} is VALID [2022-04-08 06:00:42,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6771#(< ~counter~0 7)} is VALID [2022-04-08 06:00:42,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {6796#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(< ~counter~0 7)} is VALID [2022-04-08 06:00:42,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {6796#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 6)} #92#return; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:00:42,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:00:42,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:00:42,653 INFO L272 TraceCheckUtils]: 11: Hoare triple {6796#(< ~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)); {6495#true} is VALID [2022-04-08 06:00:42,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 6)} #90#return; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-08 06:00:42,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-08 06:00:42,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-08 06:00:42,654 INFO L272 TraceCheckUtils]: 6: Hoare triple {6796#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6495#true} is VALID [2022-04-08 06:00:42,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {6796#(< ~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; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 6)} call #t~ret9 := main(); {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 6)} {6495#true} #102#return; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 6)} assume true; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#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; {6796#(< ~counter~0 6)} is VALID [2022-04-08 06:00:42,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-08 06:00:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 06:00:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:42,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246416691] [2022-04-08 06:00:42,657 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:42,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139252112] [2022-04-08 06:00:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139252112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:42,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:42,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:00:42,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:42,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1892432897] [2022-04-08 06:00:42,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1892432897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:42,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:42,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:00:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4259676] [2022-04-08 06:00:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:42,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-08 06:00:42,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:42,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:42,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:42,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:00:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:42,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:00:42,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:42,703 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:43,033 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-08 06:00:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:00:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-08 06:00:43,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:00:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-08 06:00:43,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-08 06:00:43,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:43,130 INFO L225 Difference]: With dead ends: 132 [2022-04-08 06:00:43,130 INFO L226 Difference]: Without dead ends: 95 [2022-04-08 06:00:43,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:00:43,131 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:43,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-08 06:00:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-08 06:00:43,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:43,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:43,223 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:43,223 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:43,225 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 06:00:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 06:00:43,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:43,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:43,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 06:00:43,226 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-08 06:00:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:43,229 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-08 06:00:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-08 06:00:43,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:43,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:43,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:43,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-08 06:00:43,232 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-08 06:00:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:43,232 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-08 06:00:43,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:43,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-08 06:00:45,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 115 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-08 06:00:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 06:00:45,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:45,402 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 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] [2022-04-08 06:00:45,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 06:00:45,607 WARN L460 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-08 06:00:45,608 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-08 06:00:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:45,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050345253] [2022-04-08 06:00:45,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-08 06:00:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:45,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802394225] [2022-04-08 06:00:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:45,630 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:45,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390831770] [2022-04-08 06:00:45,630 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:00:45,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:45,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:45,631 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-08 06:00:45,657 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-08 06:00:45,735 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 06:00:45,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:45,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:00:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:45,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:46,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 06:00:46,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#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; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {7504#(<= ~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; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,041 INFO L272 TraceCheckUtils]: 11: Hoare triple {7504#(<= ~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)); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,042 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7504#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:46,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {7553#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,044 INFO L272 TraceCheckUtils]: 19: Hoare triple {7553#(<= ~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)); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:46,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {7553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {7578#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,047 INFO L272 TraceCheckUtils]: 27: Hoare triple {7578#(<= ~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)); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,050 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {7578#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7578#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:46,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {7578#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,052 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~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)); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,053 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {7603#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7603#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:46,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {7603#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {7628#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,054 INFO L272 TraceCheckUtils]: 43: Hoare triple {7628#(<= ~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)); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,056 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {7628#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7628#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:46,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7653#(<= |main_#t~post7| 4)} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 10);havoc #t~post8; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 10);havoc #t~post6; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#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)); {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 06:00:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:46,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:46,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-08 06:00:46,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-08 06:00:46,371 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-08 06:00:46,371 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#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)); {7497#false} is VALID [2022-04-08 06:00:46,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 10);havoc #t~post6; {7497#false} is VALID [2022-04-08 06:00:46,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-08 06:00:46,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 10);havoc #t~post8; {7497#false} is VALID [2022-04-08 06:00:46,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-08 06:00:46,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {7497#false} is VALID [2022-04-08 06:00:46,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {7709#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7705#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:00:46,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {7709#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7709#(< ~counter~0 10)} is VALID [2022-04-08 06:00:46,374 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 10)} #96#return; {7709#(< ~counter~0 10)} is VALID [2022-04-08 06:00:46,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:00:46,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:00:46,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:00:46,374 INFO L272 TraceCheckUtils]: 43: Hoare triple {7709#(< ~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)); {7496#true} is VALID [2022-04-08 06:00:46,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {7709#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {7709#(< ~counter~0 10)} is VALID [2022-04-08 06:00:46,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {7734#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7709#(< ~counter~0 10)} is VALID [2022-04-08 06:00:46,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {7734#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7734#(< ~counter~0 9)} is VALID [2022-04-08 06:00:46,376 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 9)} #96#return; {7734#(< ~counter~0 9)} is VALID [2022-04-08 06:00:46,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:00:46,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:00:46,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:00:46,376 INFO L272 TraceCheckUtils]: 35: Hoare triple {7734#(< ~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)); {7496#true} is VALID [2022-04-08 06:00:46,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {7734#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {7734#(< ~counter~0 9)} is VALID [2022-04-08 06:00:46,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {7759#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7734#(< ~counter~0 9)} is VALID [2022-04-08 06:00:46,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {7759#(< ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7759#(< ~counter~0 8)} is VALID [2022-04-08 06:00:46,378 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 8)} #96#return; {7759#(< ~counter~0 8)} is VALID [2022-04-08 06:00:46,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:00:46,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:00:46,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:00:46,379 INFO L272 TraceCheckUtils]: 27: Hoare triple {7759#(< ~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)); {7496#true} is VALID [2022-04-08 06:00:46,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {7759#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {7759#(< ~counter~0 8)} is VALID [2022-04-08 06:00:46,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7759#(< ~counter~0 8)} is VALID [2022-04-08 06:00:46,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 7)} assume !!(0 != ~r~0); {7784#(< ~counter~0 7)} is VALID [2022-04-08 06:00:46,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 7)} #94#return; {7784#(< ~counter~0 7)} is VALID [2022-04-08 06:00:46,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:00:46,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:00:46,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:00:46,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {7784#(< ~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)); {7496#true} is VALID [2022-04-08 06:00:46,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {7784#(< ~counter~0 7)} is VALID [2022-04-08 06:00:46,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7784#(< ~counter~0 7)} is VALID [2022-04-08 06:00:46,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 6)} #92#return; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:00:46,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:00:46,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:00:46,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(< ~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)); {7496#true} is VALID [2022-04-08 06:00:46,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 6)} #90#return; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-08 06:00:46,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-08 06:00:46,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-08 06:00:46,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7496#true} is VALID [2022-04-08 06:00:46,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(< ~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; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 6)} call #t~ret9 := main(); {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 6)} {7496#true} #102#return; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 6)} assume true; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#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; {7809#(< ~counter~0 6)} is VALID [2022-04-08 06:00:46,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-08 06:00:46,384 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 06:00:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802394225] [2022-04-08 06:00:46,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390831770] [2022-04-08 06:00:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390831770] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:46,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:46,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 06:00:46,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050345253] [2022-04-08 06:00:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050345253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:46,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:46,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:00:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061816773] [2022-04-08 06:00:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 06:00:46,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:46,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:46,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:46,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:00:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:46,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:00:46,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:46,435 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:46,758 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-08 06:00:46,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:00:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-08 06:00:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 06:00:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-08 06:00:46,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-08 06:00:46,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:46,861 INFO L225 Difference]: With dead ends: 133 [2022-04-08 06:00:46,861 INFO L226 Difference]: Without dead ends: 96 [2022-04-08 06:00:46,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-08 06:00:46,862 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:46,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-08 06:00:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-08 06:00:46,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:46,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:46,955 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:46,955 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:46,959 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 06:00:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:00:46,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:46,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:46,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 06:00:46,964 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-08 06:00:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:46,967 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-08 06:00:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:00:46,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:46,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:46,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:46,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 06:00:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-08 06:00:46,988 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-08 06:00:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:46,989 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-08 06:00:46,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-08 06:00:46,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-08 06:00:48,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-08 06:00:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 06:00:48,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:48,578 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:48,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 06:00:48,779 WARN L460 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-08 06:00:48,780 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-08 06:00:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:48,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141737357] [2022-04-08 06:00:48,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-08 06:00:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:48,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600663666] [2022-04-08 06:00:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:48,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744292797] [2022-04-08 06:00:48,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:00:48,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:48,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:48,793 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-08 06:00:48,798 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-08 06:00:48,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:00:48,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:48,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:00:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:48,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:49,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 06:00:49,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#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; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~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; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~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)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:49,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {8576#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,202 INFO L272 TraceCheckUtils]: 19: Hoare triple {8576#(<= ~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)); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:49,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {8576#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {8601#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,205 INFO L272 TraceCheckUtils]: 27: Hoare triple {8601#(<= ~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)); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,206 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:49,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {8626#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,208 INFO L272 TraceCheckUtils]: 35: Hoare triple {8626#(<= ~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)); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,209 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {8626#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8626#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:49,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {8626#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,210 INFO L272 TraceCheckUtils]: 43: Hoare triple {8651#(<= ~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)); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,212 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {8651#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {8651#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,213 INFO L272 TraceCheckUtils]: 51: Hoare triple {8676#(<= ~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)); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,215 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,215 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8701#(<= |main_#t~post6| 5)} is VALID [2022-04-08 06:00:49,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-08 06:00:49,216 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#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)); {8520#false} is VALID [2022-04-08 06:00:49,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 06:00:49,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 06:00:49,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 06:00:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:49,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:49,527 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 06:00:49,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 06:00:49,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 06:00:49,528 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#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)); {8520#false} is VALID [2022-04-08 06:00:49,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-08 06:00:49,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {8733#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8729#(< |main_#t~post6| 10)} is VALID [2022-04-08 06:00:49,529 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 10)} assume !(~r~0 < 0); {8733#(< ~counter~0 10)} is VALID [2022-04-08 06:00:49,529 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 10)} #98#return; {8733#(< ~counter~0 10)} is VALID [2022-04-08 06:00:49,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,529 INFO L272 TraceCheckUtils]: 51: Hoare triple {8733#(< ~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)); {8519#true} is VALID [2022-04-08 06:00:49,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {8733#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {8733#(< ~counter~0 10)} is VALID [2022-04-08 06:00:49,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8733#(< ~counter~0 10)} is VALID [2022-04-08 06:00:49,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8758#(< ~counter~0 9)} is VALID [2022-04-08 06:00:49,531 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 9)} #98#return; {8758#(< ~counter~0 9)} is VALID [2022-04-08 06:00:49,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,531 INFO L272 TraceCheckUtils]: 43: Hoare triple {8758#(< ~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)); {8519#true} is VALID [2022-04-08 06:00:49,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {8758#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {8758#(< ~counter~0 9)} is VALID [2022-04-08 06:00:49,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8758#(< ~counter~0 9)} is VALID [2022-04-08 06:00:49,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8783#(< ~counter~0 8)} is VALID [2022-04-08 06:00:49,533 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 8)} #98#return; {8783#(< ~counter~0 8)} is VALID [2022-04-08 06:00:49,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,533 INFO L272 TraceCheckUtils]: 35: Hoare triple {8783#(< ~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)); {8519#true} is VALID [2022-04-08 06:00:49,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {8783#(< ~counter~0 8)} is VALID [2022-04-08 06:00:49,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {8808#(< ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8783#(< ~counter~0 8)} is VALID [2022-04-08 06:00:49,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 7)} assume !(~r~0 > 0); {8808#(< ~counter~0 7)} is VALID [2022-04-08 06:00:49,535 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 7)} #96#return; {8808#(< ~counter~0 7)} is VALID [2022-04-08 06:00:49,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,535 INFO L272 TraceCheckUtils]: 27: Hoare triple {8808#(< ~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)); {8519#true} is VALID [2022-04-08 06:00:49,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {8808#(< ~counter~0 7)} is VALID [2022-04-08 06:00:49,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {8676#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8808#(< ~counter~0 7)} is VALID [2022-04-08 06:00:49,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {8676#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,538 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8676#(<= ~counter~0 5)} #94#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,538 INFO L272 TraceCheckUtils]: 19: Hoare triple {8676#(<= ~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)); {8519#true} is VALID [2022-04-08 06:00:49,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {8651#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8676#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:49,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {8651#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,540 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8651#(<= ~counter~0 4)} #92#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L272 TraceCheckUtils]: 11: Hoare triple {8651#(<= ~counter~0 4)} 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)); {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8651#(<= ~counter~0 4)} #90#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 06:00:49,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {8651#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 06:00:49,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {8651#(<= ~counter~0 4)} 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; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {8651#(<= ~counter~0 4)} call #t~ret9 := main(); {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8651#(<= ~counter~0 4)} {8519#true} #102#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#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; {8651#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:49,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 06:00:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 06:00:49,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600663666] [2022-04-08 06:00:49,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744292797] [2022-04-08 06:00:49,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744292797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:49,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:49,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 06:00:49,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:49,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1141737357] [2022-04-08 06:00:49,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1141737357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:49,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:49,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:00:49,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336545855] [2022-04-08 06:00:49,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:49,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-08 06:00:49,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:49,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:49,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:49,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:00:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:00:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:49,588 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:50,016 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-08 06:00:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 06:00:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-08 06:00:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 06:00:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-08 06:00:50,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-08 06:00:50,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:50,103 INFO L225 Difference]: With dead ends: 116 [2022-04-08 06:00:50,103 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 06:00:50,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-04-08 06:00:50,104 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:50,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 06:00:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-08 06:00:50,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:50,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:50,202 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:50,202 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:50,205 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 06:00:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 06:00:50,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:50,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:50,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 06:00:50,206 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-08 06:00:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:50,209 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-08 06:00:50,209 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-08 06:00:50,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:50,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:50,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:50,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-08 06:00:50,212 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-08 06:00:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:50,212 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-08 06:00:50,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:50,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-08 06:00:52,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-08 06:00:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 06:00:52,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:52,403 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 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] [2022-04-08 06:00:52,423 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-08 06:00:52,615 WARN L460 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-08 06:00:52,617 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:52,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:52,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-08 06:00:52,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:52,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590881519] [2022-04-08 06:00:52,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-08 06:00:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:52,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440815699] [2022-04-08 06:00:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:52,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:52,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470226618] [2022-04-08 06:00:52,649 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:00:52,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:52,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:52,651 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:00:52,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 06:00:52,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:00:52,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:52,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:00:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:52,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:53,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {9580#true} call ULTIMATE.init(); {9580#true} is VALID [2022-04-08 06:00:53,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {9580#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; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9588#(<= ~counter~0 0)} {9580#true} #102#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {9588#(<= ~counter~0 0)} call #t~ret9 := main(); {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {9588#(<= ~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; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {9588#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {9588#(<= ~counter~0 0)} ~cond := #in~cond; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {9588#(<= ~counter~0 0)} assume !(0 == ~cond); {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9588#(<= ~counter~0 0)} {9588#(<= ~counter~0 0)} #90#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {9588#(<= ~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)); {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {9588#(<= ~counter~0 0)} ~cond := #in~cond; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(<= ~counter~0 0)} assume !(0 == ~cond); {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9588#(<= ~counter~0 0)} {9588#(<= ~counter~0 0)} #92#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {9588#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9588#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:53,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {9588#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {9637#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,056 INFO L272 TraceCheckUtils]: 19: Hoare triple {9637#(<= ~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)); {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {9637#(<= ~counter~0 1)} ~cond := #in~cond; {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {9637#(<= ~counter~0 1)} assume !(0 == ~cond); {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {9637#(<= ~counter~0 1)} assume true; {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,057 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9637#(<= ~counter~0 1)} {9637#(<= ~counter~0 1)} #94#return; {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {9637#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9637#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:53,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {9637#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {9662#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,059 INFO L272 TraceCheckUtils]: 27: Hoare triple {9662#(<= ~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)); {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {9662#(<= ~counter~0 2)} ~cond := #in~cond; {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {9662#(<= ~counter~0 2)} assume !(0 == ~cond); {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {9662#(<= ~counter~0 2)} assume true; {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,060 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9662#(<= ~counter~0 2)} {9662#(<= ~counter~0 2)} #96#return; {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {9662#(<= ~counter~0 2)} assume !(~r~0 > 0); {9662#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:53,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {9662#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {9687#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,062 INFO L272 TraceCheckUtils]: 35: Hoare triple {9687#(<= ~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)); {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {9687#(<= ~counter~0 3)} ~cond := #in~cond; {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {9687#(<= ~counter~0 3)} assume !(0 == ~cond); {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {9687#(<= ~counter~0 3)} assume true; {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,063 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9687#(<= ~counter~0 3)} {9687#(<= ~counter~0 3)} #98#return; {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {9687#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9687#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:53,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {9687#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {9712#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,064 INFO L272 TraceCheckUtils]: 43: Hoare triple {9712#(<= ~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)); {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {9712#(<= ~counter~0 4)} ~cond := #in~cond; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {9712#(<= ~counter~0 4)} assume !(0 == ~cond); {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {9712#(<= ~counter~0 4)} assume true; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,066 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9712#(<= ~counter~0 4)} {9712#(<= ~counter~0 4)} #98#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {9712#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {9712#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {9737#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,067 INFO L272 TraceCheckUtils]: 51: Hoare triple {9737#(<= ~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)); {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {9737#(<= ~counter~0 5)} ~cond := #in~cond; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {9737#(<= ~counter~0 5)} assume !(0 == ~cond); {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {9737#(<= ~counter~0 5)} assume true; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,069 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9737#(<= ~counter~0 5)} {9737#(<= ~counter~0 5)} #98#return; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {9737#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {9737#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9762#(<= |main_#t~post8| 5)} is VALID [2022-04-08 06:00:53,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {9762#(<= |main_#t~post8| 5)} assume !(#t~post8 < 10);havoc #t~post8; {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {9581#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {9581#false} assume !(#t~post6 < 10);havoc #t~post6; {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L272 TraceCheckUtils]: 61: Hoare triple {9581#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)); {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {9581#false} ~cond := #in~cond; {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {9581#false} assume 0 == ~cond; {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {9581#false} assume !false; {9581#false} is VALID [2022-04-08 06:00:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:53,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:53,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {9581#false} assume !false; {9581#false} is VALID [2022-04-08 06:00:53,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {9581#false} assume 0 == ~cond; {9581#false} is VALID [2022-04-08 06:00:53,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {9581#false} ~cond := #in~cond; {9581#false} is VALID [2022-04-08 06:00:53,418 INFO L272 TraceCheckUtils]: 61: Hoare triple {9581#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)); {9581#false} is VALID [2022-04-08 06:00:53,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {9581#false} assume !(#t~post6 < 10);havoc #t~post6; {9581#false} is VALID [2022-04-08 06:00:53,418 INFO L290 TraceCheckUtils]: 59: Hoare triple {9581#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9581#false} is VALID [2022-04-08 06:00:53,420 INFO L290 TraceCheckUtils]: 58: Hoare triple {9802#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {9581#false} is VALID [2022-04-08 06:00:53,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {9806#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9802#(< |main_#t~post8| 10)} is VALID [2022-04-08 06:00:53,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {9806#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9806#(< ~counter~0 10)} is VALID [2022-04-08 06:00:53,421 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9580#true} {9806#(< ~counter~0 10)} #98#return; {9806#(< ~counter~0 10)} is VALID [2022-04-08 06:00:53,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,422 INFO L290 TraceCheckUtils]: 52: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,422 INFO L272 TraceCheckUtils]: 51: Hoare triple {9806#(< ~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)); {9580#true} is VALID [2022-04-08 06:00:53,422 INFO L290 TraceCheckUtils]: 50: Hoare triple {9806#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {9806#(< ~counter~0 10)} is VALID [2022-04-08 06:00:53,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {9831#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9806#(< ~counter~0 10)} is VALID [2022-04-08 06:00:53,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {9831#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9831#(< ~counter~0 9)} is VALID [2022-04-08 06:00:53,423 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9580#true} {9831#(< ~counter~0 9)} #98#return; {9831#(< ~counter~0 9)} is VALID [2022-04-08 06:00:53,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,423 INFO L272 TraceCheckUtils]: 43: Hoare triple {9831#(< ~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)); {9580#true} is VALID [2022-04-08 06:00:53,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {9831#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {9831#(< ~counter~0 9)} is VALID [2022-04-08 06:00:53,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {9856#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9831#(< ~counter~0 9)} is VALID [2022-04-08 06:00:53,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {9856#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9856#(< ~counter~0 8)} is VALID [2022-04-08 06:00:53,425 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9580#true} {9856#(< ~counter~0 8)} #98#return; {9856#(< ~counter~0 8)} is VALID [2022-04-08 06:00:53,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,425 INFO L272 TraceCheckUtils]: 35: Hoare triple {9856#(< ~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)); {9580#true} is VALID [2022-04-08 06:00:53,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {9856#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {9856#(< ~counter~0 8)} is VALID [2022-04-08 06:00:53,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {9881#(< ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9856#(< ~counter~0 8)} is VALID [2022-04-08 06:00:53,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {9881#(< ~counter~0 7)} assume !(~r~0 > 0); {9881#(< ~counter~0 7)} is VALID [2022-04-08 06:00:53,427 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9580#true} {9881#(< ~counter~0 7)} #96#return; {9881#(< ~counter~0 7)} is VALID [2022-04-08 06:00:53,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,427 INFO L272 TraceCheckUtils]: 27: Hoare triple {9881#(< ~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)); {9580#true} is VALID [2022-04-08 06:00:53,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {9881#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {9881#(< ~counter~0 7)} is VALID [2022-04-08 06:00:53,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {9737#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9881#(< ~counter~0 7)} is VALID [2022-04-08 06:00:53,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {9737#(<= ~counter~0 5)} assume !!(0 != ~r~0); {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,428 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9580#true} {9737#(<= ~counter~0 5)} #94#return; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,429 INFO L272 TraceCheckUtils]: 19: Hoare triple {9737#(<= ~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)); {9580#true} is VALID [2022-04-08 06:00:53,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {9737#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {9712#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9737#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:53,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {9712#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9580#true} {9712#(<= ~counter~0 4)} #92#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,430 INFO L272 TraceCheckUtils]: 11: Hoare triple {9712#(<= ~counter~0 4)} 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)); {9580#true} is VALID [2022-04-08 06:00:53,431 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9580#true} {9712#(<= ~counter~0 4)} #90#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-08 06:00:53,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-08 06:00:53,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-08 06:00:53,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {9712#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9580#true} is VALID [2022-04-08 06:00:53,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {9712#(<= ~counter~0 4)} 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; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {9712#(<= ~counter~0 4)} call #t~ret9 := main(); {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9712#(<= ~counter~0 4)} {9580#true} #102#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {9712#(<= ~counter~0 4)} assume true; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {9580#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; {9712#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:53,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {9580#true} call ULTIMATE.init(); {9580#true} is VALID [2022-04-08 06:00:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 06:00:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:53,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440815699] [2022-04-08 06:00:53,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470226618] [2022-04-08 06:00:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470226618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:53,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 06:00:53,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590881519] [2022-04-08 06:00:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590881519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:53,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:00:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749396210] [2022-04-08 06:00:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:53,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-08 06:00:53,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:53,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:53,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:53,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:00:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:00:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:53,481 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:53,936 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-08 06:00:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 06:00:53,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-08 06:00:53,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 06:00:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-08 06:00:53,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-08 06:00:54,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:54,046 INFO L225 Difference]: With dead ends: 149 [2022-04-08 06:00:54,046 INFO L226 Difference]: Without dead ends: 112 [2022-04-08 06:00:54,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-08 06:00:54,047 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:54,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-08 06:00:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-08 06:00:54,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:54,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:54,157 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:54,157 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:54,160 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 06:00:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 06:00:54,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:54,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:54,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 06:00:54,161 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-08 06:00:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:54,163 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-08 06:00:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-08 06:00:54,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:54,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:54,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:54,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-08 06:00:54,168 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-08 06:00:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:54,168 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-08 06:00:54,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:54,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-08 06:00:55,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-08 06:00:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 06:00:55,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:55,949 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:00:55,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 06:00:56,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 06:00:56,150 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:00:56,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:00:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-08 06:00:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:56,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12938057] [2022-04-08 06:00:56,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:00:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-08 06:00:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:00:56,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723894038] [2022-04-08 06:00:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:00:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:00:56,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:00:56,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525493076] [2022-04-08 06:00:56,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:00:56,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:00:56,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:00:56,164 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:00:56,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 06:00:56,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:00:56,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:00:56,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 06:00:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:00:56,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:00:56,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-08 06:00:56,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#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; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#(<= ~counter~0 0)} {10729#true} #102#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#(<= ~counter~0 0)} call #t~ret9 := main(); {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#(<= ~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; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(<= ~counter~0 0)} ~cond := #in~cond; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#(<= ~counter~0 0)} assume !(0 == ~cond); {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#(<= ~counter~0 0)} {10737#(<= ~counter~0 0)} #90#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,619 INFO L272 TraceCheckUtils]: 11: Hoare triple {10737#(<= ~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)); {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {10737#(<= ~counter~0 0)} ~cond := #in~cond; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {10737#(<= ~counter~0 0)} assume !(0 == ~cond); {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10737#(<= ~counter~0 0)} {10737#(<= ~counter~0 0)} #92#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10737#(<= ~counter~0 0)} is VALID [2022-04-08 06:00:56,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {10737#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {10786#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,622 INFO L272 TraceCheckUtils]: 19: Hoare triple {10786#(<= ~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)); {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {10786#(<= ~counter~0 1)} ~cond := #in~cond; {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {10786#(<= ~counter~0 1)} assume !(0 == ~cond); {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {10786#(<= ~counter~0 1)} assume true; {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,623 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10786#(<= ~counter~0 1)} {10786#(<= ~counter~0 1)} #94#return; {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {10786#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10786#(<= ~counter~0 1)} is VALID [2022-04-08 06:00:56,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {10786#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {10811#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,625 INFO L272 TraceCheckUtils]: 27: Hoare triple {10811#(<= ~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)); {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {10811#(<= ~counter~0 2)} ~cond := #in~cond; {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {10811#(<= ~counter~0 2)} assume !(0 == ~cond); {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {10811#(<= ~counter~0 2)} assume true; {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,626 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10811#(<= ~counter~0 2)} {10811#(<= ~counter~0 2)} #96#return; {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {10811#(<= ~counter~0 2)} assume !(~r~0 > 0); {10811#(<= ~counter~0 2)} is VALID [2022-04-08 06:00:56,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {10811#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {10836#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,628 INFO L272 TraceCheckUtils]: 35: Hoare triple {10836#(<= ~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)); {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {10836#(<= ~counter~0 3)} ~cond := #in~cond; {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {10836#(<= ~counter~0 3)} assume !(0 == ~cond); {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {10836#(<= ~counter~0 3)} assume true; {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,633 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10836#(<= ~counter~0 3)} {10836#(<= ~counter~0 3)} #98#return; {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {10836#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10836#(<= ~counter~0 3)} is VALID [2022-04-08 06:00:56,634 INFO L290 TraceCheckUtils]: 41: Hoare triple {10836#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {10861#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,635 INFO L272 TraceCheckUtils]: 43: Hoare triple {10861#(<= ~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)); {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {10861#(<= ~counter~0 4)} ~cond := #in~cond; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {10861#(<= ~counter~0 4)} assume !(0 == ~cond); {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {10861#(<= ~counter~0 4)} assume true; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,636 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10861#(<= ~counter~0 4)} {10861#(<= ~counter~0 4)} #98#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {10861#(<= ~counter~0 4)} assume !(~r~0 < 0); {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:56,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {10861#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {10886#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,638 INFO L272 TraceCheckUtils]: 51: Hoare triple {10886#(<= ~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)); {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {10886#(<= ~counter~0 5)} ~cond := #in~cond; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {10886#(<= ~counter~0 5)} assume !(0 == ~cond); {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {10886#(<= ~counter~0 5)} assume true; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,639 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10886#(<= ~counter~0 5)} {10886#(<= ~counter~0 5)} #94#return; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,640 INFO L290 TraceCheckUtils]: 56: Hoare triple {10886#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:56,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {10886#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10911#(<= |main_#t~post7| 5)} is VALID [2022-04-08 06:00:56,640 INFO L290 TraceCheckUtils]: 58: Hoare triple {10911#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {10730#false} is VALID [2022-04-08 06:00:56,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10730#false} is VALID [2022-04-08 06:00:56,640 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !(#t~post8 < 10);havoc #t~post8; {10730#false} is VALID [2022-04-08 06:00:56,640 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10730#false} is VALID [2022-04-08 06:00:56,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} assume !(#t~post6 < 10);havoc #t~post6; {10730#false} is VALID [2022-04-08 06:00:56,641 INFO L272 TraceCheckUtils]: 63: Hoare triple {10730#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)); {10730#false} is VALID [2022-04-08 06:00:56,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-08 06:00:56,641 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-08 06:00:56,641 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-08 06:00:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:00:56,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:00:57,005 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-08 06:00:57,005 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-08 06:00:57,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-08 06:00:57,005 INFO L272 TraceCheckUtils]: 63: Hoare triple {10730#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)); {10730#false} is VALID [2022-04-08 06:00:57,005 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} assume !(#t~post6 < 10);havoc #t~post6; {10730#false} is VALID [2022-04-08 06:00:57,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10730#false} is VALID [2022-04-08 06:00:57,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !(#t~post8 < 10);havoc #t~post8; {10730#false} is VALID [2022-04-08 06:00:57,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10730#false} is VALID [2022-04-08 06:00:57,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {10963#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {10730#false} is VALID [2022-04-08 06:00:57,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {10967#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10963#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:00:57,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {10967#(< ~counter~0 10)} assume !!(0 != ~r~0); {10967#(< ~counter~0 10)} is VALID [2022-04-08 06:00:57,007 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10729#true} {10967#(< ~counter~0 10)} #94#return; {10967#(< ~counter~0 10)} is VALID [2022-04-08 06:00:57,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,007 INFO L290 TraceCheckUtils]: 53: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,007 INFO L272 TraceCheckUtils]: 51: Hoare triple {10967#(< ~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)); {10729#true} is VALID [2022-04-08 06:00:57,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {10967#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {10967#(< ~counter~0 10)} is VALID [2022-04-08 06:00:57,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {10992#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10967#(< ~counter~0 10)} is VALID [2022-04-08 06:00:57,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {10992#(< ~counter~0 9)} assume !(~r~0 < 0); {10992#(< ~counter~0 9)} is VALID [2022-04-08 06:00:57,009 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10729#true} {10992#(< ~counter~0 9)} #98#return; {10992#(< ~counter~0 9)} is VALID [2022-04-08 06:00:57,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,009 INFO L272 TraceCheckUtils]: 43: Hoare triple {10992#(< ~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)); {10729#true} is VALID [2022-04-08 06:00:57,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {10992#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {10992#(< ~counter~0 9)} is VALID [2022-04-08 06:00:57,010 INFO L290 TraceCheckUtils]: 41: Hoare triple {11017#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10992#(< ~counter~0 9)} is VALID [2022-04-08 06:00:57,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {11017#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11017#(< ~counter~0 8)} is VALID [2022-04-08 06:00:57,011 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10729#true} {11017#(< ~counter~0 8)} #98#return; {11017#(< ~counter~0 8)} is VALID [2022-04-08 06:00:57,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {11017#(< ~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)); {10729#true} is VALID [2022-04-08 06:00:57,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {11017#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {11017#(< ~counter~0 8)} is VALID [2022-04-08 06:00:57,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {11042#(< ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11017#(< ~counter~0 8)} is VALID [2022-04-08 06:00:57,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {11042#(< ~counter~0 7)} assume !(~r~0 > 0); {11042#(< ~counter~0 7)} is VALID [2022-04-08 06:00:57,013 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10729#true} {11042#(< ~counter~0 7)} #96#return; {11042#(< ~counter~0 7)} is VALID [2022-04-08 06:00:57,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,013 INFO L272 TraceCheckUtils]: 27: Hoare triple {11042#(< ~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)); {10729#true} is VALID [2022-04-08 06:00:57,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {11042#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {11042#(< ~counter~0 7)} is VALID [2022-04-08 06:00:57,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {10886#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11042#(< ~counter~0 7)} is VALID [2022-04-08 06:00:57,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {10886#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:57,014 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10729#true} {10886#(<= ~counter~0 5)} #94#return; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:57,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {10886#(<= ~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)); {10729#true} is VALID [2022-04-08 06:00:57,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {10886#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:57,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {10861#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-08 06:00:57,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {10861#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10729#true} {10861#(<= ~counter~0 4)} #92#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {10861#(<= ~counter~0 4)} 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)); {10729#true} is VALID [2022-04-08 06:00:57,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10729#true} {10861#(<= ~counter~0 4)} #90#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-08 06:00:57,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-08 06:00:57,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-08 06:00:57,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {10861#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10729#true} is VALID [2022-04-08 06:00:57,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {10861#(<= ~counter~0 4)} 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; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {10861#(<= ~counter~0 4)} call #t~ret9 := main(); {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10861#(<= ~counter~0 4)} {10729#true} #102#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {10861#(<= ~counter~0 4)} assume true; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#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; {10861#(<= ~counter~0 4)} is VALID [2022-04-08 06:00:57,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-08 06:00:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 06:00:57,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:00:57,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723894038] [2022-04-08 06:00:57,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:00:57,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525493076] [2022-04-08 06:00:57,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525493076] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:00:57,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:00:57,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 06:00:57,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:00:57,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12938057] [2022-04-08 06:00:57,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12938057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:00:57,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:00:57,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 06:00:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045387202] [2022-04-08 06:00:57,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:00:57,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-08 06:00:57,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:00:57,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:57,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:57,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 06:00:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:00:57,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 06:00:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:00:57,065 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:57,463 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-08 06:00:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:00:57,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-08 06:00:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:00:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 06:00:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-08 06:00:57,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-08 06:00:57,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:57,603 INFO L225 Difference]: With dead ends: 151 [2022-04-08 06:00:57,603 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 06:00:57,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=187, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:00:57,604 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:00:57,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 151 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:00:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 06:00:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-08 06:00:57,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:00:57,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:57,723 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:57,723 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:57,728 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 06:00:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:00:57,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:57,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:57,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 06:00:57,729 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-08 06:00:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:00:57,732 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-08 06:00:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:00:57,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:00:57,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:00:57,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:00:57,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:00:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 06:00:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-08 06:00:57,736 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-08 06:00:57,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:00:57,737 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-08 06:00:57,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-08 06:00:57,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-08 06:00:59,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 139 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:00:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-08 06:00:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-08 06:00:59,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:00:59,951 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 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] [2022-04-08 06:00:59,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:00,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 06:01:00,175 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-08 06:01:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:00,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342092018] [2022-04-08 06:01:00,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-08 06:01:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:00,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011093706] [2022-04-08 06:01:00,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:00,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:00,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:00,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205646444] [2022-04-08 06:01:00,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:01:00,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:00,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:00,188 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:00,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 06:01:00,269 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 06:01:00,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:00,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:01:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:00,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:00,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {11910#true} call ULTIMATE.init(); {11910#true} is VALID [2022-04-08 06:01:00,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {11910#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; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11918#(<= ~counter~0 0)} {11910#true} #102#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {11918#(<= ~counter~0 0)} call #t~ret9 := main(); {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {11918#(<= ~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; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {11918#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {11918#(<= ~counter~0 0)} ~cond := #in~cond; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {11918#(<= ~counter~0 0)} assume !(0 == ~cond); {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11918#(<= ~counter~0 0)} {11918#(<= ~counter~0 0)} #90#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {11918#(<= ~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)); {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {11918#(<= ~counter~0 0)} ~cond := #in~cond; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {11918#(<= ~counter~0 0)} assume !(0 == ~cond); {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,647 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11918#(<= ~counter~0 0)} {11918#(<= ~counter~0 0)} #92#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {11918#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11918#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:00,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {11918#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {11967#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,649 INFO L272 TraceCheckUtils]: 19: Hoare triple {11967#(<= ~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)); {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {11967#(<= ~counter~0 1)} ~cond := #in~cond; {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {11967#(<= ~counter~0 1)} assume !(0 == ~cond); {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {11967#(<= ~counter~0 1)} assume true; {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,650 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11967#(<= ~counter~0 1)} {11967#(<= ~counter~0 1)} #94#return; {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {11967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11967#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:00,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {11967#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {11992#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,651 INFO L272 TraceCheckUtils]: 27: Hoare triple {11992#(<= ~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)); {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {11992#(<= ~counter~0 2)} ~cond := #in~cond; {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {11992#(<= ~counter~0 2)} assume !(0 == ~cond); {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {11992#(<= ~counter~0 2)} assume true; {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,657 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11992#(<= ~counter~0 2)} {11992#(<= ~counter~0 2)} #96#return; {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {11992#(<= ~counter~0 2)} assume !(~r~0 > 0); {11992#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:00,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {11992#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {12017#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,659 INFO L272 TraceCheckUtils]: 35: Hoare triple {12017#(<= ~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)); {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {12017#(<= ~counter~0 3)} ~cond := #in~cond; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {12017#(<= ~counter~0 3)} assume !(0 == ~cond); {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {12017#(<= ~counter~0 3)} assume true; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,661 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12017#(<= ~counter~0 3)} {12017#(<= ~counter~0 3)} #98#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {12017#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:00,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {12017#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {12042#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,663 INFO L272 TraceCheckUtils]: 43: Hoare triple {12042#(<= ~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)); {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {12042#(<= ~counter~0 4)} ~cond := #in~cond; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {12042#(<= ~counter~0 4)} assume !(0 == ~cond); {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {12042#(<= ~counter~0 4)} assume true; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,665 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12042#(<= ~counter~0 4)} {12042#(<= ~counter~0 4)} #98#return; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {12042#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:00,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {12042#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {12067#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,667 INFO L272 TraceCheckUtils]: 51: Hoare triple {12067#(<= ~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)); {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {12067#(<= ~counter~0 5)} ~cond := #in~cond; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,668 INFO L290 TraceCheckUtils]: 53: Hoare triple {12067#(<= ~counter~0 5)} assume !(0 == ~cond); {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,668 INFO L290 TraceCheckUtils]: 54: Hoare triple {12067#(<= ~counter~0 5)} assume true; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,669 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12067#(<= ~counter~0 5)} {12067#(<= ~counter~0 5)} #98#return; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,669 INFO L290 TraceCheckUtils]: 56: Hoare triple {12067#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:00,670 INFO L290 TraceCheckUtils]: 57: Hoare triple {12067#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,670 INFO L290 TraceCheckUtils]: 58: Hoare triple {12092#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,671 INFO L272 TraceCheckUtils]: 59: Hoare triple {12092#(<= ~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)); {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,671 INFO L290 TraceCheckUtils]: 60: Hoare triple {12092#(<= ~counter~0 6)} ~cond := #in~cond; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {12092#(<= ~counter~0 6)} assume !(0 == ~cond); {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {12092#(<= ~counter~0 6)} assume true; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,672 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12092#(<= ~counter~0 6)} {12092#(<= ~counter~0 6)} #98#return; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,672 INFO L290 TraceCheckUtils]: 64: Hoare triple {12092#(<= ~counter~0 6)} assume !(~r~0 < 0); {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:00,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {12092#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12117#(<= |main_#t~post6| 6)} is VALID [2022-04-08 06:01:00,673 INFO L290 TraceCheckUtils]: 66: Hoare triple {12117#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {11911#false} is VALID [2022-04-08 06:01:00,673 INFO L272 TraceCheckUtils]: 67: Hoare triple {11911#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)); {11911#false} is VALID [2022-04-08 06:01:00,673 INFO L290 TraceCheckUtils]: 68: Hoare triple {11911#false} ~cond := #in~cond; {11911#false} is VALID [2022-04-08 06:01:00,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {11911#false} assume 0 == ~cond; {11911#false} is VALID [2022-04-08 06:01:00,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-04-08 06:01:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:00,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:01,055 INFO L290 TraceCheckUtils]: 70: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-04-08 06:01:01,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {11911#false} assume 0 == ~cond; {11911#false} is VALID [2022-04-08 06:01:01,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {11911#false} ~cond := #in~cond; {11911#false} is VALID [2022-04-08 06:01:01,056 INFO L272 TraceCheckUtils]: 67: Hoare triple {11911#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)); {11911#false} is VALID [2022-04-08 06:01:01,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {12145#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {11911#false} is VALID [2022-04-08 06:01:01,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {12149#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12145#(< |main_#t~post6| 10)} is VALID [2022-04-08 06:01:01,057 INFO L290 TraceCheckUtils]: 64: Hoare triple {12149#(< ~counter~0 10)} assume !(~r~0 < 0); {12149#(< ~counter~0 10)} is VALID [2022-04-08 06:01:01,057 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11910#true} {12149#(< ~counter~0 10)} #98#return; {12149#(< ~counter~0 10)} is VALID [2022-04-08 06:01:01,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,057 INFO L272 TraceCheckUtils]: 59: Hoare triple {12149#(< ~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)); {11910#true} is VALID [2022-04-08 06:01:01,058 INFO L290 TraceCheckUtils]: 58: Hoare triple {12149#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {12149#(< ~counter~0 10)} is VALID [2022-04-08 06:01:01,058 INFO L290 TraceCheckUtils]: 57: Hoare triple {12174#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12149#(< ~counter~0 10)} is VALID [2022-04-08 06:01:01,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {12174#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12174#(< ~counter~0 9)} is VALID [2022-04-08 06:01:01,059 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11910#true} {12174#(< ~counter~0 9)} #98#return; {12174#(< ~counter~0 9)} is VALID [2022-04-08 06:01:01,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,059 INFO L272 TraceCheckUtils]: 51: Hoare triple {12174#(< ~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)); {11910#true} is VALID [2022-04-08 06:01:01,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {12174#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {12174#(< ~counter~0 9)} is VALID [2022-04-08 06:01:01,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {12199#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12174#(< ~counter~0 9)} is VALID [2022-04-08 06:01:01,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {12199#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12199#(< ~counter~0 8)} is VALID [2022-04-08 06:01:01,061 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11910#true} {12199#(< ~counter~0 8)} #98#return; {12199#(< ~counter~0 8)} is VALID [2022-04-08 06:01:01,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,061 INFO L272 TraceCheckUtils]: 43: Hoare triple {12199#(< ~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)); {11910#true} is VALID [2022-04-08 06:01:01,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {12199#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {12199#(< ~counter~0 8)} is VALID [2022-04-08 06:01:01,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {12092#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12199#(< ~counter~0 8)} is VALID [2022-04-08 06:01:01,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {12092#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:01,063 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11910#true} {12092#(<= ~counter~0 6)} #98#return; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:01,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,063 INFO L272 TraceCheckUtils]: 35: Hoare triple {12092#(<= ~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)); {11910#true} is VALID [2022-04-08 06:01:01,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {12092#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:01,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {12067#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:01,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {12067#(<= ~counter~0 5)} assume !(~r~0 > 0); {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:01,077 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11910#true} {12067#(<= ~counter~0 5)} #96#return; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:01,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,078 INFO L272 TraceCheckUtils]: 27: Hoare triple {12067#(<= ~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)); {11910#true} is VALID [2022-04-08 06:01:01,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {12067#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:01,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {12042#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12067#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:01,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {12042#(<= ~counter~0 4)} assume !!(0 != ~r~0); {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:01,079 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11910#true} {12042#(<= ~counter~0 4)} #94#return; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:01,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,080 INFO L272 TraceCheckUtils]: 19: Hoare triple {12042#(<= ~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)); {11910#true} is VALID [2022-04-08 06:01:01,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {12042#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:01,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {12017#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12042#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:01,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {12017#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,081 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11910#true} {12017#(<= ~counter~0 3)} #92#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,081 INFO L272 TraceCheckUtils]: 11: Hoare triple {12017#(<= ~counter~0 3)} 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)); {11910#true} is VALID [2022-04-08 06:01:01,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11910#true} {12017#(<= ~counter~0 3)} #90#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-08 06:01:01,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-08 06:01:01,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-08 06:01:01,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {12017#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11910#true} is VALID [2022-04-08 06:01:01,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {12017#(<= ~counter~0 3)} 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; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {12017#(<= ~counter~0 3)} call #t~ret9 := main(); {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12017#(<= ~counter~0 3)} {11910#true} #102#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {12017#(<= ~counter~0 3)} assume true; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {11910#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; {12017#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:01,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {11910#true} call ULTIMATE.init(); {11910#true} is VALID [2022-04-08 06:01:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 06:01:01,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011093706] [2022-04-08 06:01:01,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205646444] [2022-04-08 06:01:01,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205646444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:01,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:01,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 06:01:01,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:01,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342092018] [2022-04-08 06:01:01,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342092018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:01,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:01,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:01:01,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896605738] [2022-04-08 06:01:01,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-08 06:01:01,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:01,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:01,132 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-08 06:01:01,132 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:01:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:01:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:01,133 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:01,589 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-08 06:01:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 06:01:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-08 06:01:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 06:01:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-08 06:01:01,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-08 06:01:01,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:01,715 INFO L225 Difference]: With dead ends: 137 [2022-04-08 06:01:01,715 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 06:01:01,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-08 06:01:01,716 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:01,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 06:01:01,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-08 06:01:01,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:01,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:01:01,851 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:01:01,851 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:01:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:01,854 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 06:01:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 06:01:01,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:01,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:01,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 06:01:01,855 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-08 06:01:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:01,859 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-08 06:01:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-08 06:01:01,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:01,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:01,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:01,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 06:01:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-08 06:01:01,863 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-08 06:01:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:01,863 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-08 06:01:01,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:01,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-08 06:01:04,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 154 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:04,108 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-08 06:01:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:01:04,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:04,109 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2022-04-08 06:01:04,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:04,331 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 06:01:04,331 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-08 06:01:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:04,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [887117706] [2022-04-08 06:01:04,332 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-08 06:01:04,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:04,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172650872] [2022-04-08 06:01:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:04,342 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:04,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499392742] [2022-04-08 06:01:04,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:04,344 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:04,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 06:01:04,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:04,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:04,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:01:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:04,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:04,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {13143#true} call ULTIMATE.init(); {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {13143#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; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13143#true} {13143#true} #102#return; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {13143#true} call #t~ret9 := main(); {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {13143#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; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {13143#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13143#true} {13143#true} #90#return; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L272 TraceCheckUtils]: 11: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13143#true} {13143#true} #92#return; {13143#true} is VALID [2022-04-08 06:01:04,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {13143#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {13143#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {13143#true} assume !!(#t~post6 < 10);havoc #t~post6; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L272 TraceCheckUtils]: 19: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13143#true} {13143#true} #94#return; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {13143#true} assume !!(0 != ~r~0); {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {13143#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {13143#true} assume !!(#t~post7 < 10);havoc #t~post7; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L272 TraceCheckUtils]: 27: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13143#true} {13143#true} #96#return; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {13143#true} assume !(~r~0 > 0); {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {13143#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13143#true} is VALID [2022-04-08 06:01:04,599 INFO L290 TraceCheckUtils]: 34: Hoare triple {13143#true} assume !!(#t~post8 < 10);havoc #t~post8; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L272 TraceCheckUtils]: 35: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13143#true} {13143#true} #98#return; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {13143#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {13143#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {13143#true} assume !!(#t~post8 < 10);havoc #t~post8; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L272 TraceCheckUtils]: 43: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 44: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,600 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13143#true} {13143#true} #98#return; {13143#true} is VALID [2022-04-08 06:01:04,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {13143#true} assume !(~r~0 < 0); {13292#(not (< main_~r~0 0))} is VALID [2022-04-08 06:01:04,612 INFO L290 TraceCheckUtils]: 49: Hoare triple {13292#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13292#(not (< main_~r~0 0))} is VALID [2022-04-08 06:01:04,612 INFO L290 TraceCheckUtils]: 50: Hoare triple {13292#(not (< main_~r~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {13292#(not (< main_~r~0 0))} is VALID [2022-04-08 06:01:04,612 INFO L272 TraceCheckUtils]: 51: Hoare triple {13292#(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)); {13143#true} is VALID [2022-04-08 06:01:04,612 INFO L290 TraceCheckUtils]: 52: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,612 INFO L290 TraceCheckUtils]: 54: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,613 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13143#true} {13292#(not (< main_~r~0 0))} #94#return; {13292#(not (< main_~r~0 0))} is VALID [2022-04-08 06:01:04,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {13292#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:04,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:04,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 10);havoc #t~post7; {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:04,614 INFO L272 TraceCheckUtils]: 59: Hoare triple {13317#(and (not (= main_~r~0 0)) (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)); {13143#true} is VALID [2022-04-08 06:01:04,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-08 06:01:04,615 INFO L290 TraceCheckUtils]: 61: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-08 06:01:04,615 INFO L290 TraceCheckUtils]: 62: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-08 06:01:04,615 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13143#true} {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 64: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 65: Hoare triple {13144#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 66: Hoare triple {13144#false} assume !(#t~post8 < 10);havoc #t~post8; {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 67: Hoare triple {13144#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 68: Hoare triple {13144#false} assume !(#t~post6 < 10);havoc #t~post6; {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L272 TraceCheckUtils]: 69: Hoare triple {13144#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)); {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 70: Hoare triple {13144#false} ~cond := #in~cond; {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 71: Hoare triple {13144#false} assume 0 == ~cond; {13144#false} is VALID [2022-04-08 06:01:04,616 INFO L290 TraceCheckUtils]: 72: Hoare triple {13144#false} assume !false; {13144#false} is VALID [2022-04-08 06:01:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-08 06:01:04,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:01:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172650872] [2022-04-08 06:01:04,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499392742] [2022-04-08 06:01:04,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499392742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:04,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:04,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:04,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:04,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [887117706] [2022-04-08 06:01:04,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [887117706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:04,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:04,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644382255] [2022-04-08 06:01:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-08 06:01:04,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:04,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:04,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:04,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:01:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:01:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:01:04,654 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:04,892 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-08 06:01:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:01:04,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-08 06:01:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:01:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:01:04,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 06:01:04,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:04,967 INFO L225 Difference]: With dead ends: 180 [2022-04-08 06:01:04,967 INFO L226 Difference]: Without dead ends: 143 [2022-04-08 06:01:04,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-08 06:01:04,968 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:04,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-08 06:01:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-08 06:01:05,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:05,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:05,119 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:05,119 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:05,122 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 06:01:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 06:01:05,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:05,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:05,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 06:01:05,123 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-08 06:01:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:05,126 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-08 06:01:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-08 06:01:05,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:05,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:05,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:05,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-08 06:01:05,130 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-08 06:01:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:05,131 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-08 06:01:05,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:05,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-08 06:01:07,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-08 06:01:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 06:01:07,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:07,443 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 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-08 06:01:07,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:07,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 06:01:07,651 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:07,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-08 06:01:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:07,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796782698] [2022-04-08 06:01:07,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:07,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-08 06:01:07,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:07,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651425192] [2022-04-08 06:01:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:07,664 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:07,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84205160] [2022-04-08 06:01:07,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:07,665 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:07,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 06:01:07,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:07,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:07,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:01:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:07,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:08,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {14285#true} call ULTIMATE.init(); {14285#true} is VALID [2022-04-08 06:01:08,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {14285#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; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14293#(<= ~counter~0 0)} {14285#true} #102#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {14293#(<= ~counter~0 0)} call #t~ret9 := main(); {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {14293#(<= ~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; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {14293#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {14293#(<= ~counter~0 0)} ~cond := #in~cond; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {14293#(<= ~counter~0 0)} assume !(0 == ~cond); {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14293#(<= ~counter~0 0)} {14293#(<= ~counter~0 0)} #90#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {14293#(<= ~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)); {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {14293#(<= ~counter~0 0)} ~cond := #in~cond; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {14293#(<= ~counter~0 0)} assume !(0 == ~cond); {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,069 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14293#(<= ~counter~0 0)} {14293#(<= ~counter~0 0)} #92#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {14293#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14293#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:08,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {14293#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {14342#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,071 INFO L272 TraceCheckUtils]: 19: Hoare triple {14342#(<= ~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)); {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {14342#(<= ~counter~0 1)} ~cond := #in~cond; {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {14342#(<= ~counter~0 1)} assume !(0 == ~cond); {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {14342#(<= ~counter~0 1)} assume true; {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,072 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14342#(<= ~counter~0 1)} {14342#(<= ~counter~0 1)} #94#return; {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {14342#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14342#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:08,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {14342#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {14367#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,074 INFO L272 TraceCheckUtils]: 27: Hoare triple {14367#(<= ~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)); {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {14367#(<= ~counter~0 2)} ~cond := #in~cond; {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {14367#(<= ~counter~0 2)} assume !(0 == ~cond); {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {14367#(<= ~counter~0 2)} assume true; {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,075 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14367#(<= ~counter~0 2)} {14367#(<= ~counter~0 2)} #96#return; {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {14367#(<= ~counter~0 2)} assume !(~r~0 > 0); {14367#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:08,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {14367#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {14392#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,077 INFO L272 TraceCheckUtils]: 35: Hoare triple {14392#(<= ~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)); {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {14392#(<= ~counter~0 3)} ~cond := #in~cond; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {14392#(<= ~counter~0 3)} assume !(0 == ~cond); {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {14392#(<= ~counter~0 3)} assume true; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,078 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14392#(<= ~counter~0 3)} {14392#(<= ~counter~0 3)} #98#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {14392#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {14392#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {14417#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,079 INFO L272 TraceCheckUtils]: 43: Hoare triple {14417#(<= ~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)); {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {14417#(<= ~counter~0 4)} ~cond := #in~cond; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {14417#(<= ~counter~0 4)} assume !(0 == ~cond); {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,081 INFO L290 TraceCheckUtils]: 46: Hoare triple {14417#(<= ~counter~0 4)} assume true; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,081 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14417#(<= ~counter~0 4)} {14417#(<= ~counter~0 4)} #98#return; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {14417#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,082 INFO L290 TraceCheckUtils]: 49: Hoare triple {14417#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,082 INFO L290 TraceCheckUtils]: 50: Hoare triple {14442#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,083 INFO L272 TraceCheckUtils]: 51: Hoare triple {14442#(<= ~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)); {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,083 INFO L290 TraceCheckUtils]: 52: Hoare triple {14442#(<= ~counter~0 5)} ~cond := #in~cond; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,083 INFO L290 TraceCheckUtils]: 53: Hoare triple {14442#(<= ~counter~0 5)} assume !(0 == ~cond); {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,083 INFO L290 TraceCheckUtils]: 54: Hoare triple {14442#(<= ~counter~0 5)} assume true; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,084 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14442#(<= ~counter~0 5)} {14442#(<= ~counter~0 5)} #98#return; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {14442#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,085 INFO L290 TraceCheckUtils]: 57: Hoare triple {14442#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,085 INFO L290 TraceCheckUtils]: 58: Hoare triple {14467#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,085 INFO L272 TraceCheckUtils]: 59: Hoare triple {14467#(<= ~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)); {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {14467#(<= ~counter~0 6)} ~cond := #in~cond; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {14467#(<= ~counter~0 6)} assume !(0 == ~cond); {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {14467#(<= ~counter~0 6)} assume true; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,087 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14467#(<= ~counter~0 6)} {14467#(<= ~counter~0 6)} #98#return; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,087 INFO L290 TraceCheckUtils]: 64: Hoare triple {14467#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,087 INFO L290 TraceCheckUtils]: 65: Hoare triple {14467#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14492#(<= |main_#t~post8| 6)} is VALID [2022-04-08 06:01:08,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {14492#(<= |main_#t~post8| 6)} assume !(#t~post8 < 10);havoc #t~post8; {14286#false} is VALID [2022-04-08 06:01:08,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {14286#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14286#false} is VALID [2022-04-08 06:01:08,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {14286#false} assume !(#t~post6 < 10);havoc #t~post6; {14286#false} is VALID [2022-04-08 06:01:08,091 INFO L272 TraceCheckUtils]: 69: Hoare triple {14286#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)); {14286#false} is VALID [2022-04-08 06:01:08,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {14286#false} ~cond := #in~cond; {14286#false} is VALID [2022-04-08 06:01:08,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {14286#false} assume 0 == ~cond; {14286#false} is VALID [2022-04-08 06:01:08,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {14286#false} assume !false; {14286#false} is VALID [2022-04-08 06:01:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:08,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:08,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {14286#false} assume !false; {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {14286#false} assume 0 == ~cond; {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {14286#false} ~cond := #in~cond; {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L272 TraceCheckUtils]: 69: Hoare triple {14286#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)); {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {14286#false} assume !(#t~post6 < 10);havoc #t~post6; {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L290 TraceCheckUtils]: 67: Hoare triple {14286#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {14532#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {14286#false} is VALID [2022-04-08 06:01:08,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {14536#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14532#(< |main_#t~post8| 10)} is VALID [2022-04-08 06:01:08,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {14536#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14536#(< ~counter~0 10)} is VALID [2022-04-08 06:01:08,428 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14285#true} {14536#(< ~counter~0 10)} #98#return; {14536#(< ~counter~0 10)} is VALID [2022-04-08 06:01:08,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,428 INFO L272 TraceCheckUtils]: 59: Hoare triple {14536#(< ~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)); {14285#true} is VALID [2022-04-08 06:01:08,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {14536#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {14536#(< ~counter~0 10)} is VALID [2022-04-08 06:01:08,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {14561#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14536#(< ~counter~0 10)} is VALID [2022-04-08 06:01:08,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {14561#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14561#(< ~counter~0 9)} is VALID [2022-04-08 06:01:08,430 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14285#true} {14561#(< ~counter~0 9)} #98#return; {14561#(< ~counter~0 9)} is VALID [2022-04-08 06:01:08,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,430 INFO L272 TraceCheckUtils]: 51: Hoare triple {14561#(< ~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)); {14285#true} is VALID [2022-04-08 06:01:08,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {14561#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {14561#(< ~counter~0 9)} is VALID [2022-04-08 06:01:08,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {14586#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14561#(< ~counter~0 9)} is VALID [2022-04-08 06:01:08,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {14586#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14586#(< ~counter~0 8)} is VALID [2022-04-08 06:01:08,432 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14285#true} {14586#(< ~counter~0 8)} #98#return; {14586#(< ~counter~0 8)} is VALID [2022-04-08 06:01:08,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,432 INFO L272 TraceCheckUtils]: 43: Hoare triple {14586#(< ~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)); {14285#true} is VALID [2022-04-08 06:01:08,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {14586#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {14586#(< ~counter~0 8)} is VALID [2022-04-08 06:01:08,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {14467#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14586#(< ~counter~0 8)} is VALID [2022-04-08 06:01:08,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {14467#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,433 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14285#true} {14467#(<= ~counter~0 6)} #98#return; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,434 INFO L272 TraceCheckUtils]: 35: Hoare triple {14467#(<= ~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)); {14285#true} is VALID [2022-04-08 06:01:08,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {14467#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {14442#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:08,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {14442#(<= ~counter~0 5)} assume !(~r~0 > 0); {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,435 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14285#true} {14442#(<= ~counter~0 5)} #96#return; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,435 INFO L272 TraceCheckUtils]: 27: Hoare triple {14442#(<= ~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)); {14285#true} is VALID [2022-04-08 06:01:08,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {14442#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {14417#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14442#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:08,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {14417#(<= ~counter~0 4)} assume !!(0 != ~r~0); {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,437 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14285#true} {14417#(<= ~counter~0 4)} #94#return; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,437 INFO L272 TraceCheckUtils]: 19: Hoare triple {14417#(<= ~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)); {14285#true} is VALID [2022-04-08 06:01:08,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {14417#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {14392#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14417#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:08,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {14392#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,438 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14285#true} {14392#(<= ~counter~0 3)} #92#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {14392#(<= ~counter~0 3)} 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)); {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14285#true} {14392#(<= ~counter~0 3)} #90#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-08 06:01:08,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {14392#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14285#true} is VALID [2022-04-08 06:01:08,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {14392#(<= ~counter~0 3)} 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; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {14392#(<= ~counter~0 3)} call #t~ret9 := main(); {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14392#(<= ~counter~0 3)} {14285#true} #102#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {14392#(<= ~counter~0 3)} assume true; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {14285#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; {14392#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:08,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {14285#true} call ULTIMATE.init(); {14285#true} is VALID [2022-04-08 06:01:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 06:01:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:08,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651425192] [2022-04-08 06:01:08,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:08,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84205160] [2022-04-08 06:01:08,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84205160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:08,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:08,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 06:01:08,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:08,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796782698] [2022-04-08 06:01:08,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796782698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:08,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:08,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:01:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848223508] [2022-04-08 06:01:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:08,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-08 06:01:08,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:08,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:08,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:08,491 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:01:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:08,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:01:08,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:08,492 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:09,021 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-08 06:01:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 06:01:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-08 06:01:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 06:01:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-08 06:01:09,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-08 06:01:09,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:09,155 INFO L225 Difference]: With dead ends: 193 [2022-04-08 06:01:09,156 INFO L226 Difference]: Without dead ends: 144 [2022-04-08 06:01:09,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:01:09,156 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 57 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:09,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-08 06:01:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-08 06:01:09,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:09,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:09,330 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:09,330 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:09,333 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 06:01:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 06:01:09,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:09,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:09,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 06:01:09,335 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-08 06:01:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:09,337 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-08 06:01:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-08 06:01:09,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:09,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:09,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:09,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-08 06:01:09,341 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-08 06:01:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:09,341 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-08 06:01:09,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:09,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-08 06:01:11,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 176 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-08 06:01:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 06:01:11,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:11,631 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:11,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:11,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:11,835 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-08 06:01:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:11,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636693096] [2022-04-08 06:01:11,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:11,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-08 06:01:11,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:11,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420552968] [2022-04-08 06:01:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:11,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:11,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369851123] [2022-04-08 06:01:11,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:11,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:11,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:11,853 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:11,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 06:01:11,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:11,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:11,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:01:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:11,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:12,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {15698#true} call ULTIMATE.init(); {15698#true} is VALID [2022-04-08 06:01:12,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {15698#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; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15706#(<= ~counter~0 0)} {15698#true} #102#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {15706#(<= ~counter~0 0)} call #t~ret9 := main(); {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {15706#(<= ~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; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {15706#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {15706#(<= ~counter~0 0)} ~cond := #in~cond; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {15706#(<= ~counter~0 0)} assume !(0 == ~cond); {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15706#(<= ~counter~0 0)} {15706#(<= ~counter~0 0)} #90#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,299 INFO L272 TraceCheckUtils]: 11: Hoare triple {15706#(<= ~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)); {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {15706#(<= ~counter~0 0)} ~cond := #in~cond; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {15706#(<= ~counter~0 0)} assume !(0 == ~cond); {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,301 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15706#(<= ~counter~0 0)} {15706#(<= ~counter~0 0)} #92#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {15706#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15706#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:12,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {15706#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {15755#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,303 INFO L272 TraceCheckUtils]: 19: Hoare triple {15755#(<= ~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)); {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {15755#(<= ~counter~0 1)} ~cond := #in~cond; {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {15755#(<= ~counter~0 1)} assume !(0 == ~cond); {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {15755#(<= ~counter~0 1)} assume true; {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15755#(<= ~counter~0 1)} {15755#(<= ~counter~0 1)} #94#return; {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {15755#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15755#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:12,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {15755#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {15780#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,307 INFO L272 TraceCheckUtils]: 27: Hoare triple {15780#(<= ~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)); {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {15780#(<= ~counter~0 2)} ~cond := #in~cond; {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {15780#(<= ~counter~0 2)} assume !(0 == ~cond); {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {15780#(<= ~counter~0 2)} assume true; {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,308 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15780#(<= ~counter~0 2)} {15780#(<= ~counter~0 2)} #96#return; {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {15780#(<= ~counter~0 2)} assume !(~r~0 > 0); {15780#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:12,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {15780#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {15805#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,310 INFO L272 TraceCheckUtils]: 35: Hoare triple {15805#(<= ~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)); {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {15805#(<= ~counter~0 3)} ~cond := #in~cond; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {15805#(<= ~counter~0 3)} assume !(0 == ~cond); {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {15805#(<= ~counter~0 3)} assume true; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,312 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15805#(<= ~counter~0 3)} {15805#(<= ~counter~0 3)} #98#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {15805#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {15805#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {15830#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,314 INFO L272 TraceCheckUtils]: 43: Hoare triple {15830#(<= ~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)); {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {15830#(<= ~counter~0 4)} ~cond := #in~cond; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {15830#(<= ~counter~0 4)} assume !(0 == ~cond); {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {15830#(<= ~counter~0 4)} assume true; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,316 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15830#(<= ~counter~0 4)} {15830#(<= ~counter~0 4)} #98#return; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {15830#(<= ~counter~0 4)} assume !(~r~0 < 0); {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {15830#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {15855#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,318 INFO L272 TraceCheckUtils]: 51: Hoare triple {15855#(<= ~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)); {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {15855#(<= ~counter~0 5)} ~cond := #in~cond; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {15855#(<= ~counter~0 5)} assume !(0 == ~cond); {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {15855#(<= ~counter~0 5)} assume true; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,319 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15855#(<= ~counter~0 5)} {15855#(<= ~counter~0 5)} #94#return; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {15855#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {15855#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {15880#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,321 INFO L272 TraceCheckUtils]: 59: Hoare triple {15880#(<= ~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)); {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {15880#(<= ~counter~0 6)} ~cond := #in~cond; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {15880#(<= ~counter~0 6)} assume !(0 == ~cond); {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,322 INFO L290 TraceCheckUtils]: 62: Hoare triple {15880#(<= ~counter~0 6)} assume true; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,323 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15880#(<= ~counter~0 6)} {15880#(<= ~counter~0 6)} #96#return; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {15880#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,323 INFO L290 TraceCheckUtils]: 65: Hoare triple {15880#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15905#(<= |main_#t~post7| 6)} is VALID [2022-04-08 06:01:12,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {15905#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {15699#false} is VALID [2022-04-08 06:01:12,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {15699#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15699#false} is VALID [2022-04-08 06:01:12,324 INFO L290 TraceCheckUtils]: 68: Hoare triple {15699#false} assume !(#t~post8 < 10);havoc #t~post8; {15699#false} is VALID [2022-04-08 06:01:12,324 INFO L290 TraceCheckUtils]: 69: Hoare triple {15699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15699#false} is VALID [2022-04-08 06:01:12,324 INFO L290 TraceCheckUtils]: 70: Hoare triple {15699#false} assume !(#t~post6 < 10);havoc #t~post6; {15699#false} is VALID [2022-04-08 06:01:12,324 INFO L272 TraceCheckUtils]: 71: Hoare triple {15699#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)); {15699#false} is VALID [2022-04-08 06:01:12,324 INFO L290 TraceCheckUtils]: 72: Hoare triple {15699#false} ~cond := #in~cond; {15699#false} is VALID [2022-04-08 06:01:12,325 INFO L290 TraceCheckUtils]: 73: Hoare triple {15699#false} assume 0 == ~cond; {15699#false} is VALID [2022-04-08 06:01:12,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {15699#false} assume !false; {15699#false} is VALID [2022-04-08 06:01:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:12,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:12,680 INFO L290 TraceCheckUtils]: 74: Hoare triple {15699#false} assume !false; {15699#false} is VALID [2022-04-08 06:01:12,680 INFO L290 TraceCheckUtils]: 73: Hoare triple {15699#false} assume 0 == ~cond; {15699#false} is VALID [2022-04-08 06:01:12,680 INFO L290 TraceCheckUtils]: 72: Hoare triple {15699#false} ~cond := #in~cond; {15699#false} is VALID [2022-04-08 06:01:12,680 INFO L272 TraceCheckUtils]: 71: Hoare triple {15699#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)); {15699#false} is VALID [2022-04-08 06:01:12,680 INFO L290 TraceCheckUtils]: 70: Hoare triple {15699#false} assume !(#t~post6 < 10);havoc #t~post6; {15699#false} is VALID [2022-04-08 06:01:12,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {15699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15699#false} is VALID [2022-04-08 06:01:12,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {15699#false} assume !(#t~post8 < 10);havoc #t~post8; {15699#false} is VALID [2022-04-08 06:01:12,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {15699#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15699#false} is VALID [2022-04-08 06:01:12,686 INFO L290 TraceCheckUtils]: 66: Hoare triple {15957#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {15699#false} is VALID [2022-04-08 06:01:12,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {15961#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15957#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:01:12,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {15961#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15961#(< ~counter~0 10)} is VALID [2022-04-08 06:01:12,687 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15698#true} {15961#(< ~counter~0 10)} #96#return; {15961#(< ~counter~0 10)} is VALID [2022-04-08 06:01:12,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,687 INFO L272 TraceCheckUtils]: 59: Hoare triple {15961#(< ~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)); {15698#true} is VALID [2022-04-08 06:01:12,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {15961#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {15961#(< ~counter~0 10)} is VALID [2022-04-08 06:01:12,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {15986#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15961#(< ~counter~0 10)} is VALID [2022-04-08 06:01:12,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {15986#(< ~counter~0 9)} assume !!(0 != ~r~0); {15986#(< ~counter~0 9)} is VALID [2022-04-08 06:01:12,689 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15698#true} {15986#(< ~counter~0 9)} #94#return; {15986#(< ~counter~0 9)} is VALID [2022-04-08 06:01:12,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,689 INFO L272 TraceCheckUtils]: 51: Hoare triple {15986#(< ~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)); {15698#true} is VALID [2022-04-08 06:01:12,689 INFO L290 TraceCheckUtils]: 50: Hoare triple {15986#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {15986#(< ~counter~0 9)} is VALID [2022-04-08 06:01:12,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {16011#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15986#(< ~counter~0 9)} is VALID [2022-04-08 06:01:12,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {16011#(< ~counter~0 8)} assume !(~r~0 < 0); {16011#(< ~counter~0 8)} is VALID [2022-04-08 06:01:12,690 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15698#true} {16011#(< ~counter~0 8)} #98#return; {16011#(< ~counter~0 8)} is VALID [2022-04-08 06:01:12,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,691 INFO L272 TraceCheckUtils]: 43: Hoare triple {16011#(< ~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)); {15698#true} is VALID [2022-04-08 06:01:12,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {16011#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {16011#(< ~counter~0 8)} is VALID [2022-04-08 06:01:12,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {15880#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16011#(< ~counter~0 8)} is VALID [2022-04-08 06:01:12,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {15880#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,692 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15698#true} {15880#(<= ~counter~0 6)} #98#return; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,692 INFO L272 TraceCheckUtils]: 35: Hoare triple {15880#(<= ~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)); {15698#true} is VALID [2022-04-08 06:01:12,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {15880#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {15855#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15880#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:12,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {15855#(<= ~counter~0 5)} assume !(~r~0 > 0); {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,694 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15698#true} {15855#(<= ~counter~0 5)} #96#return; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,694 INFO L272 TraceCheckUtils]: 27: Hoare triple {15855#(<= ~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)); {15698#true} is VALID [2022-04-08 06:01:12,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {15855#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {15830#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15855#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:12,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {15830#(<= ~counter~0 4)} assume !!(0 != ~r~0); {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,696 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15698#true} {15830#(<= ~counter~0 4)} #94#return; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {15830#(<= ~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)); {15698#true} is VALID [2022-04-08 06:01:12,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {15830#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {15805#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15830#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:12,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {15805#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,697 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15698#true} {15805#(<= ~counter~0 3)} #92#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,697 INFO L272 TraceCheckUtils]: 11: Hoare triple {15805#(<= ~counter~0 3)} 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)); {15698#true} is VALID [2022-04-08 06:01:12,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15698#true} {15805#(<= ~counter~0 3)} #90#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-08 06:01:12,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-08 06:01:12,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-08 06:01:12,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {15805#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15698#true} is VALID [2022-04-08 06:01:12,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {15805#(<= ~counter~0 3)} 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; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {15805#(<= ~counter~0 3)} call #t~ret9 := main(); {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15805#(<= ~counter~0 3)} {15698#true} #102#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {15805#(<= ~counter~0 3)} assume true; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {15698#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; {15805#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:12,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {15698#true} call ULTIMATE.init(); {15698#true} is VALID [2022-04-08 06:01:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-08 06:01:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:12,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420552968] [2022-04-08 06:01:12,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:12,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369851123] [2022-04-08 06:01:12,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369851123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:12,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:12,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 06:01:12,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:12,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636693096] [2022-04-08 06:01:12,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636693096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:12,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:12,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:01:12,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888194495] [2022-04-08 06:01:12,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:12,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-08 06:01:12,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:12,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:12,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:12,752 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:01:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:01:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:12,752 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:13,284 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-08 06:01:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:01:13,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-08 06:01:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 06:01:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-08 06:01:13,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-08 06:01:13,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:13,435 INFO L225 Difference]: With dead ends: 195 [2022-04-08 06:01:13,435 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 06:01:13,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:01:13,436 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:13,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 06:01:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 06:01:13,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:13,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:13,648 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:13,648 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:13,651 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 06:01:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:01:13,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:13,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:13,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 06:01:13,653 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-08 06:01:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:13,656 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-08 06:01:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:01:13,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:13,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:13,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:13,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 06:01:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-08 06:01:13,660 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-08 06:01:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:13,660 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-08 06:01:13,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-08 06:01:13,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-08 06:01:16,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 182 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-08 06:01:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-08 06:01:16,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:16,025 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 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-08 06:01:16,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-08 06:01:16,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:16,226 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-08 06:01:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:16,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176329423] [2022-04-08 06:01:16,227 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-08 06:01:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:16,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687544868] [2022-04-08 06:01:16,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:16,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35843108] [2022-04-08 06:01:16,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:16,239 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:16,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 06:01:16,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:16,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:16,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:01:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:16,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:16,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {17145#true} call ULTIMATE.init(); {17145#true} is VALID [2022-04-08 06:01:16,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {17145#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; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17153#(<= ~counter~0 0)} {17145#true} #102#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {17153#(<= ~counter~0 0)} call #t~ret9 := main(); {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {17153#(<= ~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; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,682 INFO L272 TraceCheckUtils]: 6: Hoare triple {17153#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {17153#(<= ~counter~0 0)} ~cond := #in~cond; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {17153#(<= ~counter~0 0)} assume !(0 == ~cond); {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17153#(<= ~counter~0 0)} {17153#(<= ~counter~0 0)} #90#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,684 INFO L272 TraceCheckUtils]: 11: Hoare triple {17153#(<= ~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)); {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {17153#(<= ~counter~0 0)} ~cond := #in~cond; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {17153#(<= ~counter~0 0)} assume !(0 == ~cond); {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17153#(<= ~counter~0 0)} {17153#(<= ~counter~0 0)} #92#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {17153#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17153#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:16,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {17153#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {17202#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {17202#(<= ~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)); {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {17202#(<= ~counter~0 1)} ~cond := #in~cond; {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {17202#(<= ~counter~0 1)} assume !(0 == ~cond); {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {17202#(<= ~counter~0 1)} assume true; {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,688 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17202#(<= ~counter~0 1)} {17202#(<= ~counter~0 1)} #94#return; {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {17202#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17202#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:16,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {17202#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {17227#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,690 INFO L272 TraceCheckUtils]: 27: Hoare triple {17227#(<= ~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)); {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {17227#(<= ~counter~0 2)} ~cond := #in~cond; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {17227#(<= ~counter~0 2)} assume !(0 == ~cond); {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {17227#(<= ~counter~0 2)} assume true; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,691 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17227#(<= ~counter~0 2)} {17227#(<= ~counter~0 2)} #96#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {17227#(<= ~counter~0 2)} assume !(~r~0 > 0); {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:16,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {17227#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,692 INFO L290 TraceCheckUtils]: 34: Hoare triple {17252#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,692 INFO L272 TraceCheckUtils]: 35: Hoare triple {17252#(<= ~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)); {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {17252#(<= ~counter~0 3)} ~cond := #in~cond; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {17252#(<= ~counter~0 3)} assume !(0 == ~cond); {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,693 INFO L290 TraceCheckUtils]: 38: Hoare triple {17252#(<= ~counter~0 3)} assume true; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,694 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17252#(<= ~counter~0 3)} {17252#(<= ~counter~0 3)} #98#return; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {17252#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:16,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {17252#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,695 INFO L290 TraceCheckUtils]: 42: Hoare triple {17277#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,695 INFO L272 TraceCheckUtils]: 43: Hoare triple {17277#(<= ~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)); {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {17277#(<= ~counter~0 4)} ~cond := #in~cond; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {17277#(<= ~counter~0 4)} assume !(0 == ~cond); {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {17277#(<= ~counter~0 4)} assume true; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,696 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17277#(<= ~counter~0 4)} {17277#(<= ~counter~0 4)} #98#return; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {17277#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:16,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {17277#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {17302#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,698 INFO L272 TraceCheckUtils]: 51: Hoare triple {17302#(<= ~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)); {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,698 INFO L290 TraceCheckUtils]: 52: Hoare triple {17302#(<= ~counter~0 5)} ~cond := #in~cond; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,698 INFO L290 TraceCheckUtils]: 53: Hoare triple {17302#(<= ~counter~0 5)} assume !(0 == ~cond); {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {17302#(<= ~counter~0 5)} assume true; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,699 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17302#(<= ~counter~0 5)} {17302#(<= ~counter~0 5)} #98#return; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {17302#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:16,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {17302#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,700 INFO L290 TraceCheckUtils]: 58: Hoare triple {17327#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,701 INFO L272 TraceCheckUtils]: 59: Hoare triple {17327#(<= ~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)); {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,701 INFO L290 TraceCheckUtils]: 60: Hoare triple {17327#(<= ~counter~0 6)} ~cond := #in~cond; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {17327#(<= ~counter~0 6)} assume !(0 == ~cond); {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {17327#(<= ~counter~0 6)} assume true; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,702 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17327#(<= ~counter~0 6)} {17327#(<= ~counter~0 6)} #98#return; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {17327#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:16,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {17327#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {17352#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,704 INFO L272 TraceCheckUtils]: 67: Hoare triple {17352#(<= ~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)); {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {17352#(<= ~counter~0 7)} ~cond := #in~cond; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {17352#(<= ~counter~0 7)} assume !(0 == ~cond); {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {17352#(<= ~counter~0 7)} assume true; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,705 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17352#(<= ~counter~0 7)} {17352#(<= ~counter~0 7)} #98#return; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {17352#(<= ~counter~0 7)} assume !(~r~0 < 0); {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:16,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {17352#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17377#(<= |main_#t~post6| 7)} is VALID [2022-04-08 06:01:16,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {17377#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {17146#false} is VALID [2022-04-08 06:01:16,706 INFO L272 TraceCheckUtils]: 75: Hoare triple {17146#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)); {17146#false} is VALID [2022-04-08 06:01:16,706 INFO L290 TraceCheckUtils]: 76: Hoare triple {17146#false} ~cond := #in~cond; {17146#false} is VALID [2022-04-08 06:01:16,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {17146#false} assume 0 == ~cond; {17146#false} is VALID [2022-04-08 06:01:16,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {17146#false} assume !false; {17146#false} is VALID [2022-04-08 06:01:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:16,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:17,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {17146#false} assume !false; {17146#false} is VALID [2022-04-08 06:01:17,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {17146#false} assume 0 == ~cond; {17146#false} is VALID [2022-04-08 06:01:17,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {17146#false} ~cond := #in~cond; {17146#false} is VALID [2022-04-08 06:01:17,080 INFO L272 TraceCheckUtils]: 75: Hoare triple {17146#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)); {17146#false} is VALID [2022-04-08 06:01:17,080 INFO L290 TraceCheckUtils]: 74: Hoare triple {17405#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {17146#false} is VALID [2022-04-08 06:01:17,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {17409#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17405#(< |main_#t~post6| 10)} is VALID [2022-04-08 06:01:17,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {17409#(< ~counter~0 10)} assume !(~r~0 < 0); {17409#(< ~counter~0 10)} is VALID [2022-04-08 06:01:17,082 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17145#true} {17409#(< ~counter~0 10)} #98#return; {17409#(< ~counter~0 10)} is VALID [2022-04-08 06:01:17,082 INFO L290 TraceCheckUtils]: 70: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,082 INFO L290 TraceCheckUtils]: 68: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,082 INFO L272 TraceCheckUtils]: 67: Hoare triple {17409#(< ~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)); {17145#true} is VALID [2022-04-08 06:01:17,082 INFO L290 TraceCheckUtils]: 66: Hoare triple {17409#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {17409#(< ~counter~0 10)} is VALID [2022-04-08 06:01:17,083 INFO L290 TraceCheckUtils]: 65: Hoare triple {17434#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17409#(< ~counter~0 10)} is VALID [2022-04-08 06:01:17,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {17434#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17434#(< ~counter~0 9)} is VALID [2022-04-08 06:01:17,083 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17145#true} {17434#(< ~counter~0 9)} #98#return; {17434#(< ~counter~0 9)} is VALID [2022-04-08 06:01:17,084 INFO L290 TraceCheckUtils]: 62: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,084 INFO L290 TraceCheckUtils]: 61: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,084 INFO L290 TraceCheckUtils]: 60: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,084 INFO L272 TraceCheckUtils]: 59: Hoare triple {17434#(< ~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)); {17145#true} is VALID [2022-04-08 06:01:17,084 INFO L290 TraceCheckUtils]: 58: Hoare triple {17434#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {17434#(< ~counter~0 9)} is VALID [2022-04-08 06:01:17,084 INFO L290 TraceCheckUtils]: 57: Hoare triple {17352#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17434#(< ~counter~0 9)} is VALID [2022-04-08 06:01:17,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {17352#(<= ~counter~0 7)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:17,085 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17145#true} {17352#(<= ~counter~0 7)} #98#return; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:17,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,085 INFO L272 TraceCheckUtils]: 51: Hoare triple {17352#(<= ~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)); {17145#true} is VALID [2022-04-08 06:01:17,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {17352#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:17,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {17327#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:17,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {17327#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:17,087 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17145#true} {17327#(<= ~counter~0 6)} #98#return; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:17,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,087 INFO L272 TraceCheckUtils]: 43: Hoare triple {17327#(<= ~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)); {17145#true} is VALID [2022-04-08 06:01:17,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {17327#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:17,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {17302#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:17,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {17302#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:17,089 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17145#true} {17302#(<= ~counter~0 5)} #98#return; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:17,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,089 INFO L272 TraceCheckUtils]: 35: Hoare triple {17302#(<= ~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)); {17145#true} is VALID [2022-04-08 06:01:17,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {17302#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:17,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {17277#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:17,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {17277#(<= ~counter~0 4)} assume !(~r~0 > 0); {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:17,090 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17145#true} {17277#(<= ~counter~0 4)} #96#return; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:17,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,091 INFO L290 TraceCheckUtils]: 28: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,091 INFO L272 TraceCheckUtils]: 27: Hoare triple {17277#(<= ~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)); {17145#true} is VALID [2022-04-08 06:01:17,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {17277#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:17,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {17252#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17277#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:17,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {17252#(<= ~counter~0 3)} assume !!(0 != ~r~0); {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:17,092 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17145#true} {17252#(<= ~counter~0 3)} #94#return; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:17,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {17252#(<= ~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)); {17145#true} is VALID [2022-04-08 06:01:17,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {17252#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:17,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {17227#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17252#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:17,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {17227#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,094 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17145#true} {17227#(<= ~counter~0 2)} #92#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {17227#(<= ~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)); {17145#true} is VALID [2022-04-08 06:01:17,094 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17145#true} {17227#(<= ~counter~0 2)} #90#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-08 06:01:17,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-08 06:01:17,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-08 06:01:17,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {17227#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17145#true} is VALID [2022-04-08 06:01:17,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {17227#(<= ~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; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {17227#(<= ~counter~0 2)} call #t~ret9 := main(); {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17227#(<= ~counter~0 2)} {17145#true} #102#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {17227#(<= ~counter~0 2)} assume true; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {17145#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; {17227#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:17,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {17145#true} call ULTIMATE.init(); {17145#true} is VALID [2022-04-08 06:01:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 06:01:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:17,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687544868] [2022-04-08 06:01:17,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:17,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35843108] [2022-04-08 06:01:17,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35843108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:17,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:17,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 06:01:17,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:17,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176329423] [2022-04-08 06:01:17,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176329423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:17,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:17,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:01:17,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716370953] [2022-04-08 06:01:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:17,103 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-08 06:01:17,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:17,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:17,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:17,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:01:17,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:01:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:17,164 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:17,782 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-08 06:01:17,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 06:01:17,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-08 06:01:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 06:01:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-08 06:01:17,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-08 06:01:17,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:17,928 INFO L225 Difference]: With dead ends: 168 [2022-04-08 06:01:17,928 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 06:01:17,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-08 06:01:17,929 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:17,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 06:01:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 06:01:18,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:18,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:18,147 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:18,147 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:18,150 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 06:01:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 06:01:18,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:18,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:18,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 06:01:18,152 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-08 06:01:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:18,155 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-08 06:01:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-08 06:01:18,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:18,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:18,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:18,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-08 06:01:18,159 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-08 06:01:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:18,159 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-08 06:01:18,159 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:18,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-08 06:01:20,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 197 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-08 06:01:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 06:01:20,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:20,539 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-04-08 06:01:20,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 06:01:20,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:20,748 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-08 06:01:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:20,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [632216579] [2022-04-08 06:01:20,749 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-08 06:01:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:20,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615111055] [2022-04-08 06:01:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:20,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:20,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:20,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679573299] [2022-04-08 06:01:20,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:20,761 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:20,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 06:01:20,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:20,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:20,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:01:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:20,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:21,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {18616#true} call ULTIMATE.init(); {18616#true} is VALID [2022-04-08 06:01:21,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {18616#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; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18624#(<= ~counter~0 0)} {18616#true} #102#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {18624#(<= ~counter~0 0)} call #t~ret9 := main(); {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {18624#(<= ~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; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {18624#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {18624#(<= ~counter~0 0)} ~cond := #in~cond; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {18624#(<= ~counter~0 0)} assume !(0 == ~cond); {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18624#(<= ~counter~0 0)} {18624#(<= ~counter~0 0)} #90#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {18624#(<= ~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)); {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {18624#(<= ~counter~0 0)} ~cond := #in~cond; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {18624#(<= ~counter~0 0)} assume !(0 == ~cond); {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18624#(<= ~counter~0 0)} {18624#(<= ~counter~0 0)} #92#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {18624#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18624#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:21,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {18624#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {18673#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,201 INFO L272 TraceCheckUtils]: 19: Hoare triple {18673#(<= ~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)); {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {18673#(<= ~counter~0 1)} ~cond := #in~cond; {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {18673#(<= ~counter~0 1)} assume !(0 == ~cond); {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {18673#(<= ~counter~0 1)} assume true; {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,202 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18673#(<= ~counter~0 1)} {18673#(<= ~counter~0 1)} #94#return; {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {18673#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18673#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:21,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {18673#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {18698#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,204 INFO L272 TraceCheckUtils]: 27: Hoare triple {18698#(<= ~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)); {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {18698#(<= ~counter~0 2)} ~cond := #in~cond; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {18698#(<= ~counter~0 2)} assume !(0 == ~cond); {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {18698#(<= ~counter~0 2)} assume true; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,205 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18698#(<= ~counter~0 2)} {18698#(<= ~counter~0 2)} #96#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {18698#(<= ~counter~0 2)} assume !(~r~0 > 0); {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {18698#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {18723#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,207 INFO L272 TraceCheckUtils]: 35: Hoare triple {18723#(<= ~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)); {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {18723#(<= ~counter~0 3)} ~cond := #in~cond; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {18723#(<= ~counter~0 3)} assume !(0 == ~cond); {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {18723#(<= ~counter~0 3)} assume true; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,208 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18723#(<= ~counter~0 3)} {18723#(<= ~counter~0 3)} #98#return; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {18723#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {18723#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {18748#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,209 INFO L272 TraceCheckUtils]: 43: Hoare triple {18748#(<= ~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)); {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {18748#(<= ~counter~0 4)} ~cond := #in~cond; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {18748#(<= ~counter~0 4)} assume !(0 == ~cond); {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {18748#(<= ~counter~0 4)} assume true; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,211 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18748#(<= ~counter~0 4)} {18748#(<= ~counter~0 4)} #98#return; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {18748#(<= ~counter~0 4)} assume !(~r~0 < 0); {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {18748#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {18773#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,212 INFO L272 TraceCheckUtils]: 51: Hoare triple {18773#(<= ~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)); {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {18773#(<= ~counter~0 5)} ~cond := #in~cond; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {18773#(<= ~counter~0 5)} assume !(0 == ~cond); {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {18773#(<= ~counter~0 5)} assume true; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,215 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18773#(<= ~counter~0 5)} {18773#(<= ~counter~0 5)} #94#return; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {18773#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {18773#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {18798#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,217 INFO L272 TraceCheckUtils]: 59: Hoare triple {18798#(<= ~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)); {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {18798#(<= ~counter~0 6)} ~cond := #in~cond; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {18798#(<= ~counter~0 6)} assume !(0 == ~cond); {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {18798#(<= ~counter~0 6)} assume true; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,218 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18798#(<= ~counter~0 6)} {18798#(<= ~counter~0 6)} #96#return; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,219 INFO L290 TraceCheckUtils]: 64: Hoare triple {18798#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {18798#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {18823#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,221 INFO L272 TraceCheckUtils]: 67: Hoare triple {18823#(<= ~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)); {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {18823#(<= ~counter~0 7)} ~cond := #in~cond; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {18823#(<= ~counter~0 7)} assume !(0 == ~cond); {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {18823#(<= ~counter~0 7)} assume true; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,222 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18823#(<= ~counter~0 7)} {18823#(<= ~counter~0 7)} #96#return; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {18823#(<= ~counter~0 7)} assume !(~r~0 > 0); {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {18823#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18848#(<= |main_#t~post8| 7)} is VALID [2022-04-08 06:01:21,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {18848#(<= |main_#t~post8| 7)} assume !(#t~post8 < 10);havoc #t~post8; {18617#false} is VALID [2022-04-08 06:01:21,224 INFO L290 TraceCheckUtils]: 75: Hoare triple {18617#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#false} is VALID [2022-04-08 06:01:21,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {18617#false} assume !(#t~post6 < 10);havoc #t~post6; {18617#false} is VALID [2022-04-08 06:01:21,224 INFO L272 TraceCheckUtils]: 77: Hoare triple {18617#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)); {18617#false} is VALID [2022-04-08 06:01:21,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {18617#false} ~cond := #in~cond; {18617#false} is VALID [2022-04-08 06:01:21,224 INFO L290 TraceCheckUtils]: 79: Hoare triple {18617#false} assume 0 == ~cond; {18617#false} is VALID [2022-04-08 06:01:21,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {18617#false} assume !false; {18617#false} is VALID [2022-04-08 06:01:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:21,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:21,601 INFO L290 TraceCheckUtils]: 80: Hoare triple {18617#false} assume !false; {18617#false} is VALID [2022-04-08 06:01:21,601 INFO L290 TraceCheckUtils]: 79: Hoare triple {18617#false} assume 0 == ~cond; {18617#false} is VALID [2022-04-08 06:01:21,601 INFO L290 TraceCheckUtils]: 78: Hoare triple {18617#false} ~cond := #in~cond; {18617#false} is VALID [2022-04-08 06:01:21,601 INFO L272 TraceCheckUtils]: 77: Hoare triple {18617#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)); {18617#false} is VALID [2022-04-08 06:01:21,601 INFO L290 TraceCheckUtils]: 76: Hoare triple {18617#false} assume !(#t~post6 < 10);havoc #t~post6; {18617#false} is VALID [2022-04-08 06:01:21,601 INFO L290 TraceCheckUtils]: 75: Hoare triple {18617#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#false} is VALID [2022-04-08 06:01:21,602 INFO L290 TraceCheckUtils]: 74: Hoare triple {18888#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {18617#false} is VALID [2022-04-08 06:01:21,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {18892#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18888#(< |main_#t~post8| 10)} is VALID [2022-04-08 06:01:21,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {18892#(< ~counter~0 10)} assume !(~r~0 > 0); {18892#(< ~counter~0 10)} is VALID [2022-04-08 06:01:21,603 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18616#true} {18892#(< ~counter~0 10)} #96#return; {18892#(< ~counter~0 10)} is VALID [2022-04-08 06:01:21,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,603 INFO L290 TraceCheckUtils]: 69: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,604 INFO L272 TraceCheckUtils]: 67: Hoare triple {18892#(< ~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)); {18616#true} is VALID [2022-04-08 06:01:21,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {18892#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {18892#(< ~counter~0 10)} is VALID [2022-04-08 06:01:21,605 INFO L290 TraceCheckUtils]: 65: Hoare triple {18917#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18892#(< ~counter~0 10)} is VALID [2022-04-08 06:01:21,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {18917#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18917#(< ~counter~0 9)} is VALID [2022-04-08 06:01:21,607 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18616#true} {18917#(< ~counter~0 9)} #96#return; {18917#(< ~counter~0 9)} is VALID [2022-04-08 06:01:21,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,607 INFO L290 TraceCheckUtils]: 60: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,607 INFO L272 TraceCheckUtils]: 59: Hoare triple {18917#(< ~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)); {18616#true} is VALID [2022-04-08 06:01:21,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {18917#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {18917#(< ~counter~0 9)} is VALID [2022-04-08 06:01:21,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {18823#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18917#(< ~counter~0 9)} is VALID [2022-04-08 06:01:21,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {18823#(<= ~counter~0 7)} assume !!(0 != ~r~0); {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,609 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18616#true} {18823#(<= ~counter~0 7)} #94#return; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,609 INFO L272 TraceCheckUtils]: 51: Hoare triple {18823#(<= ~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)); {18616#true} is VALID [2022-04-08 06:01:21,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {18823#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,610 INFO L290 TraceCheckUtils]: 49: Hoare triple {18798#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18823#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:21,610 INFO L290 TraceCheckUtils]: 48: Hoare triple {18798#(<= ~counter~0 6)} assume !(~r~0 < 0); {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,611 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18616#true} {18798#(<= ~counter~0 6)} #98#return; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,611 INFO L272 TraceCheckUtils]: 43: Hoare triple {18798#(<= ~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)); {18616#true} is VALID [2022-04-08 06:01:21,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {18798#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {18773#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18798#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:21,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {18773#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,612 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18616#true} {18773#(<= ~counter~0 5)} #98#return; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,613 INFO L272 TraceCheckUtils]: 35: Hoare triple {18773#(<= ~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)); {18616#true} is VALID [2022-04-08 06:01:21,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {18773#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {18748#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18773#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:21,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {18748#(<= ~counter~0 4)} assume !(~r~0 > 0); {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,614 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18616#true} {18748#(<= ~counter~0 4)} #96#return; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,614 INFO L272 TraceCheckUtils]: 27: Hoare triple {18748#(<= ~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)); {18616#true} is VALID [2022-04-08 06:01:21,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {18748#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {18723#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18748#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:21,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {18723#(<= ~counter~0 3)} assume !!(0 != ~r~0); {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,616 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18616#true} {18723#(<= ~counter~0 3)} #94#return; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,616 INFO L272 TraceCheckUtils]: 19: Hoare triple {18723#(<= ~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)); {18616#true} is VALID [2022-04-08 06:01:21,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {18723#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {18698#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18723#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:21,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {18698#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,618 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18616#true} {18698#(<= ~counter~0 2)} #92#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L272 TraceCheckUtils]: 11: Hoare triple {18698#(<= ~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)); {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18616#true} {18698#(<= ~counter~0 2)} #90#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-08 06:01:21,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {18698#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18616#true} is VALID [2022-04-08 06:01:21,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {18698#(<= ~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; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {18698#(<= ~counter~0 2)} call #t~ret9 := main(); {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18698#(<= ~counter~0 2)} {18616#true} #102#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {18698#(<= ~counter~0 2)} assume true; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {18616#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; {18698#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:21,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {18616#true} call ULTIMATE.init(); {18616#true} is VALID [2022-04-08 06:01:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 06:01:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:21,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615111055] [2022-04-08 06:01:21,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:21,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679573299] [2022-04-08 06:01:21,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679573299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:21,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:21,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 06:01:21,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:21,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [632216579] [2022-04-08 06:01:21,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [632216579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:21,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:21,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:01:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822772490] [2022-04-08 06:01:21,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-08 06:01:21,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:21,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:21,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:21,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:01:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:01:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:21,683 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:22,289 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-08 06:01:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 06:01:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-08 06:01:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 06:01:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-08 06:01:22,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-08 06:01:22,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:22,443 INFO L225 Difference]: With dead ends: 213 [2022-04-08 06:01:22,443 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 06:01:22,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:01:22,444 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:22,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 206 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 06:01:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 06:01:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-08 06:01:22,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:22,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:22,635 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:22,636 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:22,639 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 06:01:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 06:01:22,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:22,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:22,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 06:01:22,653 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-08 06:01:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:22,657 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-08 06:01:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-08 06:01:22,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:22,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:22,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:22,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-08 06:01:22,662 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-08 06:01:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:22,662 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-08 06:01:22,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:22,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-08 06:01:25,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 201 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-08 06:01:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 06:01:25,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:25,067 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-04-08 06:01:25,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:25,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:25,268 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-08 06:01:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:25,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [547705367] [2022-04-08 06:01:25,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-08 06:01:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:25,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480665721] [2022-04-08 06:01:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:25,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:25,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115554174] [2022-04-08 06:01:25,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:01:25,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:25,281 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:25,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 06:01:25,344 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:01:25,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:25,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 06:01:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:25,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:25,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {20199#true} call ULTIMATE.init(); {20199#true} is VALID [2022-04-08 06:01:25,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {20199#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; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20207#(<= ~counter~0 0)} {20199#true} #102#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {20207#(<= ~counter~0 0)} call #t~ret9 := main(); {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {20207#(<= ~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; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {20207#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {20207#(<= ~counter~0 0)} ~cond := #in~cond; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {20207#(<= ~counter~0 0)} assume !(0 == ~cond); {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20207#(<= ~counter~0 0)} {20207#(<= ~counter~0 0)} #90#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {20207#(<= ~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)); {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {20207#(<= ~counter~0 0)} ~cond := #in~cond; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {20207#(<= ~counter~0 0)} assume !(0 == ~cond); {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,748 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20207#(<= ~counter~0 0)} {20207#(<= ~counter~0 0)} #92#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {20207#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20207#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:25,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {20207#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {20256#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,750 INFO L272 TraceCheckUtils]: 19: Hoare triple {20256#(<= ~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)); {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {20256#(<= ~counter~0 1)} ~cond := #in~cond; {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {20256#(<= ~counter~0 1)} assume !(0 == ~cond); {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {20256#(<= ~counter~0 1)} assume true; {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,751 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20256#(<= ~counter~0 1)} {20256#(<= ~counter~0 1)} #94#return; {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {20256#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20256#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:25,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {20256#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {20281#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,752 INFO L272 TraceCheckUtils]: 27: Hoare triple {20281#(<= ~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)); {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {20281#(<= ~counter~0 2)} ~cond := #in~cond; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {20281#(<= ~counter~0 2)} assume !(0 == ~cond); {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {20281#(<= ~counter~0 2)} assume true; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,754 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20281#(<= ~counter~0 2)} {20281#(<= ~counter~0 2)} #96#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {20281#(<= ~counter~0 2)} assume !(~r~0 > 0); {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:25,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {20281#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {20306#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,755 INFO L272 TraceCheckUtils]: 35: Hoare triple {20306#(<= ~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)); {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {20306#(<= ~counter~0 3)} ~cond := #in~cond; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {20306#(<= ~counter~0 3)} assume !(0 == ~cond); {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {20306#(<= ~counter~0 3)} assume true; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,756 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20306#(<= ~counter~0 3)} {20306#(<= ~counter~0 3)} #98#return; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {20306#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:25,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {20306#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {20331#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,758 INFO L272 TraceCheckUtils]: 43: Hoare triple {20331#(<= ~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)); {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {20331#(<= ~counter~0 4)} ~cond := #in~cond; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {20331#(<= ~counter~0 4)} assume !(0 == ~cond); {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {20331#(<= ~counter~0 4)} assume true; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,759 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20331#(<= ~counter~0 4)} {20331#(<= ~counter~0 4)} #98#return; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {20331#(<= ~counter~0 4)} assume !(~r~0 < 0); {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:25,760 INFO L290 TraceCheckUtils]: 49: Hoare triple {20331#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {20356#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,761 INFO L272 TraceCheckUtils]: 51: Hoare triple {20356#(<= ~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)); {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {20356#(<= ~counter~0 5)} ~cond := #in~cond; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {20356#(<= ~counter~0 5)} assume !(0 == ~cond); {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {20356#(<= ~counter~0 5)} assume true; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,762 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20356#(<= ~counter~0 5)} {20356#(<= ~counter~0 5)} #94#return; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,762 INFO L290 TraceCheckUtils]: 56: Hoare triple {20356#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:25,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {20356#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {20381#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,763 INFO L272 TraceCheckUtils]: 59: Hoare triple {20381#(<= ~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)); {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {20381#(<= ~counter~0 6)} ~cond := #in~cond; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {20381#(<= ~counter~0 6)} assume !(0 == ~cond); {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {20381#(<= ~counter~0 6)} assume true; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,765 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20381#(<= ~counter~0 6)} {20381#(<= ~counter~0 6)} #96#return; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {20381#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:25,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {20381#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,766 INFO L290 TraceCheckUtils]: 66: Hoare triple {20406#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,766 INFO L272 TraceCheckUtils]: 67: Hoare triple {20406#(<= ~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)); {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,766 INFO L290 TraceCheckUtils]: 68: Hoare triple {20406#(<= ~counter~0 7)} ~cond := #in~cond; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {20406#(<= ~counter~0 7)} assume !(0 == ~cond); {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {20406#(<= ~counter~0 7)} assume true; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,768 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20406#(<= ~counter~0 7)} {20406#(<= ~counter~0 7)} #96#return; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {20406#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:25,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {20406#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20431#(<= |main_#t~post7| 7)} is VALID [2022-04-08 06:01:25,768 INFO L290 TraceCheckUtils]: 74: Hoare triple {20431#(<= |main_#t~post7| 7)} assume !(#t~post7 < 10);havoc #t~post7; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 75: Hoare triple {20200#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 76: Hoare triple {20200#false} assume !(#t~post8 < 10);havoc #t~post8; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 77: Hoare triple {20200#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 78: Hoare triple {20200#false} assume !(#t~post6 < 10);havoc #t~post6; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L272 TraceCheckUtils]: 79: Hoare triple {20200#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)); {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {20200#false} ~cond := #in~cond; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {20200#false} assume 0 == ~cond; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L290 TraceCheckUtils]: 82: Hoare triple {20200#false} assume !false; {20200#false} is VALID [2022-04-08 06:01:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:25,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {20200#false} assume !false; {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {20200#false} assume 0 == ~cond; {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {20200#false} ~cond := #in~cond; {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L272 TraceCheckUtils]: 79: Hoare triple {20200#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)); {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {20200#false} assume !(#t~post6 < 10);havoc #t~post6; {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {20200#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {20200#false} assume !(#t~post8 < 10);havoc #t~post8; {20200#false} is VALID [2022-04-08 06:01:26,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {20200#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20200#false} is VALID [2022-04-08 06:01:26,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {20483#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {20200#false} is VALID [2022-04-08 06:01:26,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {20487#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20483#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:01:26,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {20487#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20487#(< ~counter~0 10)} is VALID [2022-04-08 06:01:26,164 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20199#true} {20487#(< ~counter~0 10)} #96#return; {20487#(< ~counter~0 10)} is VALID [2022-04-08 06:01:26,164 INFO L290 TraceCheckUtils]: 70: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,164 INFO L290 TraceCheckUtils]: 69: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,164 INFO L290 TraceCheckUtils]: 68: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,164 INFO L272 TraceCheckUtils]: 67: Hoare triple {20487#(< ~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)); {20199#true} is VALID [2022-04-08 06:01:26,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {20487#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {20487#(< ~counter~0 10)} is VALID [2022-04-08 06:01:26,165 INFO L290 TraceCheckUtils]: 65: Hoare triple {20512#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20487#(< ~counter~0 10)} is VALID [2022-04-08 06:01:26,165 INFO L290 TraceCheckUtils]: 64: Hoare triple {20512#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20512#(< ~counter~0 9)} is VALID [2022-04-08 06:01:26,171 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20199#true} {20512#(< ~counter~0 9)} #96#return; {20512#(< ~counter~0 9)} is VALID [2022-04-08 06:01:26,172 INFO L290 TraceCheckUtils]: 62: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,172 INFO L290 TraceCheckUtils]: 61: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,172 INFO L272 TraceCheckUtils]: 59: Hoare triple {20512#(< ~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)); {20199#true} is VALID [2022-04-08 06:01:26,172 INFO L290 TraceCheckUtils]: 58: Hoare triple {20512#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {20512#(< ~counter~0 9)} is VALID [2022-04-08 06:01:26,173 INFO L290 TraceCheckUtils]: 57: Hoare triple {20406#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20512#(< ~counter~0 9)} is VALID [2022-04-08 06:01:26,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {20406#(<= ~counter~0 7)} assume !!(0 != ~r~0); {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:26,174 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20199#true} {20406#(<= ~counter~0 7)} #94#return; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:26,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,175 INFO L272 TraceCheckUtils]: 51: Hoare triple {20406#(<= ~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)); {20199#true} is VALID [2022-04-08 06:01:26,175 INFO L290 TraceCheckUtils]: 50: Hoare triple {20406#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:26,176 INFO L290 TraceCheckUtils]: 49: Hoare triple {20381#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20406#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:26,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {20381#(<= ~counter~0 6)} assume !(~r~0 < 0); {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:26,186 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20199#true} {20381#(<= ~counter~0 6)} #98#return; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:26,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,186 INFO L272 TraceCheckUtils]: 43: Hoare triple {20381#(<= ~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)); {20199#true} is VALID [2022-04-08 06:01:26,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {20381#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:26,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {20356#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20381#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:26,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {20356#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:26,188 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20199#true} {20356#(<= ~counter~0 5)} #98#return; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:26,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,189 INFO L272 TraceCheckUtils]: 35: Hoare triple {20356#(<= ~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)); {20199#true} is VALID [2022-04-08 06:01:26,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {20356#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:26,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {20331#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20356#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:26,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {20331#(<= ~counter~0 4)} assume !(~r~0 > 0); {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:26,191 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20199#true} {20331#(<= ~counter~0 4)} #96#return; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:26,191 INFO L290 TraceCheckUtils]: 30: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,191 INFO L290 TraceCheckUtils]: 29: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,191 INFO L272 TraceCheckUtils]: 27: Hoare triple {20331#(<= ~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)); {20199#true} is VALID [2022-04-08 06:01:26,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {20331#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:26,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {20306#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20331#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:26,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {20306#(<= ~counter~0 3)} assume !!(0 != ~r~0); {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:26,193 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20199#true} {20306#(<= ~counter~0 3)} #94#return; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:26,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {20306#(<= ~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)); {20199#true} is VALID [2022-04-08 06:01:26,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {20306#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:26,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {20281#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20306#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:26,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {20281#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,195 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20199#true} {20281#(<= ~counter~0 2)} #92#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,196 INFO L272 TraceCheckUtils]: 11: Hoare triple {20281#(<= ~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)); {20199#true} is VALID [2022-04-08 06:01:26,196 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20199#true} {20281#(<= ~counter~0 2)} #90#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-08 06:01:26,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-08 06:01:26,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-08 06:01:26,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {20281#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20199#true} is VALID [2022-04-08 06:01:26,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {20281#(<= ~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; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {20281#(<= ~counter~0 2)} call #t~ret9 := main(); {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20281#(<= ~counter~0 2)} {20199#true} #102#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {20281#(<= ~counter~0 2)} assume true; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {20199#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; {20281#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:26,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {20199#true} call ULTIMATE.init(); {20199#true} is VALID [2022-04-08 06:01:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-08 06:01:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:26,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480665721] [2022-04-08 06:01:26,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:26,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115554174] [2022-04-08 06:01:26,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115554174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:26,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-08 06:01:26,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:26,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [547705367] [2022-04-08 06:01:26,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [547705367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:26,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 06:01:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087372737] [2022-04-08 06:01:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:26,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-08 06:01:26,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:26,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:26,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:26,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 06:01:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:26,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 06:01:26,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:26,277 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:26,970 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-08 06:01:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:01:26,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-08 06:01:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 06:01:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-08 06:01:26,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-08 06:01:27,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:27,136 INFO L225 Difference]: With dead ends: 215 [2022-04-08 06:01:27,136 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 06:01:27,137 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2022-04-08 06:01:27,137 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:27,137 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 207 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:01:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 06:01:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-08 06:01:27,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:27,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:27,395 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:27,396 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:27,400 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 06:01:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:01:27,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:27,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:27,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 06:01:27,401 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-08 06:01:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:27,404 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-08 06:01:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:01:27,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:27,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:27,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:27,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-08 06:01:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-08 06:01:27,409 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-08 06:01:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:27,409 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-08 06:01:27,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-08 06:01:27,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-08 06:01:28,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-08 06:01:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 06:01:28,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:28,490 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 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] [2022-04-08 06:01:28,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:28,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:28,707 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-08 06:01:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1270026123] [2022-04-08 06:01:28,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-08 06:01:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753125982] [2022-04-08 06:01:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:28,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:28,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:28,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149608705] [2022-04-08 06:01:28,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:28,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:28,720 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:28,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 06:01:28,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:28,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:28,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:01:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:28,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:29,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {21816#true} call ULTIMATE.init(); {21816#true} is VALID [2022-04-08 06:01:29,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {21816#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; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21824#(<= ~counter~0 0)} {21816#true} #102#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {21824#(<= ~counter~0 0)} call #t~ret9 := main(); {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {21824#(<= ~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; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {21824#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {21824#(<= ~counter~0 0)} ~cond := #in~cond; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {21824#(<= ~counter~0 0)} assume !(0 == ~cond); {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21824#(<= ~counter~0 0)} {21824#(<= ~counter~0 0)} #90#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,213 INFO L272 TraceCheckUtils]: 11: Hoare triple {21824#(<= ~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)); {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {21824#(<= ~counter~0 0)} ~cond := #in~cond; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {21824#(<= ~counter~0 0)} assume !(0 == ~cond); {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,214 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21824#(<= ~counter~0 0)} {21824#(<= ~counter~0 0)} #92#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {21824#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21824#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:29,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {21824#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {21873#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,216 INFO L272 TraceCheckUtils]: 19: Hoare triple {21873#(<= ~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)); {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {21873#(<= ~counter~0 1)} ~cond := #in~cond; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {21873#(<= ~counter~0 1)} assume !(0 == ~cond); {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {21873#(<= ~counter~0 1)} assume true; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,218 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21873#(<= ~counter~0 1)} {21873#(<= ~counter~0 1)} #94#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {21873#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {21873#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {21898#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,219 INFO L272 TraceCheckUtils]: 27: Hoare triple {21898#(<= ~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)); {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {21898#(<= ~counter~0 2)} ~cond := #in~cond; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {21898#(<= ~counter~0 2)} assume !(0 == ~cond); {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {21898#(<= ~counter~0 2)} assume true; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,220 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21898#(<= ~counter~0 2)} {21898#(<= ~counter~0 2)} #96#return; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {21898#(<= ~counter~0 2)} assume !(~r~0 > 0); {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {21898#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {21923#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,222 INFO L272 TraceCheckUtils]: 35: Hoare triple {21923#(<= ~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)); {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {21923#(<= ~counter~0 3)} ~cond := #in~cond; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {21923#(<= ~counter~0 3)} assume !(0 == ~cond); {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {21923#(<= ~counter~0 3)} assume true; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,223 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21923#(<= ~counter~0 3)} {21923#(<= ~counter~0 3)} #98#return; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {21923#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {21923#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {21948#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,225 INFO L272 TraceCheckUtils]: 43: Hoare triple {21948#(<= ~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)); {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {21948#(<= ~counter~0 4)} ~cond := #in~cond; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {21948#(<= ~counter~0 4)} assume !(0 == ~cond); {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {21948#(<= ~counter~0 4)} assume true; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,228 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21948#(<= ~counter~0 4)} {21948#(<= ~counter~0 4)} #98#return; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {21948#(<= ~counter~0 4)} assume !(~r~0 < 0); {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {21948#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {21973#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,230 INFO L272 TraceCheckUtils]: 51: Hoare triple {21973#(<= ~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)); {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {21973#(<= ~counter~0 5)} ~cond := #in~cond; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {21973#(<= ~counter~0 5)} assume !(0 == ~cond); {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {21973#(<= ~counter~0 5)} assume true; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,232 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21973#(<= ~counter~0 5)} {21973#(<= ~counter~0 5)} #94#return; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {21973#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {21973#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {21998#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,234 INFO L272 TraceCheckUtils]: 59: Hoare triple {21998#(<= ~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)); {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {21998#(<= ~counter~0 6)} ~cond := #in~cond; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {21998#(<= ~counter~0 6)} assume !(0 == ~cond); {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {21998#(<= ~counter~0 6)} assume true; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,236 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21998#(<= ~counter~0 6)} {21998#(<= ~counter~0 6)} #96#return; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {21998#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {21998#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {22023#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,238 INFO L272 TraceCheckUtils]: 67: Hoare triple {22023#(<= ~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)); {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {22023#(<= ~counter~0 7)} ~cond := #in~cond; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,238 INFO L290 TraceCheckUtils]: 69: Hoare triple {22023#(<= ~counter~0 7)} assume !(0 == ~cond); {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {22023#(<= ~counter~0 7)} assume true; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,239 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22023#(<= ~counter~0 7)} {22023#(<= ~counter~0 7)} #96#return; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,240 INFO L290 TraceCheckUtils]: 72: Hoare triple {22023#(<= ~counter~0 7)} assume !(~r~0 > 0); {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,240 INFO L290 TraceCheckUtils]: 73: Hoare triple {22023#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {22048#(<= ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,241 INFO L272 TraceCheckUtils]: 75: Hoare triple {22048#(<= ~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)); {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,242 INFO L290 TraceCheckUtils]: 76: Hoare triple {22048#(<= ~counter~0 8)} ~cond := #in~cond; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,242 INFO L290 TraceCheckUtils]: 77: Hoare triple {22048#(<= ~counter~0 8)} assume !(0 == ~cond); {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,242 INFO L290 TraceCheckUtils]: 78: Hoare triple {22048#(<= ~counter~0 8)} assume true; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,243 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22048#(<= ~counter~0 8)} {22048#(<= ~counter~0 8)} #98#return; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,243 INFO L290 TraceCheckUtils]: 80: Hoare triple {22048#(<= ~counter~0 8)} assume !(~r~0 < 0); {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,244 INFO L290 TraceCheckUtils]: 81: Hoare triple {22048#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22073#(<= |main_#t~post6| 8)} is VALID [2022-04-08 06:01:29,244 INFO L290 TraceCheckUtils]: 82: Hoare triple {22073#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {21817#false} is VALID [2022-04-08 06:01:29,244 INFO L272 TraceCheckUtils]: 83: Hoare triple {21817#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)); {21817#false} is VALID [2022-04-08 06:01:29,245 INFO L290 TraceCheckUtils]: 84: Hoare triple {21817#false} ~cond := #in~cond; {21817#false} is VALID [2022-04-08 06:01:29,245 INFO L290 TraceCheckUtils]: 85: Hoare triple {21817#false} assume 0 == ~cond; {21817#false} is VALID [2022-04-08 06:01:29,245 INFO L290 TraceCheckUtils]: 86: Hoare triple {21817#false} assume !false; {21817#false} is VALID [2022-04-08 06:01:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:29,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:29,631 INFO L290 TraceCheckUtils]: 86: Hoare triple {21817#false} assume !false; {21817#false} is VALID [2022-04-08 06:01:29,632 INFO L290 TraceCheckUtils]: 85: Hoare triple {21817#false} assume 0 == ~cond; {21817#false} is VALID [2022-04-08 06:01:29,632 INFO L290 TraceCheckUtils]: 84: Hoare triple {21817#false} ~cond := #in~cond; {21817#false} is VALID [2022-04-08 06:01:29,632 INFO L272 TraceCheckUtils]: 83: Hoare triple {21817#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)); {21817#false} is VALID [2022-04-08 06:01:29,632 INFO L290 TraceCheckUtils]: 82: Hoare triple {22101#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {21817#false} is VALID [2022-04-08 06:01:29,632 INFO L290 TraceCheckUtils]: 81: Hoare triple {22105#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22101#(< |main_#t~post6| 10)} is VALID [2022-04-08 06:01:29,633 INFO L290 TraceCheckUtils]: 80: Hoare triple {22105#(< ~counter~0 10)} assume !(~r~0 < 0); {22105#(< ~counter~0 10)} is VALID [2022-04-08 06:01:29,633 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21816#true} {22105#(< ~counter~0 10)} #98#return; {22105#(< ~counter~0 10)} is VALID [2022-04-08 06:01:29,633 INFO L290 TraceCheckUtils]: 78: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,633 INFO L290 TraceCheckUtils]: 77: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,633 INFO L290 TraceCheckUtils]: 76: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,633 INFO L272 TraceCheckUtils]: 75: Hoare triple {22105#(< ~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)); {21816#true} is VALID [2022-04-08 06:01:29,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {22105#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {22105#(< ~counter~0 10)} is VALID [2022-04-08 06:01:29,634 INFO L290 TraceCheckUtils]: 73: Hoare triple {22048#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22105#(< ~counter~0 10)} is VALID [2022-04-08 06:01:29,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {22048#(<= ~counter~0 8)} assume !(~r~0 > 0); {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,635 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21816#true} {22048#(<= ~counter~0 8)} #96#return; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,635 INFO L272 TraceCheckUtils]: 67: Hoare triple {22048#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {22048#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {22023#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22048#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:29,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {22023#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,637 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21816#true} {22023#(<= ~counter~0 7)} #96#return; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,637 INFO L290 TraceCheckUtils]: 62: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,637 INFO L272 TraceCheckUtils]: 59: Hoare triple {22023#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {22023#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {21998#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:29,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {21998#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,639 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21816#true} {21998#(<= ~counter~0 6)} #94#return; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {21998#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {21998#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {21973#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21998#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:29,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {21973#(<= ~counter~0 5)} assume !(~r~0 < 0); {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,640 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21816#true} {21973#(<= ~counter~0 5)} #98#return; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,640 INFO L290 TraceCheckUtils]: 46: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,641 INFO L272 TraceCheckUtils]: 43: Hoare triple {21973#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {21973#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {21948#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21973#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:29,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {21948#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,642 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21816#true} {21948#(<= ~counter~0 4)} #98#return; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,642 INFO L272 TraceCheckUtils]: 35: Hoare triple {21948#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {21948#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {21923#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:29,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {21923#(<= ~counter~0 3)} assume !(~r~0 > 0); {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,644 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21816#true} {21923#(<= ~counter~0 3)} #96#return; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,644 INFO L272 TraceCheckUtils]: 27: Hoare triple {21923#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {21923#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {21898#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21923#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:29,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {21898#(<= ~counter~0 2)} assume !!(0 != ~r~0); {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,646 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21816#true} {21898#(<= ~counter~0 2)} #94#return; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,646 INFO L272 TraceCheckUtils]: 19: Hoare triple {21898#(<= ~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)); {21816#true} is VALID [2022-04-08 06:01:29,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {21898#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {21873#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21898#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:29,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {21873#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,647 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21816#true} {21873#(<= ~counter~0 1)} #92#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,647 INFO L272 TraceCheckUtils]: 11: Hoare triple {21873#(<= ~counter~0 1)} 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)); {21816#true} is VALID [2022-04-08 06:01:29,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21816#true} {21873#(<= ~counter~0 1)} #90#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-08 06:01:29,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-08 06:01:29,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-08 06:01:29,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {21873#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21816#true} is VALID [2022-04-08 06:01:29,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {21873#(<= ~counter~0 1)} 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; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {21873#(<= ~counter~0 1)} call #t~ret9 := main(); {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21873#(<= ~counter~0 1)} {21816#true} #102#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {21873#(<= ~counter~0 1)} assume true; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {21816#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; {21873#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:29,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {21816#true} call ULTIMATE.init(); {21816#true} is VALID [2022-04-08 06:01:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 06:01:29,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753125982] [2022-04-08 06:01:29,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149608705] [2022-04-08 06:01:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149608705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:29,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:29,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 06:01:29,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1270026123] [2022-04-08 06:01:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1270026123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:29,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:29,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:01:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913422633] [2022-04-08 06:01:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:29,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-08 06:01:29,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:29,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:29,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:29,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:01:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:01:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:29,738 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:30,559 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-08 06:01:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 06:01:30,559 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-08 06:01:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 06:01:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-08 06:01:30,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-08 06:01:30,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:30,733 INFO L225 Difference]: With dead ends: 188 [2022-04-08 06:01:30,733 INFO L226 Difference]: Without dead ends: 183 [2022-04-08 06:01:30,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:01:30,734 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:30,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 216 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:01:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-08 06:01:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-08 06:01:30,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:30,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:01:30,979 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:01:30,979 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:01:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:30,983 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 06:01:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 06:01:30,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:30,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:30,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 06:01:30,984 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-08 06:01:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:30,988 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-08 06:01:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-08 06:01:30,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:30,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:30,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:30,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-08 06:01:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-08 06:01:30,993 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-08 06:01:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:30,993 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-08 06:01:30,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:30,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-08 06:01:33,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 222 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-08 06:01:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 06:01:33,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:33,425 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 3, 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] [2022-04-08 06:01:33,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:33,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:33,639 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:33,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-08 06:01:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:33,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443401919] [2022-04-08 06:01:33,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-08 06:01:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:33,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463787370] [2022-04-08 06:01:33,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:33,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:33,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991784456] [2022-04-08 06:01:33,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:01:33,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:33,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:33,653 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:33,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 06:01:33,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:01:33,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:33,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 06:01:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:33,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:33,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {23457#true} call ULTIMATE.init(); {23457#true} is VALID [2022-04-08 06:01:33,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {23457#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; {23457#true} is VALID [2022-04-08 06:01:33,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23457#true} {23457#true} #102#return; {23457#true} is VALID [2022-04-08 06:01:33,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {23457#true} call #t~ret9 := main(); {23457#true} is VALID [2022-04-08 06:01:33,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {23457#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; {23457#true} is VALID [2022-04-08 06:01:33,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {23457#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23457#true} {23457#true} #90#return; {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {23457#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)); {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23457#true} {23457#true} #92#return; {23457#true} is VALID [2022-04-08 06:01:33,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {23457#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,969 INFO L272 TraceCheckUtils]: 19: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:33,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,970 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,971 INFO L272 TraceCheckUtils]: 27: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:33,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,971 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 > 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,972 INFO L272 TraceCheckUtils]: 35: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:33,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,973 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,974 INFO L272 TraceCheckUtils]: 43: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:33,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,974 INFO L290 TraceCheckUtils]: 45: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,974 INFO L290 TraceCheckUtils]: 46: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,974 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 < 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,975 INFO L272 TraceCheckUtils]: 51: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:33,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,976 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,977 INFO L272 TraceCheckUtils]: 59: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:33,977 INFO L290 TraceCheckUtils]: 60: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,977 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:33,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,978 INFO L272 TraceCheckUtils]: 67: Hoare triple {23655#(< 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)); {23457#true} is VALID [2022-04-08 06:01:33,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,979 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #96#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,979 INFO L290 TraceCheckUtils]: 72: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,980 INFO L290 TraceCheckUtils]: 73: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,980 INFO L272 TraceCheckUtils]: 75: Hoare triple {23655#(< 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)); {23457#true} is VALID [2022-04-08 06:01:33,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:33,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:33,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:33,981 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #98#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:33,981 INFO L290 TraceCheckUtils]: 80: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 81: Hoare triple {23458#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 82: Hoare triple {23458#false} assume !(#t~post8 < 10);havoc #t~post8; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 83: Hoare triple {23458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 84: Hoare triple {23458#false} assume !(#t~post6 < 10);havoc #t~post6; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L272 TraceCheckUtils]: 85: Hoare triple {23458#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)); {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 86: Hoare triple {23458#false} ~cond := #in~cond; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 87: Hoare triple {23458#false} assume 0 == ~cond; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L290 TraceCheckUtils]: 88: Hoare triple {23458#false} assume !false; {23458#false} is VALID [2022-04-08 06:01:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-08 06:01:33,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:34,238 INFO L290 TraceCheckUtils]: 88: Hoare triple {23458#false} assume !false; {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L290 TraceCheckUtils]: 87: Hoare triple {23458#false} assume 0 == ~cond; {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L290 TraceCheckUtils]: 86: Hoare triple {23458#false} ~cond := #in~cond; {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L272 TraceCheckUtils]: 85: Hoare triple {23458#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)); {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {23458#false} assume !(#t~post6 < 10);havoc #t~post6; {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {23458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {23458#false} assume !(#t~post8 < 10);havoc #t~post8; {23458#false} is VALID [2022-04-08 06:01:34,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {23458#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23458#false} is VALID [2022-04-08 06:01:34,240 INFO L290 TraceCheckUtils]: 80: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23458#false} is VALID [2022-04-08 06:01:34,240 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #98#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,240 INFO L290 TraceCheckUtils]: 78: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,240 INFO L290 TraceCheckUtils]: 77: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,241 INFO L272 TraceCheckUtils]: 75: Hoare triple {23655#(< 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)); {23457#true} is VALID [2022-04-08 06:01:34,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,241 INFO L290 TraceCheckUtils]: 73: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,242 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #96#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,242 INFO L272 TraceCheckUtils]: 67: Hoare triple {23655#(< 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)); {23457#true} is VALID [2022-04-08 06:01:34,242 INFO L290 TraceCheckUtils]: 66: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-08 06:01:34,247 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,248 INFO L290 TraceCheckUtils]: 62: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,248 INFO L290 TraceCheckUtils]: 61: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,248 INFO L272 TraceCheckUtils]: 59: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:34,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,250 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,250 INFO L272 TraceCheckUtils]: 51: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:34,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 < 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,252 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,252 INFO L290 TraceCheckUtils]: 46: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,252 INFO L290 TraceCheckUtils]: 45: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,252 INFO L290 TraceCheckUtils]: 44: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,252 INFO L272 TraceCheckUtils]: 43: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:34,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,254 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,254 INFO L272 TraceCheckUtils]: 35: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:34,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 > 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,256 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,256 INFO L272 TraceCheckUtils]: 27: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:34,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,258 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,258 INFO L272 TraceCheckUtils]: 19: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-08 06:01:34,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {23457#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-08 06:01:34,259 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23457#true} {23457#true} #92#return; {23457#true} is VALID [2022-04-08 06:01:34,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {23457#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)); {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23457#true} {23457#true} #90#return; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {23457#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {23457#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; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {23457#true} call #t~ret9 := main(); {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23457#true} {23457#true} #102#return; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {23457#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; {23457#true} is VALID [2022-04-08 06:01:34,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {23457#true} call ULTIMATE.init(); {23457#true} is VALID [2022-04-08 06:01:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-08 06:01:34,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:34,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463787370] [2022-04-08 06:01:34,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:34,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991784456] [2022-04-08 06:01:34,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991784456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:34,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:34,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-08 06:01:34,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:34,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443401919] [2022-04-08 06:01:34,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443401919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:34,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:34,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:34,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651921761] [2022-04-08 06:01:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:34,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-08 06:01:34,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:34,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:34,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:34,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:01:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:01:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:01:34,305 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:35,002 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-08 06:01:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:01:35,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-08 06:01:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 06:01:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-08 06:01:35,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-08 06:01:35,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:35,124 INFO L225 Difference]: With dead ends: 407 [2022-04-08 06:01:35,125 INFO L226 Difference]: Without dead ends: 301 [2022-04-08 06:01:35,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-08 06:01:35,126 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:35,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-08 06:01:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-08 06:01:35,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:35,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:01:35,607 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:01:35,607 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:01:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:35,616 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 06:01:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 06:01:35,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:35,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:35,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 06:01:35,619 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-08 06:01:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:35,626 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-08 06:01:35,626 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-08 06:01:35,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:35,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:35,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:35,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-08 06:01:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-08 06:01:35,636 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-08 06:01:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:35,636 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-08 06:01:35,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:35,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-08 06:01:36,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-08 06:01:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 06:01:36,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:36,564 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 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, 1, 1, 1] [2022-04-08 06:01:36,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-08 06:01:36,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 06:01:36,765 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-08 06:01:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:36,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198249560] [2022-04-08 06:01:36,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:36,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-08 06:01:36,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:36,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461276875] [2022-04-08 06:01:36,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:36,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:36,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:36,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617819183] [2022-04-08 06:01:36,782 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:01:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:36,784 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:36,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 06:01:36,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:01:36,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:36,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:01:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:36,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:37,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {26004#true} call ULTIMATE.init(); {26004#true} is VALID [2022-04-08 06:01:37,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {26004#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; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26012#(<= ~counter~0 0)} {26004#true} #102#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {26012#(<= ~counter~0 0)} call #t~ret9 := main(); {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {26012#(<= ~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; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {26012#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {26012#(<= ~counter~0 0)} ~cond := #in~cond; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {26012#(<= ~counter~0 0)} assume !(0 == ~cond); {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26012#(<= ~counter~0 0)} {26012#(<= ~counter~0 0)} #90#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,495 INFO L272 TraceCheckUtils]: 11: Hoare triple {26012#(<= ~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)); {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {26012#(<= ~counter~0 0)} ~cond := #in~cond; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {26012#(<= ~counter~0 0)} assume !(0 == ~cond); {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,496 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26012#(<= ~counter~0 0)} {26012#(<= ~counter~0 0)} #92#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {26012#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {26012#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {26061#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,498 INFO L272 TraceCheckUtils]: 19: Hoare triple {26061#(<= ~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)); {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {26061#(<= ~counter~0 1)} ~cond := #in~cond; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {26061#(<= ~counter~0 1)} assume !(0 == ~cond); {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {26061#(<= ~counter~0 1)} assume true; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,499 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26061#(<= ~counter~0 1)} {26061#(<= ~counter~0 1)} #94#return; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {26061#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {26061#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {26086#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,501 INFO L272 TraceCheckUtils]: 27: Hoare triple {26086#(<= ~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)); {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {26086#(<= ~counter~0 2)} ~cond := #in~cond; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {26086#(<= ~counter~0 2)} assume !(0 == ~cond); {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {26086#(<= ~counter~0 2)} assume true; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,502 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26086#(<= ~counter~0 2)} {26086#(<= ~counter~0 2)} #96#return; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {26086#(<= ~counter~0 2)} assume !(~r~0 > 0); {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {26086#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {26111#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,504 INFO L272 TraceCheckUtils]: 35: Hoare triple {26111#(<= ~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)); {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {26111#(<= ~counter~0 3)} ~cond := #in~cond; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {26111#(<= ~counter~0 3)} assume !(0 == ~cond); {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {26111#(<= ~counter~0 3)} assume true; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,505 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26111#(<= ~counter~0 3)} {26111#(<= ~counter~0 3)} #98#return; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {26111#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {26111#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {26136#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,506 INFO L272 TraceCheckUtils]: 43: Hoare triple {26136#(<= ~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)); {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {26136#(<= ~counter~0 4)} ~cond := #in~cond; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {26136#(<= ~counter~0 4)} assume !(0 == ~cond); {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {26136#(<= ~counter~0 4)} assume true; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,508 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26136#(<= ~counter~0 4)} {26136#(<= ~counter~0 4)} #98#return; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,508 INFO L290 TraceCheckUtils]: 48: Hoare triple {26136#(<= ~counter~0 4)} assume !(~r~0 < 0); {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {26136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {26161#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,509 INFO L272 TraceCheckUtils]: 51: Hoare triple {26161#(<= ~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)); {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {26161#(<= ~counter~0 5)} ~cond := #in~cond; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {26161#(<= ~counter~0 5)} assume !(0 == ~cond); {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,510 INFO L290 TraceCheckUtils]: 54: Hoare triple {26161#(<= ~counter~0 5)} assume true; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,511 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26161#(<= ~counter~0 5)} {26161#(<= ~counter~0 5)} #94#return; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {26161#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {26161#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {26186#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,512 INFO L272 TraceCheckUtils]: 59: Hoare triple {26186#(<= ~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)); {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {26186#(<= ~counter~0 6)} ~cond := #in~cond; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {26186#(<= ~counter~0 6)} assume !(0 == ~cond); {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {26186#(<= ~counter~0 6)} assume true; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,522 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26186#(<= ~counter~0 6)} {26186#(<= ~counter~0 6)} #96#return; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {26186#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,523 INFO L290 TraceCheckUtils]: 65: Hoare triple {26186#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {26211#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,524 INFO L272 TraceCheckUtils]: 67: Hoare triple {26211#(<= ~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)); {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {26211#(<= ~counter~0 7)} ~cond := #in~cond; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {26211#(<= ~counter~0 7)} assume !(0 == ~cond); {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {26211#(<= ~counter~0 7)} assume true; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,525 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26211#(<= ~counter~0 7)} {26211#(<= ~counter~0 7)} #96#return; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,525 INFO L290 TraceCheckUtils]: 72: Hoare triple {26211#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,526 INFO L290 TraceCheckUtils]: 73: Hoare triple {26211#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,526 INFO L290 TraceCheckUtils]: 74: Hoare triple {26236#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,527 INFO L272 TraceCheckUtils]: 75: Hoare triple {26236#(<= ~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)); {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,527 INFO L290 TraceCheckUtils]: 76: Hoare triple {26236#(<= ~counter~0 8)} ~cond := #in~cond; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,527 INFO L290 TraceCheckUtils]: 77: Hoare triple {26236#(<= ~counter~0 8)} assume !(0 == ~cond); {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,527 INFO L290 TraceCheckUtils]: 78: Hoare triple {26236#(<= ~counter~0 8)} assume true; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,528 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26236#(<= ~counter~0 8)} {26236#(<= ~counter~0 8)} #96#return; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,528 INFO L290 TraceCheckUtils]: 80: Hoare triple {26236#(<= ~counter~0 8)} assume !(~r~0 > 0); {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,529 INFO L290 TraceCheckUtils]: 81: Hoare triple {26236#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:37,529 INFO L290 TraceCheckUtils]: 82: Hoare triple {26261#(<= ~counter~0 9)} assume !(#t~post8 < 10);havoc #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:37,529 INFO L290 TraceCheckUtils]: 83: Hoare triple {26261#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26268#(<= |main_#t~post6| 9)} is VALID [2022-04-08 06:01:37,530 INFO L290 TraceCheckUtils]: 84: Hoare triple {26268#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {26005#false} is VALID [2022-04-08 06:01:37,530 INFO L272 TraceCheckUtils]: 85: Hoare triple {26005#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)); {26005#false} is VALID [2022-04-08 06:01:37,530 INFO L290 TraceCheckUtils]: 86: Hoare triple {26005#false} ~cond := #in~cond; {26005#false} is VALID [2022-04-08 06:01:37,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {26005#false} assume 0 == ~cond; {26005#false} is VALID [2022-04-08 06:01:37,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {26005#false} assume !false; {26005#false} is VALID [2022-04-08 06:01:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:37,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:37,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {26005#false} assume !false; {26005#false} is VALID [2022-04-08 06:01:37,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {26005#false} assume 0 == ~cond; {26005#false} is VALID [2022-04-08 06:01:37,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {26005#false} ~cond := #in~cond; {26005#false} is VALID [2022-04-08 06:01:37,928 INFO L272 TraceCheckUtils]: 85: Hoare triple {26005#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)); {26005#false} is VALID [2022-04-08 06:01:37,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {26268#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {26005#false} is VALID [2022-04-08 06:01:37,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {26261#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26268#(<= |main_#t~post6| 9)} is VALID [2022-04-08 06:01:37,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {26261#(<= ~counter~0 9)} assume !(#t~post8 < 10);havoc #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:37,930 INFO L290 TraceCheckUtils]: 81: Hoare triple {26236#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:37,930 INFO L290 TraceCheckUtils]: 80: Hoare triple {26236#(<= ~counter~0 8)} assume !(~r~0 > 0); {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,931 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26004#true} {26236#(<= ~counter~0 8)} #96#return; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,931 INFO L290 TraceCheckUtils]: 78: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,931 INFO L290 TraceCheckUtils]: 77: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,931 INFO L272 TraceCheckUtils]: 75: Hoare triple {26236#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,931 INFO L290 TraceCheckUtils]: 74: Hoare triple {26236#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {26211#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:37,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {26211#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,933 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26004#true} {26211#(<= ~counter~0 7)} #96#return; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,933 INFO L272 TraceCheckUtils]: 67: Hoare triple {26211#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {26211#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {26186#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:37,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {26186#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,936 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26004#true} {26186#(<= ~counter~0 6)} #96#return; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,936 INFO L272 TraceCheckUtils]: 59: Hoare triple {26186#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {26186#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {26161#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:37,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {26161#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,939 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26004#true} {26161#(<= ~counter~0 5)} #94#return; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,939 INFO L272 TraceCheckUtils]: 51: Hoare triple {26161#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {26161#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {26136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:37,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {26136#(<= ~counter~0 4)} assume !(~r~0 < 0); {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,941 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26004#true} {26136#(<= ~counter~0 4)} #98#return; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,941 INFO L272 TraceCheckUtils]: 43: Hoare triple {26136#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {26136#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {26111#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:37,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {26111#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,943 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26004#true} {26111#(<= ~counter~0 3)} #98#return; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,944 INFO L272 TraceCheckUtils]: 35: Hoare triple {26111#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {26111#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {26086#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:37,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {26086#(<= ~counter~0 2)} assume !(~r~0 > 0); {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,946 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26004#true} {26086#(<= ~counter~0 2)} #96#return; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,946 INFO L272 TraceCheckUtils]: 27: Hoare triple {26086#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {26086#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {26061#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:37,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {26061#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26004#true} {26061#(<= ~counter~0 1)} #94#return; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,949 INFO L272 TraceCheckUtils]: 19: Hoare triple {26061#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {26061#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {26012#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:37,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {26012#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26004#true} {26012#(<= ~counter~0 0)} #92#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,951 INFO L272 TraceCheckUtils]: 11: Hoare triple {26012#(<= ~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)); {26004#true} is VALID [2022-04-08 06:01:37,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26004#true} {26012#(<= ~counter~0 0)} #90#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-08 06:01:37,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-08 06:01:37,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-08 06:01:37,952 INFO L272 TraceCheckUtils]: 6: Hoare triple {26012#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26004#true} is VALID [2022-04-08 06:01:37,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {26012#(<= ~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; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {26012#(<= ~counter~0 0)} call #t~ret9 := main(); {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26012#(<= ~counter~0 0)} {26004#true} #102#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {26004#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; {26012#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:37,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {26004#true} call ULTIMATE.init(); {26004#true} is VALID [2022-04-08 06:01:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 06:01:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:37,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461276875] [2022-04-08 06:01:37,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:37,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617819183] [2022-04-08 06:01:37,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617819183] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:37,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:37,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 06:01:37,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:37,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198249560] [2022-04-08 06:01:37,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198249560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:37,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:37,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:01:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286244213] [2022-04-08 06:01:37,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:37,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-08 06:01:37,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:37,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:38,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:38,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:01:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:38,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:01:38,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:01:38,060 INFO L87 Difference]: Start difference. First operand 296 states and 395 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:39,236 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-08 06:01:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:01:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-08 06:01:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:01:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:01:39,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 06:01:39,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:39,427 INFO L225 Difference]: With dead ends: 362 [2022-04-08 06:01:39,427 INFO L226 Difference]: Without dead ends: 357 [2022-04-08 06:01:39,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2022-04-08 06:01:39,428 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:39,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 240 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:01:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-08 06:01:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-08 06:01:39,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:39,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:39,928 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:39,928 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:39,937 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 06:01:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 06:01:39,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:39,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:39,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 06:01:39,944 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-08 06:01:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:39,953 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-08 06:01:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-08 06:01:39,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:39,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:39,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:39,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-08 06:01:39,966 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-08 06:01:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:39,966 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-08 06:01:39,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:39,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-08 06:01:42,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 459 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-08 06:01:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 06:01:42,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:42,982 INFO L499 BasicCegarLoop]: 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-08 06:01:42,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:43,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 06:01:43,183 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:43,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-08 06:01:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:43,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721591094] [2022-04-08 06:01:43,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-08 06:01:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:43,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037967573] [2022-04-08 06:01:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:43,198 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1195960716] [2022-04-08 06:01:43,198 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 06:01:43,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:43,199 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:43,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 06:01:43,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 06:01:43,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:43,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:01:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:43,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:43,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {28684#true} call ULTIMATE.init(); {28684#true} is VALID [2022-04-08 06:01:43,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {28684#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; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28692#(<= ~counter~0 0)} {28684#true} #102#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {28692#(<= ~counter~0 0)} call #t~ret9 := main(); {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {28692#(<= ~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; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {28692#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {28692#(<= ~counter~0 0)} ~cond := #in~cond; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {28692#(<= ~counter~0 0)} assume !(0 == ~cond); {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28692#(<= ~counter~0 0)} {28692#(<= ~counter~0 0)} #90#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,792 INFO L272 TraceCheckUtils]: 11: Hoare triple {28692#(<= ~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)); {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {28692#(<= ~counter~0 0)} ~cond := #in~cond; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {28692#(<= ~counter~0 0)} assume !(0 == ~cond); {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,793 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28692#(<= ~counter~0 0)} {28692#(<= ~counter~0 0)} #92#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {28692#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28692#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:43,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {28692#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {28741#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {28741#(<= ~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)); {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {28741#(<= ~counter~0 1)} ~cond := #in~cond; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {28741#(<= ~counter~0 1)} assume !(0 == ~cond); {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {28741#(<= ~counter~0 1)} assume true; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28741#(<= ~counter~0 1)} {28741#(<= ~counter~0 1)} #94#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {28741#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:43,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {28741#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {28766#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,798 INFO L272 TraceCheckUtils]: 27: Hoare triple {28766#(<= ~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)); {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {28766#(<= ~counter~0 2)} ~cond := #in~cond; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {28766#(<= ~counter~0 2)} assume !(0 == ~cond); {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {28766#(<= ~counter~0 2)} assume true; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28766#(<= ~counter~0 2)} {28766#(<= ~counter~0 2)} #96#return; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {28766#(<= ~counter~0 2)} assume !(~r~0 > 0); {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:43,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {28766#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,800 INFO L290 TraceCheckUtils]: 34: Hoare triple {28791#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,801 INFO L272 TraceCheckUtils]: 35: Hoare triple {28791#(<= ~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)); {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {28791#(<= ~counter~0 3)} ~cond := #in~cond; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {28791#(<= ~counter~0 3)} assume !(0 == ~cond); {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {28791#(<= ~counter~0 3)} assume true; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,807 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28791#(<= ~counter~0 3)} {28791#(<= ~counter~0 3)} #98#return; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {28791#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:43,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {28791#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {28816#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,809 INFO L272 TraceCheckUtils]: 43: Hoare triple {28816#(<= ~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)); {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {28816#(<= ~counter~0 4)} ~cond := #in~cond; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {28816#(<= ~counter~0 4)} assume !(0 == ~cond); {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {28816#(<= ~counter~0 4)} assume true; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,811 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28816#(<= ~counter~0 4)} {28816#(<= ~counter~0 4)} #98#return; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {28816#(<= ~counter~0 4)} assume !(~r~0 < 0); {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:43,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {28816#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {28841#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,812 INFO L272 TraceCheckUtils]: 51: Hoare triple {28841#(<= ~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)); {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {28841#(<= ~counter~0 5)} ~cond := #in~cond; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {28841#(<= ~counter~0 5)} assume !(0 == ~cond); {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {28841#(<= ~counter~0 5)} assume true; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,814 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28841#(<= ~counter~0 5)} {28841#(<= ~counter~0 5)} #94#return; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {28841#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:43,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {28841#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {28866#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,815 INFO L272 TraceCheckUtils]: 59: Hoare triple {28866#(<= ~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)); {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {28866#(<= ~counter~0 6)} ~cond := #in~cond; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,816 INFO L290 TraceCheckUtils]: 61: Hoare triple {28866#(<= ~counter~0 6)} assume !(0 == ~cond); {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {28866#(<= ~counter~0 6)} assume true; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,816 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28866#(<= ~counter~0 6)} {28866#(<= ~counter~0 6)} #96#return; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,817 INFO L290 TraceCheckUtils]: 64: Hoare triple {28866#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:43,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {28866#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,818 INFO L290 TraceCheckUtils]: 66: Hoare triple {28891#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,818 INFO L272 TraceCheckUtils]: 67: Hoare triple {28891#(<= ~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)); {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {28891#(<= ~counter~0 7)} ~cond := #in~cond; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,819 INFO L290 TraceCheckUtils]: 69: Hoare triple {28891#(<= ~counter~0 7)} assume !(0 == ~cond); {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {28891#(<= ~counter~0 7)} assume true; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,819 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28891#(<= ~counter~0 7)} {28891#(<= ~counter~0 7)} #96#return; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {28891#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:43,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {28891#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,821 INFO L290 TraceCheckUtils]: 74: Hoare triple {28916#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,821 INFO L272 TraceCheckUtils]: 75: Hoare triple {28916#(<= ~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)); {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,821 INFO L290 TraceCheckUtils]: 76: Hoare triple {28916#(<= ~counter~0 8)} ~cond := #in~cond; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {28916#(<= ~counter~0 8)} assume !(0 == ~cond); {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {28916#(<= ~counter~0 8)} assume true; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,822 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28916#(<= ~counter~0 8)} {28916#(<= ~counter~0 8)} #96#return; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {28916#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {28916#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28941#(<= |main_#t~post7| 8)} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {28941#(<= |main_#t~post7| 8)} assume !(#t~post7 < 10);havoc #t~post7; {28685#false} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {28685#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28685#false} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {28685#false} assume !(#t~post8 < 10);havoc #t~post8; {28685#false} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {28685#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28685#false} is VALID [2022-04-08 06:01:43,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {28685#false} assume !(#t~post6 < 10);havoc #t~post6; {28685#false} is VALID [2022-04-08 06:01:43,823 INFO L272 TraceCheckUtils]: 87: Hoare triple {28685#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)); {28685#false} is VALID [2022-04-08 06:01:43,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {28685#false} ~cond := #in~cond; {28685#false} is VALID [2022-04-08 06:01:43,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {28685#false} assume 0 == ~cond; {28685#false} is VALID [2022-04-08 06:01:43,824 INFO L290 TraceCheckUtils]: 90: Hoare triple {28685#false} assume !false; {28685#false} is VALID [2022-04-08 06:01:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:01:43,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:44,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {28685#false} assume !false; {28685#false} is VALID [2022-04-08 06:01:44,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {28685#false} assume 0 == ~cond; {28685#false} is VALID [2022-04-08 06:01:44,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {28685#false} ~cond := #in~cond; {28685#false} is VALID [2022-04-08 06:01:44,303 INFO L272 TraceCheckUtils]: 87: Hoare triple {28685#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)); {28685#false} is VALID [2022-04-08 06:01:44,303 INFO L290 TraceCheckUtils]: 86: Hoare triple {28685#false} assume !(#t~post6 < 10);havoc #t~post6; {28685#false} is VALID [2022-04-08 06:01:44,303 INFO L290 TraceCheckUtils]: 85: Hoare triple {28685#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28685#false} is VALID [2022-04-08 06:01:44,303 INFO L290 TraceCheckUtils]: 84: Hoare triple {28685#false} assume !(#t~post8 < 10);havoc #t~post8; {28685#false} is VALID [2022-04-08 06:01:44,304 INFO L290 TraceCheckUtils]: 83: Hoare triple {28685#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28685#false} is VALID [2022-04-08 06:01:44,304 INFO L290 TraceCheckUtils]: 82: Hoare triple {28993#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {28685#false} is VALID [2022-04-08 06:01:44,305 INFO L290 TraceCheckUtils]: 81: Hoare triple {28997#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28993#(< |main_#t~post7| 10)} is VALID [2022-04-08 06:01:44,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {28997#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28997#(< ~counter~0 10)} is VALID [2022-04-08 06:01:44,306 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28684#true} {28997#(< ~counter~0 10)} #96#return; {28997#(< ~counter~0 10)} is VALID [2022-04-08 06:01:44,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,306 INFO L290 TraceCheckUtils]: 77: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,306 INFO L290 TraceCheckUtils]: 76: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,306 INFO L272 TraceCheckUtils]: 75: Hoare triple {28997#(< ~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)); {28684#true} is VALID [2022-04-08 06:01:44,307 INFO L290 TraceCheckUtils]: 74: Hoare triple {28997#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {28997#(< ~counter~0 10)} is VALID [2022-04-08 06:01:44,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {28916#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28997#(< ~counter~0 10)} is VALID [2022-04-08 06:01:44,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {28916#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:44,309 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28684#true} {28916#(<= ~counter~0 8)} #96#return; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:44,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,309 INFO L290 TraceCheckUtils]: 68: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,309 INFO L272 TraceCheckUtils]: 67: Hoare triple {28916#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {28916#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:44,310 INFO L290 TraceCheckUtils]: 65: Hoare triple {28891#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:44,310 INFO L290 TraceCheckUtils]: 64: Hoare triple {28891#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:44,311 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28684#true} {28891#(<= ~counter~0 7)} #96#return; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:44,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,311 INFO L272 TraceCheckUtils]: 59: Hoare triple {28891#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {28891#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:44,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {28866#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:44,313 INFO L290 TraceCheckUtils]: 56: Hoare triple {28866#(<= ~counter~0 6)} assume !!(0 != ~r~0); {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:44,313 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28684#true} {28866#(<= ~counter~0 6)} #94#return; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:44,313 INFO L290 TraceCheckUtils]: 54: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,313 INFO L272 TraceCheckUtils]: 51: Hoare triple {28866#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {28866#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:44,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {28841#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28866#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:44,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {28841#(<= ~counter~0 5)} assume !(~r~0 < 0); {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:44,315 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28684#true} {28841#(<= ~counter~0 5)} #98#return; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:44,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,316 INFO L272 TraceCheckUtils]: 43: Hoare triple {28841#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {28841#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:44,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {28816#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28841#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:44,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {28816#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,318 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28684#true} {28816#(<= ~counter~0 4)} #98#return; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,318 INFO L272 TraceCheckUtils]: 35: Hoare triple {28816#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {28816#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {28791#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:44,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {28791#(<= ~counter~0 3)} assume !(~r~0 > 0); {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,320 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28684#true} {28791#(<= ~counter~0 3)} #96#return; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,320 INFO L272 TraceCheckUtils]: 27: Hoare triple {28791#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {28791#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {28766#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28791#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:44,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {28766#(<= ~counter~0 2)} assume !!(0 != ~r~0); {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,322 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28684#true} {28766#(<= ~counter~0 2)} #94#return; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,323 INFO L272 TraceCheckUtils]: 19: Hoare triple {28766#(<= ~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)); {28684#true} is VALID [2022-04-08 06:01:44,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {28766#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {28741#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28766#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:44,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {28741#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,325 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28684#true} {28741#(<= ~counter~0 1)} #92#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,325 INFO L272 TraceCheckUtils]: 11: Hoare triple {28741#(<= ~counter~0 1)} 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)); {28684#true} is VALID [2022-04-08 06:01:44,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28684#true} {28741#(<= ~counter~0 1)} #90#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-08 06:01:44,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-08 06:01:44,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-08 06:01:44,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {28741#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28684#true} is VALID [2022-04-08 06:01:44,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {28741#(<= ~counter~0 1)} 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; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {28741#(<= ~counter~0 1)} call #t~ret9 := main(); {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28741#(<= ~counter~0 1)} {28684#true} #102#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {28741#(<= ~counter~0 1)} assume true; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {28684#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; {28741#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:44,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {28684#true} call ULTIMATE.init(); {28684#true} is VALID [2022-04-08 06:01:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-08 06:01:44,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:44,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037967573] [2022-04-08 06:01:44,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195960716] [2022-04-08 06:01:44,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195960716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:44,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:44,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-08 06:01:44,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:44,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721591094] [2022-04-08 06:01:44,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721591094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:44,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:44,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 06:01:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859992056] [2022-04-08 06:01:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-08 06:01:44,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:44,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:44,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:44,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 06:01:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 06:01:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 06:01:44,415 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:45,543 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-08 06:01:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 06:01:45,543 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-08 06:01:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:45,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:01:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-08 06:01:45,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-08 06:01:45,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:45,738 INFO L225 Difference]: With dead ends: 427 [2022-04-08 06:01:45,739 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 06:01:45,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2022-04-08 06:01:45,741 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 104 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:45,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 211 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:01:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 06:01:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 06:01:46,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:46,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:46,263 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:46,263 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:46,271 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 06:01:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:01:46,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:46,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:46,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 06:01:46,274 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-08 06:01:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:46,282 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-08 06:01:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:01:46,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:46,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:46,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:46,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-08 06:01:46,294 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-08 06:01:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:46,294 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-08 06:01:46,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-08 06:01:46,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-08 06:01:48,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-08 06:01:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-08 06:01:48,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:48,898 INFO L499 BasicCegarLoop]: 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-08 06:01:48,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:49,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 06:01:49,098 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:49,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-08 06:01:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837101839] [2022-04-08 06:01:49,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-08 06:01:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:49,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239117782] [2022-04-08 06:01:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:49,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:49,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452174218] [2022-04-08 06:01:49,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:49,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:49,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:49,114 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:49,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 06:01:49,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:49,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:49,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:01:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:49,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:49,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {31479#true} call ULTIMATE.init(); {31479#true} is VALID [2022-04-08 06:01:49,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {31479#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; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31487#(<= ~counter~0 0)} {31479#true} #102#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {31487#(<= ~counter~0 0)} call #t~ret9 := main(); {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {31487#(<= ~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; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,666 INFO L272 TraceCheckUtils]: 6: Hoare triple {31487#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {31487#(<= ~counter~0 0)} ~cond := #in~cond; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {31487#(<= ~counter~0 0)} assume !(0 == ~cond); {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31487#(<= ~counter~0 0)} {31487#(<= ~counter~0 0)} #90#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {31487#(<= ~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)); {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {31487#(<= ~counter~0 0)} ~cond := #in~cond; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {31487#(<= ~counter~0 0)} assume !(0 == ~cond); {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,669 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31487#(<= ~counter~0 0)} {31487#(<= ~counter~0 0)} #92#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {31487#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:49,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {31487#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {31536#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,671 INFO L272 TraceCheckUtils]: 19: Hoare triple {31536#(<= ~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)); {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {31536#(<= ~counter~0 1)} ~cond := #in~cond; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {31536#(<= ~counter~0 1)} assume !(0 == ~cond); {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {31536#(<= ~counter~0 1)} assume true; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,672 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31536#(<= ~counter~0 1)} {31536#(<= ~counter~0 1)} #94#return; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {31536#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:49,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {31536#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {31561#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,674 INFO L272 TraceCheckUtils]: 27: Hoare triple {31561#(<= ~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)); {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {31561#(<= ~counter~0 2)} ~cond := #in~cond; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {31561#(<= ~counter~0 2)} assume !(0 == ~cond); {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {31561#(<= ~counter~0 2)} assume true; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,675 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31561#(<= ~counter~0 2)} {31561#(<= ~counter~0 2)} #96#return; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {31561#(<= ~counter~0 2)} assume !(~r~0 > 0); {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:49,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {31561#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {31586#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,677 INFO L272 TraceCheckUtils]: 35: Hoare triple {31586#(<= ~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)); {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {31586#(<= ~counter~0 3)} ~cond := #in~cond; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {31586#(<= ~counter~0 3)} assume !(0 == ~cond); {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {31586#(<= ~counter~0 3)} assume true; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,678 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31586#(<= ~counter~0 3)} {31586#(<= ~counter~0 3)} #98#return; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {31586#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:49,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {31586#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {31611#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,679 INFO L272 TraceCheckUtils]: 43: Hoare triple {31611#(<= ~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)); {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {31611#(<= ~counter~0 4)} ~cond := #in~cond; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {31611#(<= ~counter~0 4)} assume !(0 == ~cond); {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {31611#(<= ~counter~0 4)} assume true; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,681 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31611#(<= ~counter~0 4)} {31611#(<= ~counter~0 4)} #98#return; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {31611#(<= ~counter~0 4)} assume !(~r~0 < 0); {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:49,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {31611#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {31636#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,682 INFO L272 TraceCheckUtils]: 51: Hoare triple {31636#(<= ~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)); {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {31636#(<= ~counter~0 5)} ~cond := #in~cond; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {31636#(<= ~counter~0 5)} assume !(0 == ~cond); {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {31636#(<= ~counter~0 5)} assume true; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,684 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31636#(<= ~counter~0 5)} {31636#(<= ~counter~0 5)} #94#return; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {31636#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:49,684 INFO L290 TraceCheckUtils]: 57: Hoare triple {31636#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {31661#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,685 INFO L272 TraceCheckUtils]: 59: Hoare triple {31661#(<= ~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)); {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {31661#(<= ~counter~0 6)} ~cond := #in~cond; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {31661#(<= ~counter~0 6)} assume !(0 == ~cond); {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {31661#(<= ~counter~0 6)} assume true; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,686 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31661#(<= ~counter~0 6)} {31661#(<= ~counter~0 6)} #96#return; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {31661#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:49,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {31661#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {31686#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,688 INFO L272 TraceCheckUtils]: 67: Hoare triple {31686#(<= ~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)); {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,688 INFO L290 TraceCheckUtils]: 68: Hoare triple {31686#(<= ~counter~0 7)} ~cond := #in~cond; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,689 INFO L290 TraceCheckUtils]: 69: Hoare triple {31686#(<= ~counter~0 7)} assume !(0 == ~cond); {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,689 INFO L290 TraceCheckUtils]: 70: Hoare triple {31686#(<= ~counter~0 7)} assume true; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,689 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31686#(<= ~counter~0 7)} {31686#(<= ~counter~0 7)} #96#return; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,690 INFO L290 TraceCheckUtils]: 72: Hoare triple {31686#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:49,690 INFO L290 TraceCheckUtils]: 73: Hoare triple {31686#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,690 INFO L290 TraceCheckUtils]: 74: Hoare triple {31711#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,691 INFO L272 TraceCheckUtils]: 75: Hoare triple {31711#(<= ~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)); {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,691 INFO L290 TraceCheckUtils]: 76: Hoare triple {31711#(<= ~counter~0 8)} ~cond := #in~cond; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,691 INFO L290 TraceCheckUtils]: 77: Hoare triple {31711#(<= ~counter~0 8)} assume !(0 == ~cond); {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {31711#(<= ~counter~0 8)} assume true; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,692 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31711#(<= ~counter~0 8)} {31711#(<= ~counter~0 8)} #96#return; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {31711#(<= ~counter~0 8)} assume !(~r~0 > 0); {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:49,693 INFO L290 TraceCheckUtils]: 81: Hoare triple {31711#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,693 INFO L290 TraceCheckUtils]: 82: Hoare triple {31736#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,694 INFO L272 TraceCheckUtils]: 83: Hoare triple {31736#(<= ~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)); {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,694 INFO L290 TraceCheckUtils]: 84: Hoare triple {31736#(<= ~counter~0 9)} ~cond := #in~cond; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,694 INFO L290 TraceCheckUtils]: 85: Hoare triple {31736#(<= ~counter~0 9)} assume !(0 == ~cond); {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,695 INFO L290 TraceCheckUtils]: 86: Hoare triple {31736#(<= ~counter~0 9)} assume true; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,695 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31736#(<= ~counter~0 9)} {31736#(<= ~counter~0 9)} #98#return; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,695 INFO L290 TraceCheckUtils]: 88: Hoare triple {31736#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 89: Hoare triple {31736#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31761#(<= |main_#t~post8| 9)} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 90: Hoare triple {31761#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {31480#false} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 91: Hoare triple {31480#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31480#false} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 92: Hoare triple {31480#false} assume !(#t~post6 < 10);havoc #t~post6; {31480#false} is VALID [2022-04-08 06:01:49,696 INFO L272 TraceCheckUtils]: 93: Hoare triple {31480#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)); {31480#false} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 94: Hoare triple {31480#false} ~cond := #in~cond; {31480#false} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 95: Hoare triple {31480#false} assume 0 == ~cond; {31480#false} is VALID [2022-04-08 06:01:49,696 INFO L290 TraceCheckUtils]: 96: Hoare triple {31480#false} assume !false; {31480#false} is VALID [2022-04-08 06:01:49,697 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-08 06:01:49,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:01:50,107 INFO L290 TraceCheckUtils]: 96: Hoare triple {31480#false} assume !false; {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L290 TraceCheckUtils]: 95: Hoare triple {31480#false} assume 0 == ~cond; {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L290 TraceCheckUtils]: 94: Hoare triple {31480#false} ~cond := #in~cond; {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L272 TraceCheckUtils]: 93: Hoare triple {31480#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)); {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L290 TraceCheckUtils]: 92: Hoare triple {31480#false} assume !(#t~post6 < 10);havoc #t~post6; {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L290 TraceCheckUtils]: 91: Hoare triple {31480#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {31761#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {31480#false} is VALID [2022-04-08 06:01:50,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {31736#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31761#(<= |main_#t~post8| 9)} is VALID [2022-04-08 06:01:50,109 INFO L290 TraceCheckUtils]: 88: Hoare triple {31736#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:50,109 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31479#true} {31736#(<= ~counter~0 9)} #98#return; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:50,109 INFO L290 TraceCheckUtils]: 86: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,109 INFO L290 TraceCheckUtils]: 84: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,109 INFO L272 TraceCheckUtils]: 83: Hoare triple {31736#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,110 INFO L290 TraceCheckUtils]: 82: Hoare triple {31736#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:50,111 INFO L290 TraceCheckUtils]: 81: Hoare triple {31711#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-08 06:01:50,111 INFO L290 TraceCheckUtils]: 80: Hoare triple {31711#(<= ~counter~0 8)} assume !(~r~0 > 0); {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:50,111 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31479#true} {31711#(<= ~counter~0 8)} #96#return; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:50,111 INFO L290 TraceCheckUtils]: 78: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,111 INFO L290 TraceCheckUtils]: 77: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,112 INFO L290 TraceCheckUtils]: 76: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,112 INFO L272 TraceCheckUtils]: 75: Hoare triple {31711#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {31711#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:50,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {31686#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-08 06:01:50,113 INFO L290 TraceCheckUtils]: 72: Hoare triple {31686#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:50,113 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31479#true} {31686#(<= ~counter~0 7)} #96#return; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:50,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,113 INFO L272 TraceCheckUtils]: 67: Hoare triple {31686#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {31686#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:50,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {31661#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-08 06:01:50,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {31661#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:50,115 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31479#true} {31661#(<= ~counter~0 6)} #96#return; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:50,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,115 INFO L272 TraceCheckUtils]: 59: Hoare triple {31661#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {31661#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:50,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {31636#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-08 06:01:50,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {31636#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:50,117 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31479#true} {31636#(<= ~counter~0 5)} #94#return; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:50,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,117 INFO L272 TraceCheckUtils]: 51: Hoare triple {31636#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {31636#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:50,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {31611#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-08 06:01:50,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {31611#(<= ~counter~0 4)} assume !(~r~0 < 0); {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:50,118 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31479#true} {31611#(<= ~counter~0 4)} #98#return; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:50,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,119 INFO L272 TraceCheckUtils]: 43: Hoare triple {31611#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {31611#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:50,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {31586#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-08 06:01:50,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {31586#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:50,120 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31479#true} {31586#(<= ~counter~0 3)} #98#return; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:50,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,120 INFO L272 TraceCheckUtils]: 35: Hoare triple {31586#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {31586#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:50,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {31561#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-08 06:01:50,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {31561#(<= ~counter~0 2)} assume !(~r~0 > 0); {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:50,122 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31479#true} {31561#(<= ~counter~0 2)} #96#return; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:50,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,122 INFO L272 TraceCheckUtils]: 27: Hoare triple {31561#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {31561#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:50,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {31536#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-08 06:01:50,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {31536#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:50,124 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31479#true} {31536#(<= ~counter~0 1)} #94#return; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:50,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,124 INFO L272 TraceCheckUtils]: 19: Hoare triple {31536#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {31536#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:50,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {31487#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-08 06:01:50,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {31487#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31479#true} {31487#(<= ~counter~0 0)} #92#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {31487#(<= ~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)); {31479#true} is VALID [2022-04-08 06:01:50,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31479#true} {31487#(<= ~counter~0 0)} #90#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-08 06:01:50,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-08 06:01:50,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-08 06:01:50,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {31487#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31479#true} is VALID [2022-04-08 06:01:50,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {31487#(<= ~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; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {31487#(<= ~counter~0 0)} call #t~ret9 := main(); {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31487#(<= ~counter~0 0)} {31479#true} #102#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {31479#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; {31487#(<= ~counter~0 0)} is VALID [2022-04-08 06:01:50,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {31479#true} call ULTIMATE.init(); {31479#true} is VALID [2022-04-08 06:01:50,128 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-08 06:01:50,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239117782] [2022-04-08 06:01:50,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:50,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452174218] [2022-04-08 06:01:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452174218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:01:50,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:01:50,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 06:01:50,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:50,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837101839] [2022-04-08 06:01:50,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837101839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:50,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:50,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:01:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933112836] [2022-04-08 06:01:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-08 06:01:50,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:50,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:01:50,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:50,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:01:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:01:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:01:50,200 INFO L87 Difference]: Start difference. First operand 342 states and 456 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:01:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:51,359 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-08 06:01:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 06:01:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-08 06:01:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:01:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 06:01:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:01:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-08 06:01:51,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-08 06:01:51,565 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-08 06:01:51,575 INFO L225 Difference]: With dead ends: 467 [2022-04-08 06:01:51,576 INFO L226 Difference]: Without dead ends: 352 [2022-04-08 06:01:51,576 INFO L912 BasicCegarLoop]: 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-08 06:01:51,577 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:51,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 230 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:01:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-08 06:01:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-08 06:01:52,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:52,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:52,149 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:52,149 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:52,157 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 06:01:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 06:01:52,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:52,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:52,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 06:01:52,159 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-08 06:01:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:52,168 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-08 06:01:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-08 06:01:52,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:52,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:52,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:52,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-08 06:01:52,181 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-08 06:01:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:52,181 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-08 06:01:52,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:01:52,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-08 06:01:55,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-08 06:01:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 06:01:55,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:01:55,141 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:01:55,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 06:01:55,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 06:01:55,341 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:01:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:01:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-08 06:01:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:55,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414549224] [2022-04-08 06:01:55,342 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:01:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-08 06:01:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:01:55,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798617290] [2022-04-08 06:01:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:01:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:01:55,360 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:01:55,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1344442044] [2022-04-08 06:01:55,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:01:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:01:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:01:55,361 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:01:55,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 06:01:55,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:01:55,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:01:55,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 06:01:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:01:55,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:01:55,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {34413#true} call ULTIMATE.init(); {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {34413#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; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34413#true} {34413#true} #102#return; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {34413#true} call #t~ret9 := main(); {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {34413#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; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {34413#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34413#true} {34413#true} #90#return; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34413#true} {34413#true} #92#return; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {34413#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {34413#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {34413#true} assume !!(#t~post6 < 10);havoc #t~post6; {34413#true} is VALID [2022-04-08 06:01:55,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34413#true} {34413#true} #94#return; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {34413#true} assume !!(0 != ~r~0); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L272 TraceCheckUtils]: 27: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {34413#true} assume !(~r~0 > 0); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {34413#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 34: Hoare triple {34413#true} assume !!(#t~post8 < 10);havoc #t~post8; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L272 TraceCheckUtils]: 35: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34413#true} {34413#true} #98#return; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {34413#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {34413#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {34413#true} assume !!(#t~post8 < 10);havoc #t~post8; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L272 TraceCheckUtils]: 43: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34413#true} {34413#true} #98#return; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {34413#true} assume !(~r~0 < 0); {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {34413#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {34413#true} assume !!(#t~post6 < 10);havoc #t~post6; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L272 TraceCheckUtils]: 51: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 52: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,679 INFO L290 TraceCheckUtils]: 53: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34413#true} {34413#true} #94#return; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {34413#true} assume !!(0 != ~r~0); {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 58: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L272 TraceCheckUtils]: 59: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 64: Hoare triple {34413#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34413#true} is VALID [2022-04-08 06:01:55,680 INFO L290 TraceCheckUtils]: 65: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-08 06:01:55,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-08 06:01:55,681 INFO L272 TraceCheckUtils]: 67: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-08 06:01:55,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,681 INFO L290 TraceCheckUtils]: 69: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,681 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-08 06:01:55,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {34413#true} assume !(~r~0 > 0); {34634#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:01:55,688 INFO L290 TraceCheckUtils]: 73: Hoare triple {34634#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34634#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:01:55,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {34634#(not (< 0 main_~r~0))} assume !!(#t~post8 < 10);havoc #t~post8; {34634#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:01:55,688 INFO L272 TraceCheckUtils]: 75: Hoare triple {34634#(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)); {34413#true} is VALID [2022-04-08 06:01:55,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,689 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34413#true} {34634#(not (< 0 main_~r~0))} #98#return; {34634#(not (< 0 main_~r~0))} is VALID [2022-04-08 06:01:55,689 INFO L290 TraceCheckUtils]: 80: Hoare triple {34634#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:55,690 INFO L290 TraceCheckUtils]: 81: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:55,690 INFO L290 TraceCheckUtils]: 82: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:55,690 INFO L272 TraceCheckUtils]: 83: Hoare triple {34659#(and (not (< 0 main_~r~0)) (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)); {34413#true} is VALID [2022-04-08 06:01:55,690 INFO L290 TraceCheckUtils]: 84: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-08 06:01:55,691 INFO L290 TraceCheckUtils]: 85: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-08 06:01:55,691 INFO L290 TraceCheckUtils]: 86: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-08 06:01:55,691 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34413#true} {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 88: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 89: Hoare triple {34414#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 90: Hoare triple {34414#false} assume !(#t~post7 < 10);havoc #t~post7; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 91: Hoare triple {34414#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 92: Hoare triple {34414#false} assume !(#t~post8 < 10);havoc #t~post8; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 93: Hoare triple {34414#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 94: Hoare triple {34414#false} assume !(#t~post6 < 10);havoc #t~post6; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L272 TraceCheckUtils]: 95: Hoare triple {34414#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)); {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 96: Hoare triple {34414#false} ~cond := #in~cond; {34414#false} is VALID [2022-04-08 06:01:55,692 INFO L290 TraceCheckUtils]: 97: Hoare triple {34414#false} assume 0 == ~cond; {34414#false} is VALID [2022-04-08 06:01:55,693 INFO L290 TraceCheckUtils]: 98: Hoare triple {34414#false} assume !false; {34414#false} is VALID [2022-04-08 06:01:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-08 06:01:55,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:01:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:01:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798617290] [2022-04-08 06:01:55,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:01:55,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344442044] [2022-04-08 06:01:55,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344442044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:55,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:55,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:55,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:01:55,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414549224] [2022-04-08 06:01:55,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414549224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:01:55,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:01:55,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:01:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004507256] [2022-04-08 06:01:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:01:55,695 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-08 06:01:55,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:01:55,695 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:55,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:55,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:01:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:01:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:01:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:01:55,747 INFO L87 Difference]: Start difference. First operand 344 states and 457 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:56,569 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-08 06:01:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:01:56,570 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-08 06:01:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:01:56,570 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:01:56,571 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-08 06:01:56,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-08 06:01:56,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:01:56,649 INFO L225 Difference]: With dead ends: 504 [2022-04-08 06:01:56,649 INFO L226 Difference]: Without dead ends: 362 [2022-04-08 06:01:56,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 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-08 06:01:56,651 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:01:56,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:01:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-08 06:01:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-08 06:01:57,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:01:57,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:57,191 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:57,192 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:57,201 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 06:01:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 06:01:57,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:57,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:57,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 06:01:57,203 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-08 06:01:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:01:57,212 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-08 06:01:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-08 06:01:57,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:01:57,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:01:57,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:01:57,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:01:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:01:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-08 06:01:57,224 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-08 06:01:57,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:01:57,224 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-08 06:01:57,225 INFO L479 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-08 06:01:57,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-08 06:02:00,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 467 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-08 06:02:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 06:02:00,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:00,213 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 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-08 06:02:00,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:00,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 06:02:00,413 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-08 06:02:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483879518] [2022-04-08 06:02:00,414 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-08 06:02:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616563067] [2022-04-08 06:02:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:00,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:00,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754203002] [2022-04-08 06:02:00,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:02:00,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:00,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:00,428 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:00,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 06:02:00,589 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:02:00,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:02:00,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 06:02:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:02:00,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:02:01,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {37149#true} call ULTIMATE.init(); {37149#true} is VALID [2022-04-08 06:02:01,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {37149#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; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37157#(<= ~counter~0 0)} {37149#true} #102#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {37157#(<= ~counter~0 0)} call #t~ret9 := main(); {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {37157#(<= ~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; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,081 INFO L272 TraceCheckUtils]: 6: Hoare triple {37157#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {37157#(<= ~counter~0 0)} ~cond := #in~cond; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {37157#(<= ~counter~0 0)} assume !(0 == ~cond); {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,082 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37157#(<= ~counter~0 0)} {37157#(<= ~counter~0 0)} #90#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,082 INFO L272 TraceCheckUtils]: 11: Hoare triple {37157#(<= ~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)); {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {37157#(<= ~counter~0 0)} ~cond := #in~cond; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {37157#(<= ~counter~0 0)} assume !(0 == ~cond); {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37157#(<= ~counter~0 0)} {37157#(<= ~counter~0 0)} #92#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {37157#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {37157#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {37206#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,091 INFO L272 TraceCheckUtils]: 19: Hoare triple {37206#(<= ~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)); {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {37206#(<= ~counter~0 1)} ~cond := #in~cond; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(<= ~counter~0 1)} assume !(0 == ~cond); {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(<= ~counter~0 1)} assume true; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,093 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37206#(<= ~counter~0 1)} {37206#(<= ~counter~0 1)} #94#return; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {37206#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {37206#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {37231#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,095 INFO L272 TraceCheckUtils]: 27: Hoare triple {37231#(<= ~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)); {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {37231#(<= ~counter~0 2)} ~cond := #in~cond; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {37231#(<= ~counter~0 2)} assume !(0 == ~cond); {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {37231#(<= ~counter~0 2)} assume true; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,096 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37231#(<= ~counter~0 2)} {37231#(<= ~counter~0 2)} #96#return; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {37231#(<= ~counter~0 2)} assume !(~r~0 > 0); {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {37231#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {37256#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,098 INFO L272 TraceCheckUtils]: 35: Hoare triple {37256#(<= ~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)); {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {37256#(<= ~counter~0 3)} ~cond := #in~cond; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {37256#(<= ~counter~0 3)} assume !(0 == ~cond); {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {37256#(<= ~counter~0 3)} assume true; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,099 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37256#(<= ~counter~0 3)} {37256#(<= ~counter~0 3)} #98#return; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {37256#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {37256#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {37281#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,101 INFO L272 TraceCheckUtils]: 43: Hoare triple {37281#(<= ~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)); {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {37281#(<= ~counter~0 4)} ~cond := #in~cond; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {37281#(<= ~counter~0 4)} assume !(0 == ~cond); {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {37281#(<= ~counter~0 4)} assume true; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,102 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37281#(<= ~counter~0 4)} {37281#(<= ~counter~0 4)} #98#return; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {37281#(<= ~counter~0 4)} assume !(~r~0 < 0); {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {37281#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {37306#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,104 INFO L272 TraceCheckUtils]: 51: Hoare triple {37306#(<= ~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)); {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,104 INFO L290 TraceCheckUtils]: 52: Hoare triple {37306#(<= ~counter~0 5)} ~cond := #in~cond; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {37306#(<= ~counter~0 5)} assume !(0 == ~cond); {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {37306#(<= ~counter~0 5)} assume true; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,105 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37306#(<= ~counter~0 5)} {37306#(<= ~counter~0 5)} #94#return; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {37306#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,106 INFO L290 TraceCheckUtils]: 57: Hoare triple {37306#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {37331#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,107 INFO L272 TraceCheckUtils]: 59: Hoare triple {37331#(<= ~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)); {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {37331#(<= ~counter~0 6)} ~cond := #in~cond; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {37331#(<= ~counter~0 6)} assume !(0 == ~cond); {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {37331#(<= ~counter~0 6)} assume true; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,108 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37331#(<= ~counter~0 6)} {37331#(<= ~counter~0 6)} #96#return; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {37331#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {37331#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {37356#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,110 INFO L272 TraceCheckUtils]: 67: Hoare triple {37356#(<= ~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)); {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {37356#(<= ~counter~0 7)} ~cond := #in~cond; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,110 INFO L290 TraceCheckUtils]: 69: Hoare triple {37356#(<= ~counter~0 7)} assume !(0 == ~cond); {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {37356#(<= ~counter~0 7)} assume true; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,111 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37356#(<= ~counter~0 7)} {37356#(<= ~counter~0 7)} #96#return; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,111 INFO L290 TraceCheckUtils]: 72: Hoare triple {37356#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {37356#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {37381#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,113 INFO L272 TraceCheckUtils]: 75: Hoare triple {37381#(<= ~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)); {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {37381#(<= ~counter~0 8)} ~cond := #in~cond; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {37381#(<= ~counter~0 8)} assume !(0 == ~cond); {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,113 INFO L290 TraceCheckUtils]: 78: Hoare triple {37381#(<= ~counter~0 8)} assume true; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,114 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37381#(<= ~counter~0 8)} {37381#(<= ~counter~0 8)} #96#return; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {37381#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {37381#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {37406#(<= ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,116 INFO L272 TraceCheckUtils]: 83: Hoare triple {37406#(<= ~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)); {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {37406#(<= ~counter~0 9)} ~cond := #in~cond; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {37406#(<= ~counter~0 9)} assume !(0 == ~cond); {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,116 INFO L290 TraceCheckUtils]: 86: Hoare triple {37406#(<= ~counter~0 9)} assume true; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,117 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37406#(<= ~counter~0 9)} {37406#(<= ~counter~0 9)} #96#return; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,117 INFO L290 TraceCheckUtils]: 88: Hoare triple {37406#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {37406#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37431#(<= |main_#t~post7| 9)} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {37431#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {37150#false} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {37150#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37150#false} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 92: Hoare triple {37150#false} assume !(#t~post8 < 10);havoc #t~post8; {37150#false} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 93: Hoare triple {37150#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37150#false} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 94: Hoare triple {37150#false} assume !(#t~post6 < 10);havoc #t~post6; {37150#false} is VALID [2022-04-08 06:02:01,118 INFO L272 TraceCheckUtils]: 95: Hoare triple {37150#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)); {37150#false} is VALID [2022-04-08 06:02:01,118 INFO L290 TraceCheckUtils]: 96: Hoare triple {37150#false} ~cond := #in~cond; {37150#false} is VALID [2022-04-08 06:02:01,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {37150#false} assume 0 == ~cond; {37150#false} is VALID [2022-04-08 06:02:01,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {37150#false} assume !false; {37150#false} is VALID [2022-04-08 06:02:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 06:02:01,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 98: Hoare triple {37150#false} assume !false; {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 97: Hoare triple {37150#false} assume 0 == ~cond; {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 96: Hoare triple {37150#false} ~cond := #in~cond; {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L272 TraceCheckUtils]: 95: Hoare triple {37150#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)); {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 94: Hoare triple {37150#false} assume !(#t~post6 < 10);havoc #t~post6; {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 93: Hoare triple {37150#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 92: Hoare triple {37150#false} assume !(#t~post8 < 10);havoc #t~post8; {37150#false} is VALID [2022-04-08 06:02:01,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {37150#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37150#false} is VALID [2022-04-08 06:02:01,549 INFO L290 TraceCheckUtils]: 90: Hoare triple {37431#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {37150#false} is VALID [2022-04-08 06:02:01,549 INFO L290 TraceCheckUtils]: 89: Hoare triple {37406#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37431#(<= |main_#t~post7| 9)} is VALID [2022-04-08 06:02:01,549 INFO L290 TraceCheckUtils]: 88: Hoare triple {37406#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,550 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37149#true} {37406#(<= ~counter~0 9)} #96#return; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,550 INFO L290 TraceCheckUtils]: 86: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,550 INFO L290 TraceCheckUtils]: 85: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,550 INFO L290 TraceCheckUtils]: 84: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,550 INFO L272 TraceCheckUtils]: 83: Hoare triple {37406#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,550 INFO L290 TraceCheckUtils]: 82: Hoare triple {37406#(<= ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,551 INFO L290 TraceCheckUtils]: 81: Hoare triple {37381#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-08 06:02:01,552 INFO L290 TraceCheckUtils]: 80: Hoare triple {37381#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,552 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37149#true} {37381#(<= ~counter~0 8)} #96#return; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,552 INFO L290 TraceCheckUtils]: 78: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,552 INFO L290 TraceCheckUtils]: 77: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,552 INFO L290 TraceCheckUtils]: 76: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,552 INFO L272 TraceCheckUtils]: 75: Hoare triple {37381#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,552 INFO L290 TraceCheckUtils]: 74: Hoare triple {37381#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,553 INFO L290 TraceCheckUtils]: 73: Hoare triple {37356#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-08 06:02:01,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {37356#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,554 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37149#true} {37356#(<= ~counter~0 7)} #96#return; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,554 INFO L290 TraceCheckUtils]: 70: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,554 INFO L290 TraceCheckUtils]: 69: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,554 INFO L290 TraceCheckUtils]: 68: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,554 INFO L272 TraceCheckUtils]: 67: Hoare triple {37356#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,554 INFO L290 TraceCheckUtils]: 66: Hoare triple {37356#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,555 INFO L290 TraceCheckUtils]: 65: Hoare triple {37331#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-08 06:02:01,555 INFO L290 TraceCheckUtils]: 64: Hoare triple {37331#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,556 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37149#true} {37331#(<= ~counter~0 6)} #96#return; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,556 INFO L290 TraceCheckUtils]: 62: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,556 INFO L272 TraceCheckUtils]: 59: Hoare triple {37331#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {37331#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {37306#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-08 06:02:01,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {37306#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,557 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37149#true} {37306#(<= ~counter~0 5)} #94#return; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,557 INFO L290 TraceCheckUtils]: 54: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,558 INFO L272 TraceCheckUtils]: 51: Hoare triple {37306#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {37306#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {37281#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-08 06:02:01,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {37281#(<= ~counter~0 4)} assume !(~r~0 < 0); {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,559 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37149#true} {37281#(<= ~counter~0 4)} #98#return; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,559 INFO L272 TraceCheckUtils]: 43: Hoare triple {37281#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {37281#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {37256#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-08 06:02:01,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {37256#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,561 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37149#true} {37256#(<= ~counter~0 3)} #98#return; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,561 INFO L290 TraceCheckUtils]: 36: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,561 INFO L272 TraceCheckUtils]: 35: Hoare triple {37256#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,561 INFO L290 TraceCheckUtils]: 34: Hoare triple {37256#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {37231#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-08 06:02:01,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {37231#(<= ~counter~0 2)} assume !(~r~0 > 0); {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,563 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37149#true} {37231#(<= ~counter~0 2)} #96#return; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,563 INFO L272 TraceCheckUtils]: 27: Hoare triple {37231#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {37231#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {37206#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-08 06:02:01,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {37206#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,565 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37149#true} {37206#(<= ~counter~0 1)} #94#return; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,565 INFO L272 TraceCheckUtils]: 19: Hoare triple {37206#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {37206#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {37157#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-08 06:02:01,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {37157#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,566 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37149#true} {37157#(<= ~counter~0 0)} #92#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {37157#(<= ~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)); {37149#true} is VALID [2022-04-08 06:02:01,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37149#true} {37157#(<= ~counter~0 0)} #90#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-08 06:02:01,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-08 06:02:01,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-08 06:02:01,567 INFO L272 TraceCheckUtils]: 6: Hoare triple {37157#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37149#true} is VALID [2022-04-08 06:02:01,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {37157#(<= ~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; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {37157#(<= ~counter~0 0)} call #t~ret9 := main(); {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37157#(<= ~counter~0 0)} {37149#true} #102#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {37149#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; {37157#(<= ~counter~0 0)} is VALID [2022-04-08 06:02:01,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {37149#true} call ULTIMATE.init(); {37149#true} is VALID [2022-04-08 06:02:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-08 06:02:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:02:01,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616563067] [2022-04-08 06:02:01,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:02:01,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754203002] [2022-04-08 06:02:01,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754203002] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:02:01,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:02:01,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-08 06:02:01,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:02:01,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483879518] [2022-04-08 06:02:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483879518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:02:01,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:02:01,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 06:02:01,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360472946] [2022-04-08 06:02:01,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:02:01,570 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-08 06:02:01,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:02:01,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:01,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:01,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 06:02:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:01,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 06:02:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:02:01,641 INFO L87 Difference]: Start difference. First operand 352 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:02,795 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-08 06:02:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 06:02:02,795 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-08 06:02:02,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:02:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 06:02:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-08 06:02:02,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-08 06:02:02,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:02,976 INFO L225 Difference]: With dead ends: 471 [2022-04-08 06:02:02,976 INFO L226 Difference]: Without dead ends: 364 [2022-04-08 06:02:02,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=264, Unknown=0, NotChecked=0, Total=420 [2022-04-08 06:02:02,977 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 100 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:02:02,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 246 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:02:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-08 06:02:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-08 06:02:03,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:02:03,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:03,562 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:03,562 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:03,570 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 06:02:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:02:03,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:03,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:03,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 06:02:03,571 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-08 06:02:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:02:03,578 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-08 06:02:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:02:03,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:02:03,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:02:03,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:02:03,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:02:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 06:02:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-08 06:02:03,596 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-08 06:02:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:02:03,596 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-08 06:02:03,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-08 06:02:03,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-08 06:02:05,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:02:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-08 06:02:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-08 06:02:05,224 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:02:05,224 INFO L499 BasicCegarLoop]: 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-08 06:02:05,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:05,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:05,425 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:02:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:02:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-08 06:02:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:02:05,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [338814044] [2022-04-08 06:02:05,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:02:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-08 06:02:05,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:02:05,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099087621] [2022-04-08 06:02:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:02:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:02:05,437 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:02:05,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175239648] [2022-04-08 06:02:05,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:02:05,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:05,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:02:05,439 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:02:05,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 06:02:05,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:02:05,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 06:02:05,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 06:02:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 06:02:05,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 06:02:05,618 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 06:02:05,618 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 06:02:05,621 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 06:02:05,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 06:02:05,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:02:05,846 INFO L719 BasicCegarLoop]: Path program histogram: [10, 8, 8, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 06:02:05,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 06:02:05,865 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 06:02:05,866 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-08 06:02:05,867 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 06:02:05,868 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 06:02:05,868 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-08 06:02:05,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 06:02:05 BoogieIcfgContainer [2022-04-08 06:02:05,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 06:02:05,870 INFO L158 Benchmark]: Toolchain (without parser) took 144652.25ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 132.2MB in the beginning and 79.5MB in the end (delta: 52.7MB). Peak memory consumption was 99.1MB. Max. memory is 8.0GB. [2022-04-08 06:02:05,870 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 181.4MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 06:02:05,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.81ms. Allocated memory is still 181.4MB. Free memory was 132.0MB in the beginning and 158.9MB in the end (delta: -26.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 06:02:05,870 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 181.4MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 06:02:05,871 INFO L158 Benchmark]: RCFGBuilder took 327.65ms. Allocated memory is still 181.4MB. Free memory was 156.8MB in the beginning and 144.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 06:02:05,871 INFO L158 Benchmark]: TraceAbstraction took 144050.25ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 143.7MB in the beginning and 79.5MB in the end (delta: 64.2MB). Peak memory consumption was 110.8MB. Max. memory is 8.0GB. [2022-04-08 06:02:05,872 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.12ms. Allocated memory is still 181.4MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.81ms. Allocated memory is still 181.4MB. Free memory was 132.0MB in the beginning and 158.9MB in the end (delta: -26.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 181.4MB. Free memory was 158.9MB in the beginning and 156.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.65ms. Allocated memory is still 181.4MB. Free memory was 156.8MB in the beginning and 144.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 144050.25ms. Allocated memory was 181.4MB in the beginning and 226.5MB in the end (delta: 45.1MB). Free memory was 143.7MB in the beginning and 79.5MB in the end (delta: 64.2MB). Peak memory consumption was 110.8MB. 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; [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) [L9] COND FALSE !(!cond) [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) [L27] CALL assume_abort_if_not(A % 2 == 1) [L9] COND FALSE !(!cond) [L27] RET assume_abort_if_not(A % 2 == 1) [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND TRUE !(r > 0) [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND TRUE !(r < 0) [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND TRUE !(r > 0) [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND TRUE !(r < 0) [L34] EXPR counter++ [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 144.0s, OverallIterations: 31, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 42.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1484 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 4800 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3376 mSDsCounter, 1106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1106 mSolverCounterUnsat, 1424 mSDtfsCounter, 1698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3562 GetRequests, 3201 SyntacticMatches, 16 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=30, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 112 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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-08 06:02:05,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...