/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_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:59:39,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:59:39,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:59:39,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:59:39,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:59:39,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:59:39,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:59:39,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:59:39,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:59:39,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:59:39,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:59:39,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:59:39,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:59:39,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:59:39,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:59:39,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:59:39,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:59:39,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:59:39,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:59:39,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:59:39,945 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:59:39,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:59:39,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:59:39,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:59:39,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:59:39,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:59:39,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:59:39,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:59:39,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:59:39,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:59:39,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:59:39,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:59:39,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:59:39,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:59:39,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:59:39,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:59:39,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:59:39,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:59:39,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:59:39,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:59:39,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:59:39,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:59:39,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:59:39,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:59:39,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:59:39,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:59:39,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:59:39,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:59:39,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:59:39,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:59:39,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:59:39,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:59:39,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:59:39,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:59:39,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:59:39,983 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:59:39,983 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-15 08:59:40,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:59:40,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:59:40,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:59:40,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:59:40,193 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:59:40,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-15 08:59:40,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d022f0e55/c6af85e75c884831930f42b6237e498f/FLAGfd2009314 [2022-04-15 08:59:40,647 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:59:40,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2022-04-15 08:59:40,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d022f0e55/c6af85e75c884831930f42b6237e498f/FLAGfd2009314 [2022-04-15 08:59:40,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d022f0e55/c6af85e75c884831930f42b6237e498f [2022-04-15 08:59:40,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:59:40,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:59:40,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:59:40,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:59:40,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:59:40,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c18ccaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40, skipping insertion in model container [2022-04-15 08:59:40,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:59:40,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:59:40,841 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_unwindbound50.c[535,548] [2022-04-15 08:59:40,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:59:40,875 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:59:40,889 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_unwindbound50.c[535,548] [2022-04-15 08:59:40,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:59:40,908 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:59:40,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40 WrapperNode [2022-04-15 08:59:40,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:59:40,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:59:40,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:59:40,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:59:40,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,920 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:59:40,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:59:40,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:59:40,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:59:40,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (1/1) ... [2022-04-15 08:59:40,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:59:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:40,964 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-15 08:59:40,982 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-15 08:59:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:59:40,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:59:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:59:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:59:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:59:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:59:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:59:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:59:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:59:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:59:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 08:59:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:59:40,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:59:41,040 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:59:41,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:59:41,164 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:59:41,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:59:41,168 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 08:59:41,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:59:41 BoogieIcfgContainer [2022-04-15 08:59:41,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:59:41,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:59:41,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:59:41,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:59:41,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:59:40" (1/3) ... [2022-04-15 08:59:41,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c806ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:59:41, skipping insertion in model container [2022-04-15 08:59:41,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:59:40" (2/3) ... [2022-04-15 08:59:41,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c806ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:59:41, skipping insertion in model container [2022-04-15 08:59:41,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:59:41" (3/3) ... [2022-04-15 08:59:41,174 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2022-04-15 08:59:41,178 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:59:41,178 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:59:41,202 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:59:41,208 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-15 08:59:41,208 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:59:41,226 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-15 08:59:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 08:59:41,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:41,231 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-15 08:59:41,231 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 08:59:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:41,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566991291] [2022-04-15 08:59:41,252 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 08:59:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:41,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731420371] [2022-04-15 08:59:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:41,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:41,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243722987] [2022-04-15 08:59:41,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:41,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:41,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:41,368 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-15 08:59:41,410 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-15 08:59:41,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:59:41,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:41,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 08:59:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:41,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:41,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 08:59:41,541 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-15 08:59:41,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:59:41,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 08:59:41,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 08:59:41,542 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-15 08:59:41,542 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-15 08:59:41,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:59:41,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 08:59:41,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:59:41,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 08:59:41,543 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-15 08:59:41,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:59:41,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:59:41,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:59:41,544 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 08:59:41,544 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-15 08:59:41,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 08:59:41,544 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-15 08:59:41,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 08:59:41,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 08:59:41,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 08:59:41,546 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-15 08:59:41,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:41,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:41,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731420371] [2022-04-15 08:59:41,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:41,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243722987] [2022-04-15 08:59:41,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243722987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:41,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:41,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 08:59:41,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:41,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566991291] [2022-04-15 08:59:41,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566991291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:41,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:41,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 08:59:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207380090] [2022-04-15 08:59:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:41,553 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-15 08:59:41,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:41,555 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-15 08:59:41,572 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-15 08:59:41,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 08:59:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:41,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 08:59:41,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 08:59:41,586 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-15 08:59:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:41,675 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 08:59:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 08:59:41,676 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-15 08:59:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:41,677 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-15 08:59:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 08:59:41,689 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-15 08:59:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 08:59:41,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 08:59:41,792 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-15 08:59:41,798 INFO L225 Difference]: With dead ends: 67 [2022-04-15 08:59:41,798 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:59:41,800 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-15 08:59:41,802 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-15 08:59:41,803 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-15 08:59:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:59:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:59:41,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:41,822 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-15 08:59:41,823 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-15 08:59:41,824 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-15 08:59:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:41,829 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 08:59:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:59:41,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:41,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:41,831 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-15 08:59:41,831 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-15 08:59:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:41,837 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 08:59:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:59:41,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:41,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:41,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:41,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:41,839 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-15 08:59:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 08:59:41,845 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 08:59:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:41,846 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 08:59:41,846 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-15 08:59:41,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 08:59:41,885 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-15 08:59:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:59:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:59:41,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:41,886 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-15 08:59:41,902 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-15 08:59:42,099 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-15 08:59:42,100 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 08:59:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179788431] [2022-04-15 08:59:42,101 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 08:59:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:42,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953904869] [2022-04-15 08:59:42,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:42,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:42,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91797366] [2022-04-15 08:59:42,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:42,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:42,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:42,129 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-15 08:59:42,156 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-15 08:59:42,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:59:42,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:42,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:59:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:42,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:42,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 08:59:42,391 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-15 08:59:42,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,393 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-15 08:59:42,394 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-15 08:59:42,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,396 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-15 08:59:42,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,400 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:42,401 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-15 08:59:42,402 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-15 08:59:42,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {370#false} is VALID [2022-04-15 08:59:42,403 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-15 08:59:42,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 08:59:42,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 08:59:42,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 08:59:42,404 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-15 08:59:42,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:42,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953904869] [2022-04-15 08:59:42,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:42,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91797366] [2022-04-15 08:59:42,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91797366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:42,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:42,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:42,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:42,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179788431] [2022-04-15 08:59:42,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179788431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:42,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:42,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496963441] [2022-04-15 08:59:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:42,409 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-15 08:59:42,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:42,410 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-15 08:59:42,425 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-15 08:59:42,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:59:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:59:42,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:59:42,427 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-15 08:59:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:42,504 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 08:59:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:59:42,505 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-15 08:59:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:42,505 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-15 08:59:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 08:59:42,507 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-15 08:59:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 08:59:42,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 08:59:42,540 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-15 08:59:42,541 INFO L225 Difference]: With dead ends: 41 [2022-04-15 08:59:42,541 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 08:59:42,542 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-15 08:59:42,542 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-15 08:59:42,543 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-15 08:59:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 08:59:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 08:59:42,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:42,552 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-15 08:59:42,553 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-15 08:59:42,553 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-15 08:59:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:42,555 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 08:59:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:59:42,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:42,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:42,555 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-15 08:59:42,556 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-15 08:59:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:42,557 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 08:59:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:59:42,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:42,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:42,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:42,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:42,558 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-15 08:59:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 08:59:42,560 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 08:59:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:42,560 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 08:59:42,560 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-15 08:59:42,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 08:59:42,591 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-15 08:59:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:59:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:59:42,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:42,592 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-15 08:59:42,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 08:59:42,810 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-15 08:59:42,810 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 08:59:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:42,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21061629] [2022-04-15 08:59:42,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 08:59:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:42,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072475541] [2022-04-15 08:59:42,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:42,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:42,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571840549] [2022-04-15 08:59:42,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:42,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:42,844 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-15 08:59:42,856 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-15 08:59:42,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:59:42,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:42,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:59:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:42,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:43,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 08:59:43,175 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-15 08:59:43,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:59:43,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 08:59:43,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 08:59:43,175 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-15 08:59:43,175 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-15 08:59:43,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 08:59:43,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 08:59:43,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:59:43,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 08:59:43,176 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-15 08:59:43,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 08:59:43,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 08:59:43,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:59:43,177 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 08:59:44,711 INFO 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 VALID [2022-04-15 08:59:44,712 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-15 08:59:44,713 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 < 50);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-15 08:59:45,487 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-15 08:59:45,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:59:45,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 08:59:45,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 08:59:45,490 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-15 08:59:45,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072475541] [2022-04-15 08:59:45,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571840549] [2022-04-15 08:59:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571840549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:45,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:59:45,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [21061629] [2022-04-15 08:59:45,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [21061629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:45,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:45,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:59:45,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101528897] [2022-04-15 08:59:45,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:45,492 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-15 08:59:45,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:45,492 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-15 08:59:48,391 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-15 08:59:48,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:59:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:59:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:59:48,393 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-15 08:59:50,459 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-15 08:59:53,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 08:59:55,575 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-15 09:00:04,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:00:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:05,015 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 09:00:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:00:05,015 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-15 09:00:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:05,015 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-15 09:00:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 09:00:05,017 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-15 09:00:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 09:00:05,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 09:00:09,610 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-15 09:00:09,611 INFO L225 Difference]: With dead ends: 53 [2022-04-15 09:00:09,611 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 09:00:09,612 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-15 09:00:09,612 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:09,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2022-04-15 09:00:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 09:00:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 09:00:09,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:09,628 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-15 09:00:09,629 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-15 09:00:09,629 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-15 09:00:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:09,631 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 09:00:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 09:00:09,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:09,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:09,632 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-15 09:00:09,632 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-15 09:00:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:09,634 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 09:00:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 09:00:09,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:09,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:09,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:09,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:09,635 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-15 09:00:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 09:00:09,637 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 09:00:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:09,637 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 09:00:09,637 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-15 09:00:09,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 09:00:16,435 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-15 09:00:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 09:00:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 09:00:16,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:16,436 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-15 09:00:16,458 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-15 09:00:16,636 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-15 09:00:16,636 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 09:00:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [812976826] [2022-04-15 09:00:16,637 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 09:00:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:16,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263286586] [2022-04-15 09:00:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:16,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:16,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639196611] [2022-04-15 09:00:16,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:16,656 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-15 09:00:16,657 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-15 09:00:16,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:16,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:16,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 09:00:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:16,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:16,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 09:00:16,889 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-15 09:00:16,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 09:00:16,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 09:00:16,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 09:00:16,890 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-15 09:00:16,890 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-15 09:00:16,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 09:00:16,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 09:00:16,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 09:00:16,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 09:00:16,891 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-15 09:00:16,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 09:00:16,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 09:00:16,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 09:00:16,892 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 09:00:16,892 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-15 09:00:16,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 09:00:16,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-15 09:00:16,893 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-15 09:00:16,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:00:16,895 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-15 09:00:16,895 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-15 09:00:16,896 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-15 09:00:16,896 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-15 09:00:16,897 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-15 09:00:16,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:00:16,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 09:00:16,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 09:00:16,898 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-15 09:00:16,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:17,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 09:00:17,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 09:00:17,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:00:17,237 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-15 09:00:17,237 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-15 09:00:17,238 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-15 09:00:17,238 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-15 09:00:17,239 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-15 09:00:17,239 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-15 09:00:17,239 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-15 09:00:17,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 50);havoc #t~post6; {1042#true} is VALID [2022-04-15 09:00:17,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 09:00:17,240 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-15 09:00:17,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 09:00:17,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 09:00:17,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 09:00:17,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 09:00:17,240 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-15 09:00:17,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 09:00:17,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 09:00:17,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 09:00:17,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 09:00:17,241 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-15 09:00:17,241 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-15 09:00:17,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 09:00:17,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 09:00:17,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 09:00:17,242 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-15 09:00:17,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 09:00:17,242 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-15 09:00:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:17,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263286586] [2022-04-15 09:00:17,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639196611] [2022-04-15 09:00:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639196611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:17,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:17,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 09:00:17,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [812976826] [2022-04-15 09:00:17,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [812976826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:17,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:17,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:00:17,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783576865] [2022-04-15 09:00:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:17,244 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-15 09:00:17,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:17,244 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-15 09:00:17,260 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-15 09:00:17,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:00:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:17,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:00:17,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:00:17,261 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-15 09:00:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:17,695 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 09:00:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:00:17,695 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-15 09:00:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:17,696 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-15 09:00:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 09:00:17,697 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-15 09:00:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 09:00:17,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 09:00:17,736 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-15 09:00:17,737 INFO L225 Difference]: With dead ends: 57 [2022-04-15 09:00:17,737 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 09:00:17,738 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-15 09:00:17,738 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-15 09:00:17,739 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-15 09:00:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 09:00:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 09:00:17,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:17,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 09:00:17,758 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 09:00:17,758 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 09:00:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:17,760 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 09:00:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 09:00:17,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:17,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:17,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 09:00:17,761 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 09:00:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:17,763 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 09:00:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 09:00:17,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:17,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:17,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:17,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 09:00:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 09:00:17,766 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-15 09:00:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:17,766 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 09:00:17,766 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-15 09:00:17,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 09:00:21,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 09:00:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 09:00:21,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:21,765 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-15 09:00:21,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 09:00:21,969 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-15 09:00:21,969 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:21,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 09:00:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:21,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855235624] [2022-04-15 09:00:21,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 09:00:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:21,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211192016] [2022-04-15 09:00:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:21,988 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:21,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964851165] [2022-04-15 09:00:21,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:21,994 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-15 09:00:21,994 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-15 09:00:22,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:22,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:22,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:00:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:22,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:22,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {1553#true} call ULTIMATE.init(); {1553#true} is VALID [2022-04-15 09:00:22,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {1553#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; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1561#(<= ~counter~0 0)} {1553#true} #102#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {1561#(<= ~counter~0 0)} call #t~ret9 := main(); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(<= ~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; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #90#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,413 INFO L272 TraceCheckUtils]: 11: Hoare triple {1561#(<= ~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)); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #92#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:22,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,416 INFO L272 TraceCheckUtils]: 19: Hoare triple {1610#(<= ~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)); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= ~counter~0 1)} ~cond := #in~cond; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {1610#(<= ~counter~0 1)} assume !(0 == ~cond); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {1610#(<= ~counter~0 1)} assume true; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1610#(<= ~counter~0 1)} {1610#(<= ~counter~0 1)} #94#return; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {1610#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:22,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {1610#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1635#(<= |main_#t~post7| 1)} is VALID [2022-04-15 09:00:22,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {1635#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1554#false} is VALID [2022-04-15 09:00:22,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {1554#false} assume !(#t~post8 < 50);havoc #t~post8; {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {1554#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {1554#false} assume !(#t~post6 < 50);havoc #t~post6; {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L272 TraceCheckUtils]: 31: Hoare triple {1554#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)); {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {1554#false} ~cond := #in~cond; {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {1554#false} assume 0 == ~cond; {1554#false} is VALID [2022-04-15 09:00:22,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {1554#false} assume !false; {1554#false} is VALID [2022-04-15 09:00:22,433 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-15 09:00:22,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:00:22,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211192016] [2022-04-15 09:00:22,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964851165] [2022-04-15 09:00:22,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964851165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:22,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:22,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:00:22,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855235624] [2022-04-15 09:00:22,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855235624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:22,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:22,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:00:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485299450] [2022-04-15 09:00:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:22,437 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-15 09:00:22,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:22,437 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-15 09:00:22,469 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-15 09:00:22,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:00:22,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:00:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:00:22,470 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 09:00:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:22,599 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 09:00:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:00:22,599 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-15 09:00:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:22,600 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-15 09:00:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 09:00:22,602 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-15 09:00:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 09:00:22,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 09:00:22,662 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-15 09:00:22,664 INFO L225 Difference]: With dead ends: 97 [2022-04-15 09:00:22,665 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 09:00:22,665 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-15 09:00:22,666 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-15 09:00:22,666 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-15 09:00:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 09:00:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 09:00:22,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:22,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 09:00:22,704 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 09:00:22,704 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 09:00:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:22,706 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 09:00:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 09:00:22,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:22,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:22,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 09:00:22,707 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 09:00:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:22,711 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 09:00:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 09:00:22,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:22,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:22,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:22,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 09:00:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 09:00:22,715 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-15 09:00:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:22,716 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-15 09:00:22,716 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-15 09:00:22,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-15 09:00:27,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 09:00:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 09:00:27,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:27,038 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-15 09:00:27,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 09:00:27,238 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-15 09:00:27,238 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 09:00:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:27,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526367137] [2022-04-15 09:00:27,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 09:00:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:27,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069800966] [2022-04-15 09:00:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:27,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:27,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45567442] [2022-04-15 09:00:27,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:27,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:27,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:27,254 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-15 09:00:27,262 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-15 09:00:27,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:27,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:27,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:00:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:27,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:27,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 09:00:27,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#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; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2104#(<= ~counter~0 0)} {2096#true} #102#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {2104#(<= ~counter~0 0)} call #t~ret9 := main(); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#(<= ~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; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,514 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #90#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,515 INFO L272 TraceCheckUtils]: 11: Hoare triple {2104#(<= ~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)); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,516 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #92#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:27,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {2104#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,518 INFO L272 TraceCheckUtils]: 19: Hoare triple {2153#(<= ~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)); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ~counter~0 1)} ~cond := #in~cond; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {2153#(<= ~counter~0 1)} assume !(0 == ~cond); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(<= ~counter~0 1)} assume true; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,519 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2153#(<= ~counter~0 1)} {2153#(<= ~counter~0 1)} #94#return; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:27,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {2153#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {2178#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,521 INFO L272 TraceCheckUtils]: 27: Hoare triple {2178#(<= ~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)); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(<= ~counter~0 2)} ~cond := #in~cond; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(<= ~counter~0 2)} assume !(0 == ~cond); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {2178#(<= ~counter~0 2)} assume true; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,523 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2178#(<= ~counter~0 2)} {2178#(<= ~counter~0 2)} #96#return; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {2178#(<= ~counter~0 2)} assume !(~r~0 > 0); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:27,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2203#(<= |main_#t~post8| 2)} is VALID [2022-04-15 09:00:27,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {2203#(<= |main_#t~post8| 2)} assume !(#t~post8 < 50);havoc #t~post8; {2097#false} is VALID [2022-04-15 09:00:27,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 09:00:27,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 50);havoc #t~post6; {2097#false} is VALID [2022-04-15 09:00:27,524 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#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)); {2097#false} is VALID [2022-04-15 09:00:27,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 09:00:27,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 09:00:27,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 09:00:27,539 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-15 09:00:27,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:27,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 09:00:27,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 09:00:27,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 09:00:27,724 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#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)); {2097#false} is VALID [2022-04-15 09:00:27,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 50);havoc #t~post6; {2097#false} is VALID [2022-04-15 09:00:27,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 09:00:27,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {2243#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {2097#false} is VALID [2022-04-15 09:00:27,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2243#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:00:27,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 50)} assume !(~r~0 > 0); {2247#(< ~counter~0 50)} is VALID [2022-04-15 09:00:27,726 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2096#true} {2247#(< ~counter~0 50)} #96#return; {2247#(< ~counter~0 50)} is VALID [2022-04-15 09:00:27,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 09:00:27,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 09:00:27,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 09:00:27,726 INFO L272 TraceCheckUtils]: 27: Hoare triple {2247#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 09:00:27,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {2247#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {2247#(< ~counter~0 50)} is VALID [2022-04-15 09:00:27,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {2272#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2247#(< ~counter~0 50)} is VALID [2022-04-15 09:00:27,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 49)} assume !!(0 != ~r~0); {2272#(< ~counter~0 49)} is VALID [2022-04-15 09:00:27,728 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2096#true} {2272#(< ~counter~0 49)} #94#return; {2272#(< ~counter~0 49)} is VALID [2022-04-15 09:00:27,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 09:00:27,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 09:00:27,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 09:00:27,728 INFO L272 TraceCheckUtils]: 19: Hoare triple {2272#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 09:00:27,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2272#(< ~counter~0 49)} is VALID [2022-04-15 09:00:27,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {2297#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2272#(< ~counter~0 49)} is VALID [2022-04-15 09:00:27,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,729 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2096#true} {2297#(< ~counter~0 48)} #92#return; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 09:00:27,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 09:00:27,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 09:00:27,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {2297#(< ~counter~0 48)} 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)); {2096#true} is VALID [2022-04-15 09:00:27,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2096#true} {2297#(< ~counter~0 48)} #90#return; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 09:00:27,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 09:00:27,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 09:00:27,731 INFO L272 TraceCheckUtils]: 6: Hoare triple {2297#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 09:00:27,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {2297#(< ~counter~0 48)} 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; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {2297#(< ~counter~0 48)} call #t~ret9 := main(); {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2297#(< ~counter~0 48)} {2096#true} #102#return; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {2297#(< ~counter~0 48)} assume true; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#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; {2297#(< ~counter~0 48)} is VALID [2022-04-15 09:00:27,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 09:00:27,733 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-15 09:00:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069800966] [2022-04-15 09:00:27,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45567442] [2022-04-15 09:00:27,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45567442] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 09:00:27,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:00:27,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-15 09:00:27,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:27,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526367137] [2022-04-15 09:00:27,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526367137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:27,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:27,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:00:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648809692] [2022-04-15 09:00:27,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:27,734 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-15 09:00:27,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:27,734 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-15 09:00:27,755 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-15 09:00:27,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:00:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:00:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:00:27,756 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 09:00:27,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:27,915 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-15 09:00:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:00:27,915 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-15 09:00:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:27,916 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-15 09:00:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 09:00:27,917 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-15 09:00:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 09:00:27,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 09:00:27,968 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-15 09:00:27,969 INFO L225 Difference]: With dead ends: 106 [2022-04-15 09:00:27,969 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 09:00:27,970 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-15 09:00:27,970 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:27,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:00:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 09:00:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 09:00:28,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:28,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:28,007 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:28,007 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:28,009 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 09:00:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 09:00:28,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:28,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:28,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 09:00:28,010 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 09:00:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:28,013 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 09:00:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 09:00:28,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:28,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:28,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:28,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:28,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-15 09:00:28,015 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-15 09:00:28,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:28,016 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-15 09:00:28,016 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-15 09:00:28,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-15 09:00:32,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 81 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-15 09:00:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 09:00:32,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:32,120 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-15 09:00:32,136 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-15 09:00:32,335 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-15 09:00:32,335 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 09:00:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:32,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854710494] [2022-04-15 09:00:32,336 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:32,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 09:00:32,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:32,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090602326] [2022-04-15 09:00:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:32,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:32,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376328953] [2022-04-15 09:00:32,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:32,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:32,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:32,377 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-15 09:00:32,378 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-15 09:00:32,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:32,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:32,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:00:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:32,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:32,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 09:00:32,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#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; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2845#(<= ~counter~0 0)} {2837#true} #102#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {2845#(<= ~counter~0 0)} call #t~ret9 := main(); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {2845#(<= ~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; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #90#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,653 INFO L272 TraceCheckUtils]: 11: Hoare triple {2845#(<= ~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)); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,656 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #92#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {2845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:32,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,658 INFO L272 TraceCheckUtils]: 19: Hoare triple {2894#(<= ~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)); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#(<= ~counter~0 1)} ~cond := #in~cond; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#(<= ~counter~0 1)} assume !(0 == ~cond); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2894#(<= ~counter~0 1)} assume true; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,660 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2894#(<= ~counter~0 1)} {2894#(<= ~counter~0 1)} #94#return; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:32,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {2919#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,661 INFO L272 TraceCheckUtils]: 27: Hoare triple {2919#(<= ~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)); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {2919#(<= ~counter~0 2)} ~cond := #in~cond; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {2919#(<= ~counter~0 2)} assume !(0 == ~cond); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(<= ~counter~0 2)} assume true; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,663 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2919#(<= ~counter~0 2)} {2919#(<= ~counter~0 2)} #96#return; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {2919#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:32,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {2919#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2944#(<= |main_#t~post7| 2)} is VALID [2022-04-15 09:00:32,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {2838#false} is VALID [2022-04-15 09:00:32,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 50);havoc #t~post8; {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 50);havoc #t~post6; {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#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)); {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 09:00:32,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 09:00:32,666 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-15 09:00:32,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:32,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#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)); {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 50);havoc #t~post6; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 50);havoc #t~post8; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 09:00:32,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {2838#false} is VALID [2022-04-15 09:00:32,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2996#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:00:32,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {3000#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(< ~counter~0 50)} is VALID [2022-04-15 09:00:32,930 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2837#true} {3000#(< ~counter~0 50)} #96#return; {3000#(< ~counter~0 50)} is VALID [2022-04-15 09:00:32,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 09:00:32,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 09:00:32,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 09:00:32,951 INFO L272 TraceCheckUtils]: 27: Hoare triple {3000#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 09:00:32,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {3000#(< ~counter~0 50)} is VALID [2022-04-15 09:00:32,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3000#(< ~counter~0 50)} is VALID [2022-04-15 09:00:32,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {3025#(< ~counter~0 49)} assume !!(0 != ~r~0); {3025#(< ~counter~0 49)} is VALID [2022-04-15 09:00:32,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2837#true} {3025#(< ~counter~0 49)} #94#return; {3025#(< ~counter~0 49)} is VALID [2022-04-15 09:00:32,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 09:00:32,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 09:00:32,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 09:00:32,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {3025#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 09:00:32,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {3025#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {3025#(< ~counter~0 49)} is VALID [2022-04-15 09:00:32,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3025#(< ~counter~0 49)} is VALID [2022-04-15 09:00:32,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#(< ~counter~0 48)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,956 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2837#true} {3050#(< ~counter~0 48)} #92#return; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 09:00:32,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 09:00:32,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 09:00:32,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {3050#(< ~counter~0 48)} 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)); {2837#true} is VALID [2022-04-15 09:00:32,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2837#true} {3050#(< ~counter~0 48)} #90#return; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 09:00:32,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 09:00:32,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 09:00:32,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#(< ~counter~0 48)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 09:00:32,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#(< ~counter~0 48)} 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; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#(< ~counter~0 48)} call #t~ret9 := main(); {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#(< ~counter~0 48)} {2837#true} #102#return; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#(< ~counter~0 48)} assume true; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#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; {3050#(< ~counter~0 48)} is VALID [2022-04-15 09:00:32,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 09:00:32,959 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-15 09:00:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:32,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090602326] [2022-04-15 09:00:32,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:32,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376328953] [2022-04-15 09:00:32,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376328953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:32,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:32,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 09:00:32,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:32,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854710494] [2022-04-15 09:00:32,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854710494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:32,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:32,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:00:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200182723] [2022-04-15 09:00:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:32,961 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-15 09:00:32,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:32,961 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-15 09:00:32,987 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-15 09:00:32,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:00:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:00:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:00:32,988 INFO L87 Difference]: Start difference. First operand 68 states and 83 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-15 09:00:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:33,156 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-15 09:00:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 09:00:33,156 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-15 09:00:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:33,156 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-15 09:00:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 09:00:33,158 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-15 09:00:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 09:00:33,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 09:00:33,213 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-15 09:00:33,214 INFO L225 Difference]: With dead ends: 91 [2022-04-15 09:00:33,214 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 09:00:33,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:00:33,215 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-15 09:00:33,215 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-15 09:00:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 09:00:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 09:00:33,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:33,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:33,260 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:33,261 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:33,262 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 09:00:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 09:00:33,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:33,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:33,263 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), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-15 09:00:33,263 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), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-15 09:00:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:33,265 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 09:00:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 09:00:33,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:33,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:33,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:33,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:33,265 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), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 09:00:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-15 09:00:33,267 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2022-04-15 09:00:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:33,267 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-15 09:00:33,267 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-15 09:00:33,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-15 09:00:37,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 83 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 09:00:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 09:00:37,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:37,419 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-15 09:00:37,435 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-15 09:00:37,626 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-15 09:00:37,627 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 09:00:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:37,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [12066427] [2022-04-15 09:00:37,627 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 09:00:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388481394] [2022-04-15 09:00:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:37,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:37,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943240821] [2022-04-15 09:00:37,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:37,641 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-15 09:00:37,657 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-15 09:00:37,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:37,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:37,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 09:00:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:37,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:37,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-15 09:00:37,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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; {3568#true} is VALID [2022-04-15 09:00:37,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #102#return; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret9 := main(); {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#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; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #90#return; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L272 TraceCheckUtils]: 11: Hoare triple {3568#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)); {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 09:00:37,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#true} {3568#true} #92#return; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {3568#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#true} assume !!(#t~post6 < 50);havoc #t~post6; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {3568#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)); {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3568#true} {3568#true} #94#return; {3568#true} is VALID [2022-04-15 09:00:37,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {3568#true} assume !!(0 != ~r~0); {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:37,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:37,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#(not (= main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:37,875 INFO L272 TraceCheckUtils]: 27: Hoare triple {3645#(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)); {3568#true} is VALID [2022-04-15 09:00:37,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 09:00:37,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 09:00:37,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 09:00:37,876 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3568#true} {3645#(not (= main_~r~0 0))} #96#return; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 09:00:37,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {3645#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:37,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:37,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 50);havoc #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:37,882 INFO L272 TraceCheckUtils]: 35: Hoare triple {3670#(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)); {3568#true} is VALID [2022-04-15 09:00:37,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 09:00:37,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 09:00:37,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 09:00:37,883 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3568#true} {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:00:37,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3569#false} is VALID [2022-04-15 09:00:37,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3569#false} is VALID [2022-04-15 09:00:37,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#false} assume !(#t~post6 < 50);havoc #t~post6; {3569#false} is VALID [2022-04-15 09:00:37,885 INFO L272 TraceCheckUtils]: 43: Hoare triple {3569#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)); {3569#false} is VALID [2022-04-15 09:00:37,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {3569#false} ~cond := #in~cond; {3569#false} is VALID [2022-04-15 09:00:37,887 INFO L290 TraceCheckUtils]: 45: Hoare triple {3569#false} assume 0 == ~cond; {3569#false} is VALID [2022-04-15 09:00:37,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-15 09:00:37,889 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-15 09:00:37,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:00:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388481394] [2022-04-15 09:00:37,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943240821] [2022-04-15 09:00:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943240821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:37,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:37,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:00:37,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:37,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [12066427] [2022-04-15 09:00:37,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [12066427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:37,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:37,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:00:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933716526] [2022-04-15 09:00:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:37,891 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-15 09:00:37,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:37,892 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-15 09:00:37,916 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-15 09:00:37,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:00:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:37,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:00:37,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:00:37,917 INFO L87 Difference]: Start difference. First operand 70 states and 85 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-15 09:00:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:38,086 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2022-04-15 09:00:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:00:38,086 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-15 09:00:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:38,087 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-15 09:00:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 09:00:38,088 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-15 09:00:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 09:00:38,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 09:00:38,164 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-15 09:00:38,166 INFO L225 Difference]: With dead ends: 153 [2022-04-15 09:00:38,167 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 09:00:38,169 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-15 09:00:38,170 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-15 09:00:38,170 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-15 09:00:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 09:00:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-04-15 09:00:38,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:38,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 09:00:38,280 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 09:00:38,282 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 09:00:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:38,289 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2022-04-15 09:00:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2022-04-15 09:00:38,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:38,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:38,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 116 states. [2022-04-15 09:00:38,298 INFO L87 Difference]: Start difference. First operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 116 states. [2022-04-15 09:00:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:38,301 INFO L93 Difference]: Finished difference Result 116 states and 156 transitions. [2022-04-15 09:00:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 156 transitions. [2022-04-15 09:00:38,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:38,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:38,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:38,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 20 states have call successors, (20), 8 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 09:00:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2022-04-15 09:00:38,304 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 47 [2022-04-15 09:00:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:38,304 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2022-04-15 09:00:38,304 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-15 09:00:38,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 128 transitions. [2022-04-15 09:00:44,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 125 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-04-15 09:00:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 09:00:44,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:44,828 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-15 09:00:44,843 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-15 09:00:45,028 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-15 09:00:45,028 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 09:00:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:45,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1857298350] [2022-04-15 09:00:45,029 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 09:00:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:45,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548268482] [2022-04-15 09:00:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:45,039 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:45,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307936585] [2022-04-15 09:00:45,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:45,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:45,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:45,040 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-15 09:00:45,046 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-15 09:00:45,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:45,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:45,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:00:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:45,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:45,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4446#true} is VALID [2022-04-15 09:00:45,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#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; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4454#(<= ~counter~0 0)} {4446#true} #102#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {4454#(<= ~counter~0 0)} call #t~ret9 := main(); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {4454#(<= ~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; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {4454#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {4454#(<= ~counter~0 0)} ~cond := #in~cond; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {4454#(<= ~counter~0 0)} assume !(0 == ~cond); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4454#(<= ~counter~0 0)} {4454#(<= ~counter~0 0)} #90#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,341 INFO L272 TraceCheckUtils]: 11: Hoare triple {4454#(<= ~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)); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {4454#(<= ~counter~0 0)} ~cond := #in~cond; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {4454#(<= ~counter~0 0)} assume !(0 == ~cond); {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {4454#(<= ~counter~0 0)} assume true; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,342 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4454#(<= ~counter~0 0)} {4454#(<= ~counter~0 0)} #92#return; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {4454#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4454#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:45,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {4454#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {4503#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,344 INFO L272 TraceCheckUtils]: 19: Hoare triple {4503#(<= ~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)); {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {4503#(<= ~counter~0 1)} ~cond := #in~cond; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {4503#(<= ~counter~0 1)} assume !(0 == ~cond); {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {4503#(<= ~counter~0 1)} assume true; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,346 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4503#(<= ~counter~0 1)} {4503#(<= ~counter~0 1)} #94#return; {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,346 INFO L290 TraceCheckUtils]: 24: Hoare triple {4503#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4503#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:45,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {4503#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,347 INFO L272 TraceCheckUtils]: 27: Hoare triple {4528#(<= ~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)); {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {4528#(<= ~counter~0 2)} ~cond := #in~cond; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,348 INFO L290 TraceCheckUtils]: 29: Hoare triple {4528#(<= ~counter~0 2)} assume !(0 == ~cond); {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {4528#(<= ~counter~0 2)} assume true; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,349 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4528#(<= ~counter~0 2)} {4528#(<= ~counter~0 2)} #96#return; {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {4528#(<= ~counter~0 2)} assume !(~r~0 > 0); {4528#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:45,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {4553#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,350 INFO L272 TraceCheckUtils]: 35: Hoare triple {4553#(<= ~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)); {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {4553#(<= ~counter~0 3)} ~cond := #in~cond; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {4553#(<= ~counter~0 3)} assume !(0 == ~cond); {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {4553#(<= ~counter~0 3)} assume true; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,352 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4553#(<= ~counter~0 3)} {4553#(<= ~counter~0 3)} #98#return; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {4553#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4553#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:45,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {4553#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4578#(<= |main_#t~post8| 3)} is VALID [2022-04-15 09:00:45,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {4578#(<= |main_#t~post8| 3)} assume !(#t~post8 < 50);havoc #t~post8; {4447#false} is VALID [2022-04-15 09:00:45,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4447#false} is VALID [2022-04-15 09:00:45,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} assume !(#t~post6 < 50);havoc #t~post6; {4447#false} is VALID [2022-04-15 09:00:45,353 INFO L272 TraceCheckUtils]: 45: Hoare triple {4447#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)); {4447#false} is VALID [2022-04-15 09:00:45,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} ~cond := #in~cond; {4447#false} is VALID [2022-04-15 09:00:45,353 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume 0 == ~cond; {4447#false} is VALID [2022-04-15 09:00:45,353 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 09:00:45,354 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-15 09:00:45,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:45,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {4447#false} assume !false; {4447#false} is VALID [2022-04-15 09:00:45,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {4447#false} assume 0 == ~cond; {4447#false} is VALID [2022-04-15 09:00:45,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {4447#false} ~cond := #in~cond; {4447#false} is VALID [2022-04-15 09:00:45,615 INFO L272 TraceCheckUtils]: 45: Hoare triple {4447#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)); {4447#false} is VALID [2022-04-15 09:00:45,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {4447#false} assume !(#t~post6 < 50);havoc #t~post6; {4447#false} is VALID [2022-04-15 09:00:45,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {4447#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4447#false} is VALID [2022-04-15 09:00:45,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {4618#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {4447#false} is VALID [2022-04-15 09:00:45,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {4622#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4618#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:00:45,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {4622#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4622#(< ~counter~0 50)} is VALID [2022-04-15 09:00:45,617 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4446#true} {4622#(< ~counter~0 50)} #98#return; {4622#(< ~counter~0 50)} is VALID [2022-04-15 09:00:45,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 09:00:45,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 09:00:45,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 09:00:45,617 INFO L272 TraceCheckUtils]: 35: Hoare triple {4622#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 09:00:45,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {4622#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {4622#(< ~counter~0 50)} is VALID [2022-04-15 09:00:45,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {4647#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4622#(< ~counter~0 50)} is VALID [2022-04-15 09:00:45,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {4647#(< ~counter~0 49)} assume !(~r~0 > 0); {4647#(< ~counter~0 49)} is VALID [2022-04-15 09:00:45,619 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4446#true} {4647#(< ~counter~0 49)} #96#return; {4647#(< ~counter~0 49)} is VALID [2022-04-15 09:00:45,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 09:00:45,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 09:00:45,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 09:00:45,619 INFO L272 TraceCheckUtils]: 27: Hoare triple {4647#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 09:00:45,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {4647#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {4647#(< ~counter~0 49)} is VALID [2022-04-15 09:00:45,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {4672#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4647#(< ~counter~0 49)} is VALID [2022-04-15 09:00:45,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {4672#(< ~counter~0 48)} assume !!(0 != ~r~0); {4672#(< ~counter~0 48)} is VALID [2022-04-15 09:00:45,621 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4446#true} {4672#(< ~counter~0 48)} #94#return; {4672#(< ~counter~0 48)} is VALID [2022-04-15 09:00:45,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 09:00:45,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 09:00:45,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 09:00:45,621 INFO L272 TraceCheckUtils]: 19: Hoare triple {4672#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 09:00:45,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {4672#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4672#(< ~counter~0 48)} is VALID [2022-04-15 09:00:45,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4672#(< ~counter~0 48)} is VALID [2022-04-15 09:00:45,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {4697#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,622 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4446#true} {4697#(< ~counter~0 47)} #92#return; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 09:00:45,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 09:00:45,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 09:00:45,623 INFO L272 TraceCheckUtils]: 11: Hoare triple {4697#(< ~counter~0 47)} 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)); {4446#true} is VALID [2022-04-15 09:00:45,623 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4446#true} {4697#(< ~counter~0 47)} #90#return; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {4446#true} assume true; {4446#true} is VALID [2022-04-15 09:00:45,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {4446#true} assume !(0 == ~cond); {4446#true} is VALID [2022-04-15 09:00:45,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {4446#true} ~cond := #in~cond; {4446#true} is VALID [2022-04-15 09:00:45,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {4697#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4446#true} is VALID [2022-04-15 09:00:45,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {4697#(< ~counter~0 47)} 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; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {4697#(< ~counter~0 47)} call #t~ret9 := main(); {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4697#(< ~counter~0 47)} {4446#true} #102#return; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {4697#(< ~counter~0 47)} assume true; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#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; {4697#(< ~counter~0 47)} is VALID [2022-04-15 09:00:45,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {4446#true} call ULTIMATE.init(); {4446#true} is VALID [2022-04-15 09:00:45,626 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-15 09:00:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:45,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548268482] [2022-04-15 09:00:45,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:45,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307936585] [2022-04-15 09:00:45,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307936585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:45,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:45,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 09:00:45,627 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:45,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1857298350] [2022-04-15 09:00:45,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1857298350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:45,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:45,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:00:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762104573] [2022-04-15 09:00:45,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:45,628 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-15 09:00:45,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:45,628 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-15 09:00:45,658 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-15 09:00:45,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:00:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:00:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:00:45,659 INFO L87 Difference]: Start difference. First operand 98 states and 128 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-15 09:00:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:45,902 INFO L93 Difference]: Finished difference Result 180 states and 241 transitions. [2022-04-15 09:00:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:00:45,902 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-15 09:00:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:45,903 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-15 09:00:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 09:00:45,911 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-15 09:00:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 09:00:45,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 09:00:45,994 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-15 09:00:45,996 INFO L225 Difference]: With dead ends: 180 [2022-04-15 09:00:45,996 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 09:00:45,997 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-15 09:00:46,000 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:46,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 137 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:00:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 09:00:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-04-15 09:00:46,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:46,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:46,074 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:46,074 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:46,078 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2022-04-15 09:00:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2022-04-15 09:00:46,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:46,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:46,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 115 states. [2022-04-15 09:00:46,079 INFO L87 Difference]: Start difference. First operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 115 states. [2022-04-15 09:00:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:46,080 INFO L93 Difference]: Finished difference Result 115 states and 146 transitions. [2022-04-15 09:00:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2022-04-15 09:00:46,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:46,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:46,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:46,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2022-04-15 09:00:46,083 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 49 [2022-04-15 09:00:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:46,083 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2022-04-15 09:00:46,084 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-15 09:00:46,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 145 transitions. [2022-04-15 09:00:50,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 144 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2022-04-15 09:00:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 09:00:50,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:50,727 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-15 09:00:50,745 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-15 09:00:50,928 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-15 09:00:50,928 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 09:00:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:50,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552576712] [2022-04-15 09:00:50,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 09:00:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:50,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489809113] [2022-04-15 09:00:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:50,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:50,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011419124] [2022-04-15 09:00:50,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:00:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:50,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:50,958 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-15 09:00:50,978 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-15 09:00:51,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:00:51,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:51,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:00:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:51,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:51,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-15 09:00:51,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#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; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {5579#(<= ~counter~0 0)} assume true; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5579#(<= ~counter~0 0)} {5571#true} #102#return; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {5579#(<= ~counter~0 0)} call #t~ret9 := main(); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {5579#(<= ~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; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {5579#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {5579#(<= ~counter~0 0)} ~cond := #in~cond; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {5579#(<= ~counter~0 0)} assume !(0 == ~cond); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {5579#(<= ~counter~0 0)} assume true; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5579#(<= ~counter~0 0)} {5579#(<= ~counter~0 0)} #90#return; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,282 INFO L272 TraceCheckUtils]: 11: Hoare triple {5579#(<= ~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)); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {5579#(<= ~counter~0 0)} ~cond := #in~cond; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {5579#(<= ~counter~0 0)} assume !(0 == ~cond); {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {5579#(<= ~counter~0 0)} assume true; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5579#(<= ~counter~0 0)} {5579#(<= ~counter~0 0)} #92#return; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {5579#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5579#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:51,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {5579#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {5628#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,285 INFO L272 TraceCheckUtils]: 19: Hoare triple {5628#(<= ~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)); {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {5628#(<= ~counter~0 1)} ~cond := #in~cond; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {5628#(<= ~counter~0 1)} assume !(0 == ~cond); {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {5628#(<= ~counter~0 1)} assume true; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,286 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5628#(<= ~counter~0 1)} {5628#(<= ~counter~0 1)} #94#return; {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {5628#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5628#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:51,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {5628#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {5653#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,288 INFO L272 TraceCheckUtils]: 27: Hoare triple {5653#(<= ~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)); {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {5653#(<= ~counter~0 2)} ~cond := #in~cond; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {5653#(<= ~counter~0 2)} assume !(0 == ~cond); {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {5653#(<= ~counter~0 2)} assume true; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,289 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5653#(<= ~counter~0 2)} {5653#(<= ~counter~0 2)} #96#return; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {5653#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5653#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:51,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {5653#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {5678#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,291 INFO L272 TraceCheckUtils]: 35: Hoare triple {5678#(<= ~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)); {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {5678#(<= ~counter~0 3)} ~cond := #in~cond; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {5678#(<= ~counter~0 3)} assume !(0 == ~cond); {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {5678#(<= ~counter~0 3)} assume true; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,292 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5678#(<= ~counter~0 3)} {5678#(<= ~counter~0 3)} #96#return; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {5678#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5678#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:51,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {5678#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5703#(<= |main_#t~post7| 3)} is VALID [2022-04-15 09:00:51,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {5703#(<= |main_#t~post7| 3)} assume !(#t~post7 < 50);havoc #t~post7; {5572#false} is VALID [2022-04-15 09:00:51,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {5572#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5572#false} is VALID [2022-04-15 09:00:51,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#false} assume !(#t~post8 < 50);havoc #t~post8; {5572#false} is VALID [2022-04-15 09:00:51,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5572#false} is VALID [2022-04-15 09:00:51,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#false} assume !(#t~post6 < 50);havoc #t~post6; {5572#false} is VALID [2022-04-15 09:00:51,294 INFO L272 TraceCheckUtils]: 47: Hoare triple {5572#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)); {5572#false} is VALID [2022-04-15 09:00:51,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-15 09:00:51,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 09:00:51,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 09:00:51,294 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-15 09:00:51,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 50: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 49: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 48: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L272 TraceCheckUtils]: 47: Hoare triple {5572#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)); {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 46: Hoare triple {5572#false} assume !(#t~post6 < 50);havoc #t~post6; {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 45: Hoare triple {5572#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {5572#false} assume !(#t~post8 < 50);havoc #t~post8; {5572#false} is VALID [2022-04-15 09:00:51,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {5572#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5572#false} is VALID [2022-04-15 09:00:51,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {5755#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {5572#false} is VALID [2022-04-15 09:00:51,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {5759#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5755#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:00:51,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {5759#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5759#(< ~counter~0 50)} is VALID [2022-04-15 09:00:51,528 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5571#true} {5759#(< ~counter~0 50)} #96#return; {5759#(< ~counter~0 50)} is VALID [2022-04-15 09:00:51,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 09:00:51,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 09:00:51,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 09:00:51,528 INFO L272 TraceCheckUtils]: 35: Hoare triple {5759#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 09:00:51,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {5759#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {5759#(< ~counter~0 50)} is VALID [2022-04-15 09:00:51,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {5784#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5759#(< ~counter~0 50)} is VALID [2022-04-15 09:00:51,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {5784#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5784#(< ~counter~0 49)} is VALID [2022-04-15 09:00:51,531 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5571#true} {5784#(< ~counter~0 49)} #96#return; {5784#(< ~counter~0 49)} is VALID [2022-04-15 09:00:51,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 09:00:51,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 09:00:51,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 09:00:51,531 INFO L272 TraceCheckUtils]: 27: Hoare triple {5784#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 09:00:51,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {5784#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {5784#(< ~counter~0 49)} is VALID [2022-04-15 09:00:51,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {5809#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5784#(< ~counter~0 49)} is VALID [2022-04-15 09:00:51,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {5809#(< ~counter~0 48)} assume !!(0 != ~r~0); {5809#(< ~counter~0 48)} is VALID [2022-04-15 09:00:51,532 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5571#true} {5809#(< ~counter~0 48)} #94#return; {5809#(< ~counter~0 48)} is VALID [2022-04-15 09:00:51,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 09:00:51,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 09:00:51,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 09:00:51,533 INFO L272 TraceCheckUtils]: 19: Hoare triple {5809#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 09:00:51,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {5809#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {5809#(< ~counter~0 48)} is VALID [2022-04-15 09:00:51,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {5834#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5809#(< ~counter~0 48)} is VALID [2022-04-15 09:00:51,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {5834#(< ~counter~0 47)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,534 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5571#true} {5834#(< ~counter~0 47)} #92#return; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 09:00:51,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 09:00:51,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 09:00:51,535 INFO L272 TraceCheckUtils]: 11: Hoare triple {5834#(< ~counter~0 47)} 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)); {5571#true} is VALID [2022-04-15 09:00:51,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5571#true} {5834#(< ~counter~0 47)} #90#return; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 09:00:51,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {5571#true} assume !(0 == ~cond); {5571#true} is VALID [2022-04-15 09:00:51,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {5571#true} ~cond := #in~cond; {5571#true} is VALID [2022-04-15 09:00:51,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {5834#(< ~counter~0 47)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5571#true} is VALID [2022-04-15 09:00:51,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {5834#(< ~counter~0 47)} 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; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {5834#(< ~counter~0 47)} call #t~ret9 := main(); {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5834#(< ~counter~0 47)} {5571#true} #102#return; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {5834#(< ~counter~0 47)} assume true; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#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; {5834#(< ~counter~0 47)} is VALID [2022-04-15 09:00:51,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-15 09:00:51,537 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-15 09:00:51,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:51,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489809113] [2022-04-15 09:00:51,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:51,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011419124] [2022-04-15 09:00:51,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011419124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:51,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:51,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 09:00:51,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:51,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552576712] [2022-04-15 09:00:51,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552576712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:51,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:51,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:00:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61835245] [2022-04-15 09:00:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:51,539 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-15 09:00:51,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:51,539 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-15 09:00:51,590 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-15 09:00:51,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:00:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:00:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:00:51,591 INFO L87 Difference]: Start difference. First operand 114 states and 145 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-15 09:00:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:51,855 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2022-04-15 09:00:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:00:51,855 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-15 09:00:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:51,856 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-15 09:00:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 09:00:51,857 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-15 09:00:51,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 09:00:51,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 09:00:51,929 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-15 09:00:51,931 INFO L225 Difference]: With dead ends: 153 [2022-04-15 09:00:51,931 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 09:00:51,931 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-15 09:00:51,931 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:51,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 133 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:00:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 09:00:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-15 09:00:52,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:52,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:52,011 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:52,011 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:52,013 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-15 09:00:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-15 09:00:52,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:52,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:52,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 116 states. [2022-04-15 09:00:52,014 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 116 states. [2022-04-15 09:00:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:52,016 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-15 09:00:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-15 09:00:52,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:52,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:52,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:52,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 22 states have call successors, (22), 10 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-15 09:00:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2022-04-15 09:00:52,020 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 51 [2022-04-15 09:00:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:52,021 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2022-04-15 09:00:52,021 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-15 09:00:52,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 147 transitions. [2022-04-15 09:00:57,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 145 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:00:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-04-15 09:00:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 09:00:57,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:00:57,974 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-15 09:00:57,991 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-15 09:00:58,175 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-15 09:00:58,175 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:00:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:00:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 09:00:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:58,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711468652] [2022-04-15 09:00:58,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:00:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 09:00:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:00:58,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033972433] [2022-04-15 09:00:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:00:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:00:58,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:00:58,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105790107] [2022-04-15 09:00:58,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:00:58,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:00:58,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:00:58,195 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-15 09:00:58,196 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-15 09:00:58,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:00:58,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:00:58,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:00:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:00:58,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:00:58,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {6662#true} call ULTIMATE.init(); {6662#true} is VALID [2022-04-15 09:00:58,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {6662#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; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {6670#(<= ~counter~0 0)} assume true; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6670#(<= ~counter~0 0)} {6662#true} #102#return; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {6670#(<= ~counter~0 0)} call #t~ret9 := main(); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {6670#(<= ~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; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {6670#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {6670#(<= ~counter~0 0)} ~cond := #in~cond; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {6670#(<= ~counter~0 0)} assume !(0 == ~cond); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {6670#(<= ~counter~0 0)} assume true; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6670#(<= ~counter~0 0)} {6670#(<= ~counter~0 0)} #90#return; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,540 INFO L272 TraceCheckUtils]: 11: Hoare triple {6670#(<= ~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)); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {6670#(<= ~counter~0 0)} ~cond := #in~cond; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {6670#(<= ~counter~0 0)} assume !(0 == ~cond); {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {6670#(<= ~counter~0 0)} assume true; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,542 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6670#(<= ~counter~0 0)} {6670#(<= ~counter~0 0)} #92#return; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {6670#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6670#(<= ~counter~0 0)} is VALID [2022-04-15 09:00:58,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {6670#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {6719#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {6719#(<= ~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)); {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {6719#(<= ~counter~0 1)} ~cond := #in~cond; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {6719#(<= ~counter~0 1)} assume !(0 == ~cond); {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {6719#(<= ~counter~0 1)} assume true; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,545 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6719#(<= ~counter~0 1)} {6719#(<= ~counter~0 1)} #94#return; {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {6719#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6719#(<= ~counter~0 1)} is VALID [2022-04-15 09:00:58,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {6719#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {6744#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,547 INFO L272 TraceCheckUtils]: 27: Hoare triple {6744#(<= ~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)); {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {6744#(<= ~counter~0 2)} ~cond := #in~cond; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {6744#(<= ~counter~0 2)} assume !(0 == ~cond); {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {6744#(<= ~counter~0 2)} assume true; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,549 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6744#(<= ~counter~0 2)} {6744#(<= ~counter~0 2)} #96#return; {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {6744#(<= ~counter~0 2)} assume !(~r~0 > 0); {6744#(<= ~counter~0 2)} is VALID [2022-04-15 09:00:58,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {6744#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {6769#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,550 INFO L272 TraceCheckUtils]: 35: Hoare triple {6769#(<= ~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)); {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {6769#(<= ~counter~0 3)} ~cond := #in~cond; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {6769#(<= ~counter~0 3)} assume !(0 == ~cond); {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {6769#(<= ~counter~0 3)} assume true; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,552 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6769#(<= ~counter~0 3)} {6769#(<= ~counter~0 3)} #98#return; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,552 INFO L290 TraceCheckUtils]: 40: Hoare triple {6769#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6769#(<= ~counter~0 3)} is VALID [2022-04-15 09:00:58,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {6769#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {6794#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,554 INFO L272 TraceCheckUtils]: 43: Hoare triple {6794#(<= ~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)); {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {6794#(<= ~counter~0 4)} ~cond := #in~cond; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {6794#(<= ~counter~0 4)} assume !(0 == ~cond); {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {6794#(<= ~counter~0 4)} assume true; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,555 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6794#(<= ~counter~0 4)} {6794#(<= ~counter~0 4)} #98#return; {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {6794#(<= ~counter~0 4)} assume !(~r~0 < 0); {6794#(<= ~counter~0 4)} is VALID [2022-04-15 09:00:58,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {6794#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6819#(<= |main_#t~post6| 4)} is VALID [2022-04-15 09:00:58,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {6819#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {6663#false} is VALID [2022-04-15 09:00:58,556 INFO L272 TraceCheckUtils]: 51: Hoare triple {6663#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)); {6663#false} is VALID [2022-04-15 09:00:58,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {6663#false} ~cond := #in~cond; {6663#false} is VALID [2022-04-15 09:00:58,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {6663#false} assume 0 == ~cond; {6663#false} is VALID [2022-04-15 09:00:58,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {6663#false} assume !false; {6663#false} is VALID [2022-04-15 09:00:58,557 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-15 09:00:58,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:00:58,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {6663#false} assume !false; {6663#false} is VALID [2022-04-15 09:00:58,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {6663#false} assume 0 == ~cond; {6663#false} is VALID [2022-04-15 09:00:58,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {6663#false} ~cond := #in~cond; {6663#false} is VALID [2022-04-15 09:00:58,873 INFO L272 TraceCheckUtils]: 51: Hoare triple {6663#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)); {6663#false} is VALID [2022-04-15 09:00:58,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {6847#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {6663#false} is VALID [2022-04-15 09:00:58,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {6851#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6847#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:00:58,874 INFO L290 TraceCheckUtils]: 48: Hoare triple {6851#(< ~counter~0 50)} assume !(~r~0 < 0); {6851#(< ~counter~0 50)} is VALID [2022-04-15 09:00:58,874 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6662#true} {6851#(< ~counter~0 50)} #98#return; {6851#(< ~counter~0 50)} is VALID [2022-04-15 09:00:58,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 09:00:58,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 09:00:58,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 09:00:58,875 INFO L272 TraceCheckUtils]: 43: Hoare triple {6851#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 09:00:58,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {6851#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {6851#(< ~counter~0 50)} is VALID [2022-04-15 09:00:58,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {6876#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6851#(< ~counter~0 50)} is VALID [2022-04-15 09:00:58,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {6876#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6876#(< ~counter~0 49)} is VALID [2022-04-15 09:00:58,876 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6662#true} {6876#(< ~counter~0 49)} #98#return; {6876#(< ~counter~0 49)} is VALID [2022-04-15 09:00:58,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 09:00:58,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 09:00:58,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 09:00:58,877 INFO L272 TraceCheckUtils]: 35: Hoare triple {6876#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 09:00:58,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {6876#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {6876#(< ~counter~0 49)} is VALID [2022-04-15 09:00:58,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {6901#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6876#(< ~counter~0 49)} is VALID [2022-04-15 09:00:58,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {6901#(< ~counter~0 48)} assume !(~r~0 > 0); {6901#(< ~counter~0 48)} is VALID [2022-04-15 09:00:58,878 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6662#true} {6901#(< ~counter~0 48)} #96#return; {6901#(< ~counter~0 48)} is VALID [2022-04-15 09:00:58,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 09:00:58,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 09:00:58,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 09:00:58,878 INFO L272 TraceCheckUtils]: 27: Hoare triple {6901#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 09:00:58,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {6901#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {6901#(< ~counter~0 48)} is VALID [2022-04-15 09:00:58,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {6926#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6901#(< ~counter~0 48)} is VALID [2022-04-15 09:00:58,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {6926#(< ~counter~0 47)} assume !!(0 != ~r~0); {6926#(< ~counter~0 47)} is VALID [2022-04-15 09:00:58,880 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6662#true} {6926#(< ~counter~0 47)} #94#return; {6926#(< ~counter~0 47)} is VALID [2022-04-15 09:00:58,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 09:00:58,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 09:00:58,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 09:00:58,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {6926#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 09:00:58,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {6926#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {6926#(< ~counter~0 47)} is VALID [2022-04-15 09:00:58,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {6951#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6926#(< ~counter~0 47)} is VALID [2022-04-15 09:00:58,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {6951#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,882 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6662#true} {6951#(< ~counter~0 46)} #92#return; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 09:00:58,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 09:00:58,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 09:00:58,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {6951#(< ~counter~0 46)} 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)); {6662#true} is VALID [2022-04-15 09:00:58,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6662#true} {6951#(< ~counter~0 46)} #90#return; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {6662#true} assume true; {6662#true} is VALID [2022-04-15 09:00:58,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {6662#true} assume !(0 == ~cond); {6662#true} is VALID [2022-04-15 09:00:58,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {6662#true} ~cond := #in~cond; {6662#true} is VALID [2022-04-15 09:00:58,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {6951#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6662#true} is VALID [2022-04-15 09:00:58,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {6951#(< ~counter~0 46)} 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; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {6951#(< ~counter~0 46)} call #t~ret9 := main(); {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6951#(< ~counter~0 46)} {6662#true} #102#return; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {6951#(< ~counter~0 46)} assume true; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {6662#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; {6951#(< ~counter~0 46)} is VALID [2022-04-15 09:00:58,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {6662#true} call ULTIMATE.init(); {6662#true} is VALID [2022-04-15 09:00:58,885 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-15 09:00:58,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:00:58,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033972433] [2022-04-15 09:00:58,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:00:58,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105790107] [2022-04-15 09:00:58,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105790107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:00:58,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:00:58,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:00:58,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:00:58,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711468652] [2022-04-15 09:00:58,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711468652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:00:58,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:00:58,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:00:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913991064] [2022-04-15 09:00:58,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:00:58,886 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-15 09:00:58,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:00:58,886 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-15 09:00:58,912 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-15 09:00:58,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:00:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:00:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:00:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:00:58,913 INFO L87 Difference]: Start difference. First operand 116 states and 147 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-15 09:00:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:59,190 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 09:00:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:00:59,191 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-15 09:00:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:00:59,191 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-15 09:00:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 09:00:59,192 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-15 09:00:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 09:00:59,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 09:00:59,256 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-15 09:00:59,258 INFO L225 Difference]: With dead ends: 142 [2022-04-15 09:00:59,258 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 09:00:59,258 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-15 09:00:59,259 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:00:59,259 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 160 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:00:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 09:00:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2022-04-15 09:00:59,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:00:59,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:00:59,353 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:00:59,354 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:00:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:59,358 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-15 09:00:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-04-15 09:00:59,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:59,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:59,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 137 states. [2022-04-15 09:00:59,359 INFO L87 Difference]: Start difference. First operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 137 states. [2022-04-15 09:00:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:00:59,363 INFO L93 Difference]: Finished difference Result 137 states and 172 transitions. [2022-04-15 09:00:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 172 transitions. [2022-04-15 09:00:59,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:00:59,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:00:59,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:00:59,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:00:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:00:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2022-04-15 09:00:59,366 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 55 [2022-04-15 09:00:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:00:59,366 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2022-04-15 09:00:59,366 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-15 09:00:59,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 167 transitions. [2022-04-15 09:01:05,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2022-04-15 09:01:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 09:01:05,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:05,324 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-15 09:01:05,342 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-15 09:01:05,524 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-15 09:01:05,524 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 09:01:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:05,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939632311] [2022-04-15 09:01:05,525 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 09:01:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:05,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179335047] [2022-04-15 09:01:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:05,538 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:05,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663721139] [2022-04-15 09:01:05,538 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:01:05,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:05,539 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-15 09:01:05,540 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-15 09:01:05,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:01:05,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:05,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:01:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:05,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:05,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {7831#true} call ULTIMATE.init(); {7831#true} is VALID [2022-04-15 09:01:05,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {7831#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; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7839#(<= ~counter~0 0)} {7831#true} #102#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {7839#(<= ~counter~0 0)} call #t~ret9 := main(); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {7839#(<= ~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; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {7839#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {7839#(<= ~counter~0 0)} ~cond := #in~cond; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {7839#(<= ~counter~0 0)} assume !(0 == ~cond); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7839#(<= ~counter~0 0)} {7839#(<= ~counter~0 0)} #90#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {7839#(<= ~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)); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {7839#(<= ~counter~0 0)} ~cond := #in~cond; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {7839#(<= ~counter~0 0)} assume !(0 == ~cond); {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {7839#(<= ~counter~0 0)} assume true; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,951 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7839#(<= ~counter~0 0)} {7839#(<= ~counter~0 0)} #92#return; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {7839#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7839#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:05,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {7839#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {7888#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,955 INFO L272 TraceCheckUtils]: 19: Hoare triple {7888#(<= ~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)); {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {7888#(<= ~counter~0 1)} ~cond := #in~cond; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {7888#(<= ~counter~0 1)} assume !(0 == ~cond); {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {7888#(<= ~counter~0 1)} assume true; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,957 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7888#(<= ~counter~0 1)} {7888#(<= ~counter~0 1)} #94#return; {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {7888#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7888#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:05,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {7888#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {7913#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,959 INFO L272 TraceCheckUtils]: 27: Hoare triple {7913#(<= ~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)); {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {7913#(<= ~counter~0 2)} ~cond := #in~cond; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,959 INFO L290 TraceCheckUtils]: 29: Hoare triple {7913#(<= ~counter~0 2)} assume !(0 == ~cond); {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {7913#(<= ~counter~0 2)} assume true; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,960 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7913#(<= ~counter~0 2)} {7913#(<= ~counter~0 2)} #96#return; {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {7913#(<= ~counter~0 2)} assume !(~r~0 > 0); {7913#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:05,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {7913#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {7938#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,962 INFO L272 TraceCheckUtils]: 35: Hoare triple {7938#(<= ~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)); {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {7938#(<= ~counter~0 3)} ~cond := #in~cond; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {7938#(<= ~counter~0 3)} assume !(0 == ~cond); {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {7938#(<= ~counter~0 3)} assume true; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,963 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7938#(<= ~counter~0 3)} {7938#(<= ~counter~0 3)} #98#return; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {7938#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7938#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:05,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {7938#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {7963#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,965 INFO L272 TraceCheckUtils]: 43: Hoare triple {7963#(<= ~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)); {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {7963#(<= ~counter~0 4)} ~cond := #in~cond; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {7963#(<= ~counter~0 4)} assume !(0 == ~cond); {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {7963#(<= ~counter~0 4)} assume true; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,980 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7963#(<= ~counter~0 4)} {7963#(<= ~counter~0 4)} #98#return; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {7963#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7963#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:05,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {7963#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7988#(<= |main_#t~post8| 4)} is VALID [2022-04-15 09:01:05,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {7988#(<= |main_#t~post8| 4)} assume !(#t~post8 < 50);havoc #t~post8; {7832#false} is VALID [2022-04-15 09:01:05,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {7832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7832#false} is VALID [2022-04-15 09:01:05,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {7832#false} assume !(#t~post6 < 50);havoc #t~post6; {7832#false} is VALID [2022-04-15 09:01:05,981 INFO L272 TraceCheckUtils]: 53: Hoare triple {7832#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)); {7832#false} is VALID [2022-04-15 09:01:05,981 INFO L290 TraceCheckUtils]: 54: Hoare triple {7832#false} ~cond := #in~cond; {7832#false} is VALID [2022-04-15 09:01:05,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {7832#false} assume 0 == ~cond; {7832#false} is VALID [2022-04-15 09:01:05,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {7832#false} assume !false; {7832#false} is VALID [2022-04-15 09:01:05,982 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-15 09:01:05,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:01:06,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {7832#false} assume !false; {7832#false} is VALID [2022-04-15 09:01:06,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {7832#false} assume 0 == ~cond; {7832#false} is VALID [2022-04-15 09:01:06,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {7832#false} ~cond := #in~cond; {7832#false} is VALID [2022-04-15 09:01:06,264 INFO L272 TraceCheckUtils]: 53: Hoare triple {7832#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)); {7832#false} is VALID [2022-04-15 09:01:06,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {7832#false} assume !(#t~post6 < 50);havoc #t~post6; {7832#false} is VALID [2022-04-15 09:01:06,264 INFO L290 TraceCheckUtils]: 51: Hoare triple {7832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7832#false} is VALID [2022-04-15 09:01:06,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {8028#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {7832#false} is VALID [2022-04-15 09:01:06,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {8032#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8028#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:01:06,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {8032#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8032#(< ~counter~0 50)} is VALID [2022-04-15 09:01:06,266 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7831#true} {8032#(< ~counter~0 50)} #98#return; {8032#(< ~counter~0 50)} is VALID [2022-04-15 09:01:06,266 INFO L290 TraceCheckUtils]: 46: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 09:01:06,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 09:01:06,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 09:01:06,266 INFO L272 TraceCheckUtils]: 43: Hoare triple {8032#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 09:01:06,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {8032#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {8032#(< ~counter~0 50)} is VALID [2022-04-15 09:01:06,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {8057#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8032#(< ~counter~0 50)} is VALID [2022-04-15 09:01:06,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {8057#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8057#(< ~counter~0 49)} is VALID [2022-04-15 09:01:06,268 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7831#true} {8057#(< ~counter~0 49)} #98#return; {8057#(< ~counter~0 49)} is VALID [2022-04-15 09:01:06,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 09:01:06,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 09:01:06,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 09:01:06,268 INFO L272 TraceCheckUtils]: 35: Hoare triple {8057#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 09:01:06,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {8057#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {8057#(< ~counter~0 49)} is VALID [2022-04-15 09:01:06,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {8082#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8057#(< ~counter~0 49)} is VALID [2022-04-15 09:01:06,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {8082#(< ~counter~0 48)} assume !(~r~0 > 0); {8082#(< ~counter~0 48)} is VALID [2022-04-15 09:01:06,270 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7831#true} {8082#(< ~counter~0 48)} #96#return; {8082#(< ~counter~0 48)} is VALID [2022-04-15 09:01:06,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 09:01:06,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 09:01:06,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 09:01:06,270 INFO L272 TraceCheckUtils]: 27: Hoare triple {8082#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 09:01:06,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {8082#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {8082#(< ~counter~0 48)} is VALID [2022-04-15 09:01:06,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {8107#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8082#(< ~counter~0 48)} is VALID [2022-04-15 09:01:06,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {8107#(< ~counter~0 47)} assume !!(0 != ~r~0); {8107#(< ~counter~0 47)} is VALID [2022-04-15 09:01:06,274 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7831#true} {8107#(< ~counter~0 47)} #94#return; {8107#(< ~counter~0 47)} is VALID [2022-04-15 09:01:06,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 09:01:06,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 09:01:06,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 09:01:06,274 INFO L272 TraceCheckUtils]: 19: Hoare triple {8107#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 09:01:06,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {8107#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {8107#(< ~counter~0 47)} is VALID [2022-04-15 09:01:06,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {8132#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8107#(< ~counter~0 47)} is VALID [2022-04-15 09:01:06,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {8132#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,276 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7831#true} {8132#(< ~counter~0 46)} #92#return; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 09:01:06,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 09:01:06,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 09:01:06,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {8132#(< ~counter~0 46)} 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)); {7831#true} is VALID [2022-04-15 09:01:06,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7831#true} {8132#(< ~counter~0 46)} #90#return; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {7831#true} assume true; {7831#true} is VALID [2022-04-15 09:01:06,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {7831#true} assume !(0 == ~cond); {7831#true} is VALID [2022-04-15 09:01:06,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {7831#true} ~cond := #in~cond; {7831#true} is VALID [2022-04-15 09:01:06,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {8132#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7831#true} is VALID [2022-04-15 09:01:06,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {8132#(< ~counter~0 46)} 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; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {8132#(< ~counter~0 46)} call #t~ret9 := main(); {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8132#(< ~counter~0 46)} {7831#true} #102#return; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {8132#(< ~counter~0 46)} assume true; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {7831#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; {8132#(< ~counter~0 46)} is VALID [2022-04-15 09:01:06,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {7831#true} call ULTIMATE.init(); {7831#true} is VALID [2022-04-15 09:01:06,279 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-15 09:01:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:06,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179335047] [2022-04-15 09:01:06,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:06,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663721139] [2022-04-15 09:01:06,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663721139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:01:06,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:01:06,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:01:06,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:06,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939632311] [2022-04-15 09:01:06,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939632311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:06,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:06,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:01:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860631068] [2022-04-15 09:01:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:06,281 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-15 09:01:06,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:06,281 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-15 09:01:06,326 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-15 09:01:06,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:01:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:01:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:01:06,328 INFO L87 Difference]: Start difference. First operand 133 states and 167 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-15 09:01:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:06,615 INFO L93 Difference]: Finished difference Result 204 states and 269 transitions. [2022-04-15 09:01:06,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:01:06,615 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-15 09:01:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:06,615 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-15 09:01:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 09:01:06,616 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-15 09:01:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 09:01:06,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 09:01:06,713 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-15 09:01:06,715 INFO L225 Difference]: With dead ends: 204 [2022-04-15 09:01:06,715 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 09:01:06,715 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-15 09:01:06,716 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:01:06,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 174 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:01:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 09:01:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2022-04-15 09:01:06,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:06,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:06,814 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:06,815 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:06,817 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-15 09:01:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2022-04-15 09:01:06,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:06,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:06,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 139 states. [2022-04-15 09:01:06,818 INFO L87 Difference]: Start difference. First operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 139 states. [2022-04-15 09:01:06,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:06,820 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2022-04-15 09:01:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2022-04-15 09:01:06,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:06,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:06,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:06,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2022-04-15 09:01:06,823 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 57 [2022-04-15 09:01:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:06,823 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2022-04-15 09:01:06,823 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-15 09:01:06,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 173 transitions. [2022-04-15 09:01:13,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 171 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2022-04-15 09:01:13,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 09:01:13,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:13,708 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-15 09:01:13,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 09:01:13,909 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-15 09:01:13,909 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 09:01:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:13,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884197658] [2022-04-15 09:01:13,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 09:01:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:13,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143637085] [2022-04-15 09:01:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:13,931 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:13,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400772389] [2022-04-15 09:01:13,932 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:01:13,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:13,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:13,943 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-15 09:01:13,949 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-15 09:01:14,025 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 09:01:14,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:14,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:01:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:14,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:14,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9152#true} is VALID [2022-04-15 09:01:14,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#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; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {9160#(<= ~counter~0 0)} assume true; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9160#(<= ~counter~0 0)} {9152#true} #102#return; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {9160#(<= ~counter~0 0)} call #t~ret9 := main(); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {9160#(<= ~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; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {9160#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {9160#(<= ~counter~0 0)} ~cond := #in~cond; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {9160#(<= ~counter~0 0)} assume !(0 == ~cond); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {9160#(<= ~counter~0 0)} assume true; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9160#(<= ~counter~0 0)} {9160#(<= ~counter~0 0)} #90#return; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,298 INFO L272 TraceCheckUtils]: 11: Hoare triple {9160#(<= ~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)); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {9160#(<= ~counter~0 0)} ~cond := #in~cond; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {9160#(<= ~counter~0 0)} assume !(0 == ~cond); {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {9160#(<= ~counter~0 0)} assume true; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,300 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9160#(<= ~counter~0 0)} {9160#(<= ~counter~0 0)} #92#return; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {9160#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9160#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:14,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {9160#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {9209#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,301 INFO L272 TraceCheckUtils]: 19: Hoare triple {9209#(<= ~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)); {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {9209#(<= ~counter~0 1)} ~cond := #in~cond; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {9209#(<= ~counter~0 1)} assume !(0 == ~cond); {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {9209#(<= ~counter~0 1)} assume true; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,302 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9209#(<= ~counter~0 1)} {9209#(<= ~counter~0 1)} #94#return; {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {9209#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9209#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:14,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {9209#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {9234#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,303 INFO L272 TraceCheckUtils]: 27: Hoare triple {9234#(<= ~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)); {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {9234#(<= ~counter~0 2)} ~cond := #in~cond; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {9234#(<= ~counter~0 2)} assume !(0 == ~cond); {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {9234#(<= ~counter~0 2)} assume true; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,306 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9234#(<= ~counter~0 2)} {9234#(<= ~counter~0 2)} #96#return; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {9234#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9234#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:14,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {9234#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {9259#(<= ~counter~0 3)} assume !!(#t~post7 < 50);havoc #t~post7; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,307 INFO L272 TraceCheckUtils]: 35: Hoare triple {9259#(<= ~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)); {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {9259#(<= ~counter~0 3)} ~cond := #in~cond; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {9259#(<= ~counter~0 3)} assume !(0 == ~cond); {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {9259#(<= ~counter~0 3)} assume true; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,309 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9259#(<= ~counter~0 3)} {9259#(<= ~counter~0 3)} #96#return; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {9259#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9259#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:14,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {9259#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,309 INFO L290 TraceCheckUtils]: 42: Hoare triple {9284#(<= ~counter~0 4)} assume !!(#t~post7 < 50);havoc #t~post7; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,310 INFO L272 TraceCheckUtils]: 43: Hoare triple {9284#(<= ~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)); {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {9284#(<= ~counter~0 4)} ~cond := #in~cond; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {9284#(<= ~counter~0 4)} assume !(0 == ~cond); {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {9284#(<= ~counter~0 4)} assume true; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,311 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9284#(<= ~counter~0 4)} {9284#(<= ~counter~0 4)} #96#return; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {9284#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9284#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:14,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {9284#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9309#(<= |main_#t~post7| 4)} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {9309#(<= |main_#t~post7| 4)} assume !(#t~post7 < 50);havoc #t~post7; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {9153#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 52: Hoare triple {9153#false} assume !(#t~post8 < 50);havoc #t~post8; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 53: Hoare triple {9153#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 54: Hoare triple {9153#false} assume !(#t~post6 < 50);havoc #t~post6; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L272 TraceCheckUtils]: 55: Hoare triple {9153#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)); {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 56: Hoare triple {9153#false} ~cond := #in~cond; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 57: Hoare triple {9153#false} assume 0 == ~cond; {9153#false} is VALID [2022-04-15 09:01:14,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-15 09:01:14,313 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-15 09:01:14,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:01:14,599 INFO L290 TraceCheckUtils]: 58: Hoare triple {9153#false} assume !false; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {9153#false} assume 0 == ~cond; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {9153#false} ~cond := #in~cond; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L272 TraceCheckUtils]: 55: Hoare triple {9153#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)); {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {9153#false} assume !(#t~post6 < 50);havoc #t~post6; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {9153#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {9153#false} assume !(#t~post8 < 50);havoc #t~post8; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {9153#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9153#false} is VALID [2022-04-15 09:01:14,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {9361#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {9153#false} is VALID [2022-04-15 09:01:14,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {9365#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9361#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:01:14,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {9365#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9365#(< ~counter~0 50)} is VALID [2022-04-15 09:01:14,602 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9152#true} {9365#(< ~counter~0 50)} #96#return; {9365#(< ~counter~0 50)} is VALID [2022-04-15 09:01:14,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 09:01:14,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 09:01:14,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 09:01:14,602 INFO L272 TraceCheckUtils]: 43: Hoare triple {9365#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 09:01:14,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {9365#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {9365#(< ~counter~0 50)} is VALID [2022-04-15 09:01:14,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {9390#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9365#(< ~counter~0 50)} is VALID [2022-04-15 09:01:14,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {9390#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9390#(< ~counter~0 49)} is VALID [2022-04-15 09:01:14,604 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9152#true} {9390#(< ~counter~0 49)} #96#return; {9390#(< ~counter~0 49)} is VALID [2022-04-15 09:01:14,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 09:01:14,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 09:01:14,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 09:01:14,604 INFO L272 TraceCheckUtils]: 35: Hoare triple {9390#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 09:01:14,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {9390#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {9390#(< ~counter~0 49)} is VALID [2022-04-15 09:01:14,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {9415#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9390#(< ~counter~0 49)} is VALID [2022-04-15 09:01:14,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {9415#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9415#(< ~counter~0 48)} is VALID [2022-04-15 09:01:14,616 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9152#true} {9415#(< ~counter~0 48)} #96#return; {9415#(< ~counter~0 48)} is VALID [2022-04-15 09:01:14,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 09:01:14,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 09:01:14,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 09:01:14,617 INFO L272 TraceCheckUtils]: 27: Hoare triple {9415#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 09:01:14,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {9415#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {9415#(< ~counter~0 48)} is VALID [2022-04-15 09:01:14,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {9440#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9415#(< ~counter~0 48)} is VALID [2022-04-15 09:01:14,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {9440#(< ~counter~0 47)} assume !!(0 != ~r~0); {9440#(< ~counter~0 47)} is VALID [2022-04-15 09:01:14,618 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9152#true} {9440#(< ~counter~0 47)} #94#return; {9440#(< ~counter~0 47)} is VALID [2022-04-15 09:01:14,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 09:01:14,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 09:01:14,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 09:01:14,619 INFO L272 TraceCheckUtils]: 19: Hoare triple {9440#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 09:01:14,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {9440#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {9440#(< ~counter~0 47)} is VALID [2022-04-15 09:01:14,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {9465#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9440#(< ~counter~0 47)} is VALID [2022-04-15 09:01:14,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {9465#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9152#true} {9465#(< ~counter~0 46)} #92#return; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 09:01:14,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 09:01:14,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 09:01:14,620 INFO L272 TraceCheckUtils]: 11: Hoare triple {9465#(< ~counter~0 46)} 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)); {9152#true} is VALID [2022-04-15 09:01:14,621 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9152#true} {9465#(< ~counter~0 46)} #90#return; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {9152#true} assume true; {9152#true} is VALID [2022-04-15 09:01:14,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {9152#true} assume !(0 == ~cond); {9152#true} is VALID [2022-04-15 09:01:14,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {9152#true} ~cond := #in~cond; {9152#true} is VALID [2022-04-15 09:01:14,621 INFO L272 TraceCheckUtils]: 6: Hoare triple {9465#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9152#true} is VALID [2022-04-15 09:01:14,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {9465#(< ~counter~0 46)} 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; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {9465#(< ~counter~0 46)} call #t~ret9 := main(); {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9465#(< ~counter~0 46)} {9152#true} #102#return; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {9465#(< ~counter~0 46)} assume true; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {9152#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; {9465#(< ~counter~0 46)} is VALID [2022-04-15 09:01:14,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {9152#true} call ULTIMATE.init(); {9152#true} is VALID [2022-04-15 09:01:14,623 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-15 09:01:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143637085] [2022-04-15 09:01:14,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400772389] [2022-04-15 09:01:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400772389] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:01:14,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:01:14,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:01:14,624 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884197658] [2022-04-15 09:01:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884197658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:14,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:14,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:01:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211083811] [2022-04-15 09:01:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:14,625 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-15 09:01:14,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:14,626 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-15 09:01:14,664 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-15 09:01:14,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:01:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:01:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:01:14,667 INFO L87 Difference]: Start difference. First operand 138 states and 173 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-15 09:01:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:14,960 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-15 09:01:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:01:14,960 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-15 09:01:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:14,960 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-15 09:01:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 09:01:14,961 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-15 09:01:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 09:01:14,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 09:01:15,091 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-15 09:01:15,093 INFO L225 Difference]: With dead ends: 177 [2022-04-15 09:01:15,093 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 09:01:15,093 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-15 09:01:15,094 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:01:15,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 160 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:01:15,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 09:01:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-15 09:01:15,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:15,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:15,212 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:15,214 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:15,216 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-04-15 09:01:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2022-04-15 09:01:15,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:15,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:15,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 140 states. [2022-04-15 09:01:15,241 INFO L87 Difference]: Start difference. First operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 140 states. [2022-04-15 09:01:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:15,243 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2022-04-15 09:01:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2022-04-15 09:01:15,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:15,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:15,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:15,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 09:01:15,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 175 transitions. [2022-04-15 09:01:15,246 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 175 transitions. Word has length 59 [2022-04-15 09:01:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:15,246 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 175 transitions. [2022-04-15 09:01:15,246 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-15 09:01:15,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 175 transitions. [2022-04-15 09:01:24,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 171 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2022-04-15 09:01:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 09:01:24,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:24,383 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-15 09:01:24,392 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-15 09:01:24,584 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-15 09:01:24,584 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 09:01:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:24,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [485410421] [2022-04-15 09:01:24,585 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 09:01:24,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:24,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908684519] [2022-04-15 09:01:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:24,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:24,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:24,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1887802148] [2022-04-15 09:01:24,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:01:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:24,599 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-15 09:01:24,600 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-15 09:01:24,655 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:01:24,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:24,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:01:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:24,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:24,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {10439#true} call ULTIMATE.init(); {10439#true} is VALID [2022-04-15 09:01:24,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {10439#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; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {10447#(<= ~counter~0 0)} assume true; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10447#(<= ~counter~0 0)} {10439#true} #102#return; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {10447#(<= ~counter~0 0)} call #t~ret9 := main(); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {10447#(<= ~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; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {10447#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {10447#(<= ~counter~0 0)} ~cond := #in~cond; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {10447#(<= ~counter~0 0)} assume !(0 == ~cond); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {10447#(<= ~counter~0 0)} assume true; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10447#(<= ~counter~0 0)} {10447#(<= ~counter~0 0)} #90#return; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,978 INFO L272 TraceCheckUtils]: 11: Hoare triple {10447#(<= ~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)); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {10447#(<= ~counter~0 0)} ~cond := #in~cond; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {10447#(<= ~counter~0 0)} assume !(0 == ~cond); {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {10447#(<= ~counter~0 0)} assume true; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,979 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10447#(<= ~counter~0 0)} {10447#(<= ~counter~0 0)} #92#return; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {10447#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10447#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:24,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {10447#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {10496#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,981 INFO L272 TraceCheckUtils]: 19: Hoare triple {10496#(<= ~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)); {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {10496#(<= ~counter~0 1)} ~cond := #in~cond; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {10496#(<= ~counter~0 1)} assume !(0 == ~cond); {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,981 INFO L290 TraceCheckUtils]: 22: Hoare triple {10496#(<= ~counter~0 1)} assume true; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,982 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10496#(<= ~counter~0 1)} {10496#(<= ~counter~0 1)} #94#return; {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {10496#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10496#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:24,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {10496#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {10521#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,983 INFO L272 TraceCheckUtils]: 27: Hoare triple {10521#(<= ~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)); {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {10521#(<= ~counter~0 2)} ~cond := #in~cond; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {10521#(<= ~counter~0 2)} assume !(0 == ~cond); {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {10521#(<= ~counter~0 2)} assume true; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,985 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10521#(<= ~counter~0 2)} {10521#(<= ~counter~0 2)} #96#return; {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {10521#(<= ~counter~0 2)} assume !(~r~0 > 0); {10521#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:24,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {10521#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {10546#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,986 INFO L272 TraceCheckUtils]: 35: Hoare triple {10546#(<= ~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)); {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {10546#(<= ~counter~0 3)} ~cond := #in~cond; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {10546#(<= ~counter~0 3)} assume !(0 == ~cond); {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {10546#(<= ~counter~0 3)} assume true; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,988 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10546#(<= ~counter~0 3)} {10546#(<= ~counter~0 3)} #98#return; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {10546#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10546#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:24,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {10546#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {10571#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,989 INFO L272 TraceCheckUtils]: 43: Hoare triple {10571#(<= ~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)); {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {10571#(<= ~counter~0 4)} ~cond := #in~cond; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {10571#(<= ~counter~0 4)} assume !(0 == ~cond); {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {10571#(<= ~counter~0 4)} assume true; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,991 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10571#(<= ~counter~0 4)} {10571#(<= ~counter~0 4)} #98#return; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {10571#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10571#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:24,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {10571#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {10596#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,992 INFO L272 TraceCheckUtils]: 51: Hoare triple {10596#(<= ~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)); {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {10596#(<= ~counter~0 5)} ~cond := #in~cond; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {10596#(<= ~counter~0 5)} assume !(0 == ~cond); {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {10596#(<= ~counter~0 5)} assume true; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,994 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10596#(<= ~counter~0 5)} {10596#(<= ~counter~0 5)} #98#return; {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {10596#(<= ~counter~0 5)} assume !(~r~0 < 0); {10596#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:24,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {10596#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10621#(<= |main_#t~post6| 5)} is VALID [2022-04-15 09:01:24,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {10621#(<= |main_#t~post6| 5)} assume !(#t~post6 < 50);havoc #t~post6; {10440#false} is VALID [2022-04-15 09:01:24,995 INFO L272 TraceCheckUtils]: 59: Hoare triple {10440#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)); {10440#false} is VALID [2022-04-15 09:01:24,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {10440#false} ~cond := #in~cond; {10440#false} is VALID [2022-04-15 09:01:24,995 INFO L290 TraceCheckUtils]: 61: Hoare triple {10440#false} assume 0 == ~cond; {10440#false} is VALID [2022-04-15 09:01:24,995 INFO L290 TraceCheckUtils]: 62: Hoare triple {10440#false} assume !false; {10440#false} is VALID [2022-04-15 09:01:24,995 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-15 09:01:24,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:01:25,316 INFO L290 TraceCheckUtils]: 62: Hoare triple {10440#false} assume !false; {10440#false} is VALID [2022-04-15 09:01:25,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {10440#false} assume 0 == ~cond; {10440#false} is VALID [2022-04-15 09:01:25,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {10440#false} ~cond := #in~cond; {10440#false} is VALID [2022-04-15 09:01:25,317 INFO L272 TraceCheckUtils]: 59: Hoare triple {10440#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)); {10440#false} is VALID [2022-04-15 09:01:25,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {10649#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {10440#false} is VALID [2022-04-15 09:01:25,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {10653#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10649#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:01:25,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {10653#(< ~counter~0 50)} assume !(~r~0 < 0); {10653#(< ~counter~0 50)} is VALID [2022-04-15 09:01:25,318 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10439#true} {10653#(< ~counter~0 50)} #98#return; {10653#(< ~counter~0 50)} is VALID [2022-04-15 09:01:25,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,319 INFO L272 TraceCheckUtils]: 51: Hoare triple {10653#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 09:01:25,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {10653#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {10653#(< ~counter~0 50)} is VALID [2022-04-15 09:01:25,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {10678#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10653#(< ~counter~0 50)} is VALID [2022-04-15 09:01:25,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {10678#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10678#(< ~counter~0 49)} is VALID [2022-04-15 09:01:25,320 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10439#true} {10678#(< ~counter~0 49)} #98#return; {10678#(< ~counter~0 49)} is VALID [2022-04-15 09:01:25,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,321 INFO L272 TraceCheckUtils]: 43: Hoare triple {10678#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 09:01:25,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {10678#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {10678#(< ~counter~0 49)} is VALID [2022-04-15 09:01:25,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {10703#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10678#(< ~counter~0 49)} is VALID [2022-04-15 09:01:25,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {10703#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10703#(< ~counter~0 48)} is VALID [2022-04-15 09:01:25,322 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10439#true} {10703#(< ~counter~0 48)} #98#return; {10703#(< ~counter~0 48)} is VALID [2022-04-15 09:01:25,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,322 INFO L272 TraceCheckUtils]: 35: Hoare triple {10703#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 09:01:25,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {10703#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {10703#(< ~counter~0 48)} is VALID [2022-04-15 09:01:25,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {10728#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10703#(< ~counter~0 48)} is VALID [2022-04-15 09:01:25,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {10728#(< ~counter~0 47)} assume !(~r~0 > 0); {10728#(< ~counter~0 47)} is VALID [2022-04-15 09:01:25,324 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10439#true} {10728#(< ~counter~0 47)} #96#return; {10728#(< ~counter~0 47)} is VALID [2022-04-15 09:01:25,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,324 INFO L272 TraceCheckUtils]: 27: Hoare triple {10728#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 09:01:25,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {10728#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {10728#(< ~counter~0 47)} is VALID [2022-04-15 09:01:25,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {10753#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10728#(< ~counter~0 47)} is VALID [2022-04-15 09:01:25,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {10753#(< ~counter~0 46)} assume !!(0 != ~r~0); {10753#(< ~counter~0 46)} is VALID [2022-04-15 09:01:25,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10439#true} {10753#(< ~counter~0 46)} #94#return; {10753#(< ~counter~0 46)} is VALID [2022-04-15 09:01:25,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {10753#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 09:01:25,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {10753#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {10753#(< ~counter~0 46)} is VALID [2022-04-15 09:01:25,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {10778#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10753#(< ~counter~0 46)} is VALID [2022-04-15 09:01:25,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {10778#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,328 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10439#true} {10778#(< ~counter~0 45)} #92#return; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,328 INFO L272 TraceCheckUtils]: 11: Hoare triple {10778#(< ~counter~0 45)} 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)); {10439#true} is VALID [2022-04-15 09:01:25,328 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10439#true} {10778#(< ~counter~0 45)} #90#return; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {10439#true} assume true; {10439#true} is VALID [2022-04-15 09:01:25,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {10439#true} assume !(0 == ~cond); {10439#true} is VALID [2022-04-15 09:01:25,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {10439#true} ~cond := #in~cond; {10439#true} is VALID [2022-04-15 09:01:25,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {10778#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10439#true} is VALID [2022-04-15 09:01:25,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {10778#(< ~counter~0 45)} 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; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {10778#(< ~counter~0 45)} call #t~ret9 := main(); {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10778#(< ~counter~0 45)} {10439#true} #102#return; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {10778#(< ~counter~0 45)} assume true; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {10439#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; {10778#(< ~counter~0 45)} is VALID [2022-04-15 09:01:25,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {10439#true} call ULTIMATE.init(); {10439#true} is VALID [2022-04-15 09:01:25,331 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-15 09:01:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:25,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908684519] [2022-04-15 09:01:25,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:25,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887802148] [2022-04-15 09:01:25,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887802148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:01:25,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:01:25,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:01:25,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:25,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [485410421] [2022-04-15 09:01:25,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [485410421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:25,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:25,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:01:25,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969061319] [2022-04-15 09:01:25,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:25,333 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-15 09:01:25,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:25,334 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-15 09:01:25,377 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-15 09:01:25,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:01:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:01:25,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:01:25,378 INFO L87 Difference]: Start difference. First operand 140 states and 175 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-15 09:01:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:25,788 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2022-04-15 09:01:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:01:25,788 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-15 09:01:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:25,788 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-15 09:01:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 09:01:25,789 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-15 09:01:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 09:01:25,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-15 09:01:25,870 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-15 09:01:25,872 INFO L225 Difference]: With dead ends: 172 [2022-04-15 09:01:25,872 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 09:01:25,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:01:25,873 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 51 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:01:25,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:01:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 09:01:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2022-04-15 09:01:25,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:25,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:25,997 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:25,997 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:26,000 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2022-04-15 09:01:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-04-15 09:01:26,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:26,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:26,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 167 states. [2022-04-15 09:01:26,001 INFO L87 Difference]: Start difference. First operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 167 states. [2022-04-15 09:01:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:26,003 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2022-04-15 09:01:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-04-15 09:01:26,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:26,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:26,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:26,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 116 states have (on average 1.2155172413793103) internal successors, (141), 119 states have internal predecessors, (141), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2022-04-15 09:01:26,007 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 63 [2022-04-15 09:01:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:26,007 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2022-04-15 09:01:26,007 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-15 09:01:26,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 199 transitions. [2022-04-15 09:01:31,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2022-04-15 09:01:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 09:01:31,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:31,720 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-15 09:01:31,738 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-15 09:01:31,920 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-15 09:01:31,920 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-15 09:01:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:31,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900598357] [2022-04-15 09:01:31,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-15 09:01:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:31,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30841695] [2022-04-15 09:01:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:31,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:31,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336553890] [2022-04-15 09:01:31,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:01:31,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:31,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:31,944 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-15 09:01:31,952 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-15 09:01:32,011 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 09:01:32,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:32,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:01:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:32,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:32,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {11832#true} call ULTIMATE.init(); {11832#true} is VALID [2022-04-15 09:01:32,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {11832#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; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#(<= ~counter~0 0)} assume true; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#(<= ~counter~0 0)} {11832#true} #102#return; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#(<= ~counter~0 0)} call #t~ret9 := main(); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#(<= ~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; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {11840#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#(<= ~counter~0 0)} ~cond := #in~cond; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#(<= ~counter~0 0)} assume !(0 == ~cond); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {11840#(<= ~counter~0 0)} assume true; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11840#(<= ~counter~0 0)} {11840#(<= ~counter~0 0)} #90#return; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,348 INFO L272 TraceCheckUtils]: 11: Hoare triple {11840#(<= ~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)); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {11840#(<= ~counter~0 0)} ~cond := #in~cond; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {11840#(<= ~counter~0 0)} assume !(0 == ~cond); {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {11840#(<= ~counter~0 0)} assume true; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11840#(<= ~counter~0 0)} {11840#(<= ~counter~0 0)} #92#return; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {11840#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11840#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:32,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {11840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {11889#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,351 INFO L272 TraceCheckUtils]: 19: Hoare triple {11889#(<= ~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)); {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {11889#(<= ~counter~0 1)} ~cond := #in~cond; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {11889#(<= ~counter~0 1)} assume !(0 == ~cond); {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {11889#(<= ~counter~0 1)} assume true; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,353 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11889#(<= ~counter~0 1)} {11889#(<= ~counter~0 1)} #94#return; {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {11889#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11889#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:32,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {11889#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {11914#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,354 INFO L272 TraceCheckUtils]: 27: Hoare triple {11914#(<= ~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)); {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {11914#(<= ~counter~0 2)} ~cond := #in~cond; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {11914#(<= ~counter~0 2)} assume !(0 == ~cond); {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {11914#(<= ~counter~0 2)} assume true; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,356 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11914#(<= ~counter~0 2)} {11914#(<= ~counter~0 2)} #96#return; {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {11914#(<= ~counter~0 2)} assume !(~r~0 > 0); {11914#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:32,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {11914#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {11939#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,357 INFO L272 TraceCheckUtils]: 35: Hoare triple {11939#(<= ~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)); {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {11939#(<= ~counter~0 3)} ~cond := #in~cond; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {11939#(<= ~counter~0 3)} assume !(0 == ~cond); {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {11939#(<= ~counter~0 3)} assume true; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,359 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11939#(<= ~counter~0 3)} {11939#(<= ~counter~0 3)} #98#return; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {11939#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11939#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:32,359 INFO L290 TraceCheckUtils]: 41: Hoare triple {11939#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,360 INFO L290 TraceCheckUtils]: 42: Hoare triple {11964#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,360 INFO L272 TraceCheckUtils]: 43: Hoare triple {11964#(<= ~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)); {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,360 INFO L290 TraceCheckUtils]: 44: Hoare triple {11964#(<= ~counter~0 4)} ~cond := #in~cond; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {11964#(<= ~counter~0 4)} assume !(0 == ~cond); {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {11964#(<= ~counter~0 4)} assume true; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,362 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11964#(<= ~counter~0 4)} {11964#(<= ~counter~0 4)} #98#return; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,362 INFO L290 TraceCheckUtils]: 48: Hoare triple {11964#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11964#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:32,362 INFO L290 TraceCheckUtils]: 49: Hoare triple {11964#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {11989#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,363 INFO L272 TraceCheckUtils]: 51: Hoare triple {11989#(<= ~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)); {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,363 INFO L290 TraceCheckUtils]: 52: Hoare triple {11989#(<= ~counter~0 5)} ~cond := #in~cond; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,364 INFO L290 TraceCheckUtils]: 53: Hoare triple {11989#(<= ~counter~0 5)} assume !(0 == ~cond); {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,364 INFO L290 TraceCheckUtils]: 54: Hoare triple {11989#(<= ~counter~0 5)} assume true; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,365 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11989#(<= ~counter~0 5)} {11989#(<= ~counter~0 5)} #98#return; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {11989#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11989#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:32,365 INFO L290 TraceCheckUtils]: 57: Hoare triple {11989#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12014#(<= |main_#t~post8| 5)} is VALID [2022-04-15 09:01:32,366 INFO L290 TraceCheckUtils]: 58: Hoare triple {12014#(<= |main_#t~post8| 5)} assume !(#t~post8 < 50);havoc #t~post8; {11833#false} is VALID [2022-04-15 09:01:32,366 INFO L290 TraceCheckUtils]: 59: Hoare triple {11833#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11833#false} is VALID [2022-04-15 09:01:32,366 INFO L290 TraceCheckUtils]: 60: Hoare triple {11833#false} assume !(#t~post6 < 50);havoc #t~post6; {11833#false} is VALID [2022-04-15 09:01:32,366 INFO L272 TraceCheckUtils]: 61: Hoare triple {11833#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)); {11833#false} is VALID [2022-04-15 09:01:32,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {11833#false} ~cond := #in~cond; {11833#false} is VALID [2022-04-15 09:01:32,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {11833#false} assume 0 == ~cond; {11833#false} is VALID [2022-04-15 09:01:32,366 INFO L290 TraceCheckUtils]: 64: Hoare triple {11833#false} assume !false; {11833#false} is VALID [2022-04-15 09:01:32,366 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-15 09:01:32,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:01:32,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {11833#false} assume !false; {11833#false} is VALID [2022-04-15 09:01:32,667 INFO L290 TraceCheckUtils]: 63: Hoare triple {11833#false} assume 0 == ~cond; {11833#false} is VALID [2022-04-15 09:01:32,667 INFO L290 TraceCheckUtils]: 62: Hoare triple {11833#false} ~cond := #in~cond; {11833#false} is VALID [2022-04-15 09:01:32,668 INFO L272 TraceCheckUtils]: 61: Hoare triple {11833#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)); {11833#false} is VALID [2022-04-15 09:01:32,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {11833#false} assume !(#t~post6 < 50);havoc #t~post6; {11833#false} is VALID [2022-04-15 09:01:32,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {11833#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11833#false} is VALID [2022-04-15 09:01:32,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {12054#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {11833#false} is VALID [2022-04-15 09:01:32,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {12058#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12054#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:01:32,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {12058#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12058#(< ~counter~0 50)} is VALID [2022-04-15 09:01:32,669 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11832#true} {12058#(< ~counter~0 50)} #98#return; {12058#(< ~counter~0 50)} is VALID [2022-04-15 09:01:32,669 INFO L290 TraceCheckUtils]: 54: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,669 INFO L290 TraceCheckUtils]: 53: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,669 INFO L290 TraceCheckUtils]: 52: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,669 INFO L272 TraceCheckUtils]: 51: Hoare triple {12058#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 09:01:32,669 INFO L290 TraceCheckUtils]: 50: Hoare triple {12058#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {12058#(< ~counter~0 50)} is VALID [2022-04-15 09:01:32,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {12083#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12058#(< ~counter~0 50)} is VALID [2022-04-15 09:01:32,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {12083#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12083#(< ~counter~0 49)} is VALID [2022-04-15 09:01:32,670 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11832#true} {12083#(< ~counter~0 49)} #98#return; {12083#(< ~counter~0 49)} is VALID [2022-04-15 09:01:32,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,671 INFO L272 TraceCheckUtils]: 43: Hoare triple {12083#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 09:01:32,671 INFO L290 TraceCheckUtils]: 42: Hoare triple {12083#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {12083#(< ~counter~0 49)} is VALID [2022-04-15 09:01:32,671 INFO L290 TraceCheckUtils]: 41: Hoare triple {12108#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12083#(< ~counter~0 49)} is VALID [2022-04-15 09:01:32,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {12108#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12108#(< ~counter~0 48)} is VALID [2022-04-15 09:01:32,672 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11832#true} {12108#(< ~counter~0 48)} #98#return; {12108#(< ~counter~0 48)} is VALID [2022-04-15 09:01:32,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,672 INFO L272 TraceCheckUtils]: 35: Hoare triple {12108#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 09:01:32,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {12108#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {12108#(< ~counter~0 48)} is VALID [2022-04-15 09:01:32,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {12133#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12108#(< ~counter~0 48)} is VALID [2022-04-15 09:01:32,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {12133#(< ~counter~0 47)} assume !(~r~0 > 0); {12133#(< ~counter~0 47)} is VALID [2022-04-15 09:01:32,673 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11832#true} {12133#(< ~counter~0 47)} #96#return; {12133#(< ~counter~0 47)} is VALID [2022-04-15 09:01:32,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,673 INFO L272 TraceCheckUtils]: 27: Hoare triple {12133#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 09:01:32,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {12133#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {12133#(< ~counter~0 47)} is VALID [2022-04-15 09:01:32,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {12158#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12133#(< ~counter~0 47)} is VALID [2022-04-15 09:01:32,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {12158#(< ~counter~0 46)} assume !!(0 != ~r~0); {12158#(< ~counter~0 46)} is VALID [2022-04-15 09:01:32,674 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11832#true} {12158#(< ~counter~0 46)} #94#return; {12158#(< ~counter~0 46)} is VALID [2022-04-15 09:01:32,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {12158#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 09:01:32,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {12158#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {12158#(< ~counter~0 46)} is VALID [2022-04-15 09:01:32,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {12183#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12158#(< ~counter~0 46)} is VALID [2022-04-15 09:01:32,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {12183#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11832#true} {12183#(< ~counter~0 45)} #92#return; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {12183#(< ~counter~0 45)} 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)); {11832#true} is VALID [2022-04-15 09:01:32,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11832#true} {12183#(< ~counter~0 45)} #90#return; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {11832#true} assume true; {11832#true} is VALID [2022-04-15 09:01:32,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {11832#true} assume !(0 == ~cond); {11832#true} is VALID [2022-04-15 09:01:32,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {11832#true} ~cond := #in~cond; {11832#true} is VALID [2022-04-15 09:01:32,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {12183#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11832#true} is VALID [2022-04-15 09:01:32,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {12183#(< ~counter~0 45)} 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; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {12183#(< ~counter~0 45)} call #t~ret9 := main(); {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12183#(< ~counter~0 45)} {11832#true} #102#return; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {12183#(< ~counter~0 45)} assume true; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {11832#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; {12183#(< ~counter~0 45)} is VALID [2022-04-15 09:01:32,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {11832#true} call ULTIMATE.init(); {11832#true} is VALID [2022-04-15 09:01:32,678 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-15 09:01:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30841695] [2022-04-15 09:01:32,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336553890] [2022-04-15 09:01:32,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336553890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:01:32,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:01:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:01:32,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900598357] [2022-04-15 09:01:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900598357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:32,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:01:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864068898] [2022-04-15 09:01:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:32,679 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-15 09:01:32,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:32,680 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-15 09:01:32,706 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-15 09:01:32,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:01:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:01:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:01:32,714 INFO L87 Difference]: Start difference. First operand 159 states and 199 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-15 09:01:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:33,026 INFO L93 Difference]: Finished difference Result 234 states and 305 transitions. [2022-04-15 09:01:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:01:33,027 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-15 09:01:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:33,027 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-15 09:01:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 09:01:33,028 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-15 09:01:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 09:01:33,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-15 09:01:33,119 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-15 09:01:33,121 INFO L225 Difference]: With dead ends: 234 [2022-04-15 09:01:33,121 INFO L226 Difference]: Without dead ends: 169 [2022-04-15 09:01:33,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-15 09:01:33,124 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:01:33,125 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 154 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:01:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-15 09:01:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2022-04-15 09:01:33,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:33,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:33,238 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:33,239 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:33,241 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2022-04-15 09:01:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2022-04-15 09:01:33,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:33,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:33,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 169 states. [2022-04-15 09:01:33,242 INFO L87 Difference]: Start difference. First operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 169 states. [2022-04-15 09:01:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:33,245 INFO L93 Difference]: Finished difference Result 169 states and 210 transitions. [2022-04-15 09:01:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 210 transitions. [2022-04-15 09:01:33,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:33,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:33,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:33,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 123 states have internal predecessors, (147), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 205 transitions. [2022-04-15 09:01:33,248 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 205 transitions. Word has length 65 [2022-04-15 09:01:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:33,248 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 205 transitions. [2022-04-15 09:01:33,248 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-15 09:01:33,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 205 transitions. [2022-04-15 09:01:39,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 203 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 205 transitions. [2022-04-15 09:01:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 09:01:39,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:39,533 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-15 09:01:39,552 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-15 09:01:39,734 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-15 09:01:39,734 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-15 09:01:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [987486479] [2022-04-15 09:01:39,735 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-15 09:01:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:39,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812639194] [2022-04-15 09:01:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:39,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:39,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344999182] [2022-04-15 09:01:39,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:01:39,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:39,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:39,747 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-15 09:01:39,748 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-15 09:01:39,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:01:39,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:39,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:01:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:39,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:40,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {13377#true} call ULTIMATE.init(); {13377#true} is VALID [2022-04-15 09:01:40,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {13377#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; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {13385#(<= ~counter~0 0)} assume true; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13385#(<= ~counter~0 0)} {13377#true} #102#return; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {13385#(<= ~counter~0 0)} call #t~ret9 := main(); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {13385#(<= ~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; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {13385#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {13385#(<= ~counter~0 0)} ~cond := #in~cond; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {13385#(<= ~counter~0 0)} assume !(0 == ~cond); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {13385#(<= ~counter~0 0)} assume true; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13385#(<= ~counter~0 0)} {13385#(<= ~counter~0 0)} #90#return; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,049 INFO L272 TraceCheckUtils]: 11: Hoare triple {13385#(<= ~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)); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {13385#(<= ~counter~0 0)} ~cond := #in~cond; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {13385#(<= ~counter~0 0)} assume !(0 == ~cond); {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {13385#(<= ~counter~0 0)} assume true; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,050 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13385#(<= ~counter~0 0)} {13385#(<= ~counter~0 0)} #92#return; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {13385#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13385#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:40,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {13385#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {13434#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,052 INFO L272 TraceCheckUtils]: 19: Hoare triple {13434#(<= ~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)); {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {13434#(<= ~counter~0 1)} ~cond := #in~cond; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {13434#(<= ~counter~0 1)} assume !(0 == ~cond); {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {13434#(<= ~counter~0 1)} assume true; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,053 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13434#(<= ~counter~0 1)} {13434#(<= ~counter~0 1)} #94#return; {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {13434#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13434#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:40,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {13434#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {13459#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {13459#(<= ~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)); {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {13459#(<= ~counter~0 2)} ~cond := #in~cond; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {13459#(<= ~counter~0 2)} assume !(0 == ~cond); {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {13459#(<= ~counter~0 2)} assume true; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,055 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13459#(<= ~counter~0 2)} {13459#(<= ~counter~0 2)} #96#return; {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {13459#(<= ~counter~0 2)} assume !(~r~0 > 0); {13459#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:40,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {13459#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {13484#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,056 INFO L272 TraceCheckUtils]: 35: Hoare triple {13484#(<= ~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)); {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {13484#(<= ~counter~0 3)} ~cond := #in~cond; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {13484#(<= ~counter~0 3)} assume !(0 == ~cond); {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {13484#(<= ~counter~0 3)} assume true; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,058 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13484#(<= ~counter~0 3)} {13484#(<= ~counter~0 3)} #98#return; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {13484#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13484#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:40,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {13484#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {13509#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,059 INFO L272 TraceCheckUtils]: 43: Hoare triple {13509#(<= ~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)); {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {13509#(<= ~counter~0 4)} ~cond := #in~cond; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {13509#(<= ~counter~0 4)} assume !(0 == ~cond); {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {13509#(<= ~counter~0 4)} assume true; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,060 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13509#(<= ~counter~0 4)} {13509#(<= ~counter~0 4)} #98#return; {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {13509#(<= ~counter~0 4)} assume !(~r~0 < 0); {13509#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:40,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {13509#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {13534#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,061 INFO L272 TraceCheckUtils]: 51: Hoare triple {13534#(<= ~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)); {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {13534#(<= ~counter~0 5)} ~cond := #in~cond; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {13534#(<= ~counter~0 5)} assume !(0 == ~cond); {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {13534#(<= ~counter~0 5)} assume true; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,062 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13534#(<= ~counter~0 5)} {13534#(<= ~counter~0 5)} #94#return; {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {13534#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13534#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {13534#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13559#(<= |main_#t~post7| 5)} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 58: Hoare triple {13559#(<= |main_#t~post7| 5)} assume !(#t~post7 < 50);havoc #t~post7; {13378#false} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 59: Hoare triple {13378#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13378#false} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 60: Hoare triple {13378#false} assume !(#t~post8 < 50);havoc #t~post8; {13378#false} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 61: Hoare triple {13378#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13378#false} is VALID [2022-04-15 09:01:40,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {13378#false} assume !(#t~post6 < 50);havoc #t~post6; {13378#false} is VALID [2022-04-15 09:01:40,063 INFO L272 TraceCheckUtils]: 63: Hoare triple {13378#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)); {13378#false} is VALID [2022-04-15 09:01:40,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {13378#false} ~cond := #in~cond; {13378#false} is VALID [2022-04-15 09:01:40,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {13378#false} assume 0 == ~cond; {13378#false} is VALID [2022-04-15 09:01:40,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {13378#false} assume !false; {13378#false} is VALID [2022-04-15 09:01:40,064 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-15 09:01:40,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 66: Hoare triple {13378#false} assume !false; {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 65: Hoare triple {13378#false} assume 0 == ~cond; {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 64: Hoare triple {13378#false} ~cond := #in~cond; {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L272 TraceCheckUtils]: 63: Hoare triple {13378#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)); {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {13378#false} assume !(#t~post6 < 50);havoc #t~post6; {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {13378#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {13378#false} assume !(#t~post8 < 50);havoc #t~post8; {13378#false} is VALID [2022-04-15 09:01:40,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {13378#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13378#false} is VALID [2022-04-15 09:01:40,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {13611#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {13378#false} is VALID [2022-04-15 09:01:40,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {13615#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13611#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:01:40,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {13615#(< ~counter~0 50)} assume !!(0 != ~r~0); {13615#(< ~counter~0 50)} is VALID [2022-04-15 09:01:40,395 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13377#true} {13615#(< ~counter~0 50)} #94#return; {13615#(< ~counter~0 50)} is VALID [2022-04-15 09:01:40,395 INFO L290 TraceCheckUtils]: 54: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,395 INFO L290 TraceCheckUtils]: 53: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,395 INFO L272 TraceCheckUtils]: 51: Hoare triple {13615#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 09:01:40,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {13615#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {13615#(< ~counter~0 50)} is VALID [2022-04-15 09:01:40,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {13640#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13615#(< ~counter~0 50)} is VALID [2022-04-15 09:01:40,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {13640#(< ~counter~0 49)} assume !(~r~0 < 0); {13640#(< ~counter~0 49)} is VALID [2022-04-15 09:01:40,397 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13377#true} {13640#(< ~counter~0 49)} #98#return; {13640#(< ~counter~0 49)} is VALID [2022-04-15 09:01:40,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,397 INFO L272 TraceCheckUtils]: 43: Hoare triple {13640#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 09:01:40,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {13640#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {13640#(< ~counter~0 49)} is VALID [2022-04-15 09:01:40,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {13665#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13640#(< ~counter~0 49)} is VALID [2022-04-15 09:01:40,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {13665#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13665#(< ~counter~0 48)} is VALID [2022-04-15 09:01:40,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13377#true} {13665#(< ~counter~0 48)} #98#return; {13665#(< ~counter~0 48)} is VALID [2022-04-15 09:01:40,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,399 INFO L272 TraceCheckUtils]: 35: Hoare triple {13665#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 09:01:40,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {13665#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {13665#(< ~counter~0 48)} is VALID [2022-04-15 09:01:40,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {13690#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13665#(< ~counter~0 48)} is VALID [2022-04-15 09:01:40,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {13690#(< ~counter~0 47)} assume !(~r~0 > 0); {13690#(< ~counter~0 47)} is VALID [2022-04-15 09:01:40,401 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13377#true} {13690#(< ~counter~0 47)} #96#return; {13690#(< ~counter~0 47)} is VALID [2022-04-15 09:01:40,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,401 INFO L272 TraceCheckUtils]: 27: Hoare triple {13690#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 09:01:40,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {13690#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {13690#(< ~counter~0 47)} is VALID [2022-04-15 09:01:40,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {13715#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13690#(< ~counter~0 47)} is VALID [2022-04-15 09:01:40,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {13715#(< ~counter~0 46)} assume !!(0 != ~r~0); {13715#(< ~counter~0 46)} is VALID [2022-04-15 09:01:40,402 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13377#true} {13715#(< ~counter~0 46)} #94#return; {13715#(< ~counter~0 46)} is VALID [2022-04-15 09:01:40,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,403 INFO L272 TraceCheckUtils]: 19: Hoare triple {13715#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 09:01:40,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {13715#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {13715#(< ~counter~0 46)} is VALID [2022-04-15 09:01:40,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {13740#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13715#(< ~counter~0 46)} is VALID [2022-04-15 09:01:40,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {13740#(< ~counter~0 45)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13377#true} {13740#(< ~counter~0 45)} #92#return; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,405 INFO L272 TraceCheckUtils]: 11: Hoare triple {13740#(< ~counter~0 45)} 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)); {13377#true} is VALID [2022-04-15 09:01:40,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13377#true} {13740#(< ~counter~0 45)} #90#return; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {13377#true} assume true; {13377#true} is VALID [2022-04-15 09:01:40,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {13377#true} assume !(0 == ~cond); {13377#true} is VALID [2022-04-15 09:01:40,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {13377#true} ~cond := #in~cond; {13377#true} is VALID [2022-04-15 09:01:40,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {13740#(< ~counter~0 45)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13377#true} is VALID [2022-04-15 09:01:40,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {13740#(< ~counter~0 45)} 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; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {13740#(< ~counter~0 45)} call #t~ret9 := main(); {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13740#(< ~counter~0 45)} {13377#true} #102#return; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {13740#(< ~counter~0 45)} assume true; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {13377#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; {13740#(< ~counter~0 45)} is VALID [2022-04-15 09:01:40,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {13377#true} call ULTIMATE.init(); {13377#true} is VALID [2022-04-15 09:01:40,407 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-15 09:01:40,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:40,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812639194] [2022-04-15 09:01:40,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:40,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344999182] [2022-04-15 09:01:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344999182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:01:40,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:01:40,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:01:40,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:40,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [987486479] [2022-04-15 09:01:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [987486479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:40,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:01:40,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344482789] [2022-04-15 09:01:40,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:40,409 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-15 09:01:40,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:40,409 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-15 09:01:40,452 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-15 09:01:40,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:01:40,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:40,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:01:40,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:01:40,453 INFO L87 Difference]: Start difference. First operand 164 states and 205 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-15 09:01:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:40,827 INFO L93 Difference]: Finished difference Result 237 states and 309 transitions. [2022-04-15 09:01:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 09:01:40,827 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-15 09:01:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:40,828 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-15 09:01:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 09:01:40,829 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-15 09:01:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 09:01:40,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-15 09:01:40,923 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-15 09:01:40,926 INFO L225 Difference]: With dead ends: 237 [2022-04-15 09:01:40,926 INFO L226 Difference]: Without dead ends: 172 [2022-04-15 09:01:40,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-15 09:01:40,927 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:01:40,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:01:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-15 09:01:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-04-15 09:01:41,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:41,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:41,074 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:41,077 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-15 09:01:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-15 09:01:41,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:41,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:41,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-15 09:01:41,078 INFO L87 Difference]: Start difference. First operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 172 states. [2022-04-15 09:01:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:41,081 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-15 09:01:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-15 09:01:41,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:41,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:41,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:41,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:01:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 213 transitions. [2022-04-15 09:01:41,085 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 213 transitions. Word has length 67 [2022-04-15 09:01:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:41,085 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 213 transitions. [2022-04-15 09:01:41,085 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-15 09:01:41,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 213 transitions. [2022-04-15 09:01:47,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-15 09:01:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 09:01:47,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:47,648 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-15 09:01:47,667 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-15 09:01:47,849 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-15 09:01:47,849 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-15 09:01:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:47,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120139395] [2022-04-15 09:01:47,850 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:47,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-15 09:01:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:47,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052301215] [2022-04-15 09:01:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:47,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642419729] [2022-04-15 09:01:47,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:01:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:47,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:47,870 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-15 09:01:47,870 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-15 09:01:47,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:01:47,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:47,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:01:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:47,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:48,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {14964#true} call ULTIMATE.init(); {14964#true} is VALID [2022-04-15 09:01:48,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {14964#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; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {14972#(<= ~counter~0 0)} assume true; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14972#(<= ~counter~0 0)} {14964#true} #102#return; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {14972#(<= ~counter~0 0)} call #t~ret9 := main(); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {14972#(<= ~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; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {14972#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {14972#(<= ~counter~0 0)} ~cond := #in~cond; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {14972#(<= ~counter~0 0)} assume !(0 == ~cond); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {14972#(<= ~counter~0 0)} assume true; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14972#(<= ~counter~0 0)} {14972#(<= ~counter~0 0)} #90#return; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {14972#(<= ~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)); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {14972#(<= ~counter~0 0)} ~cond := #in~cond; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#(<= ~counter~0 0)} assume !(0 == ~cond); {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {14972#(<= ~counter~0 0)} assume true; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,294 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14972#(<= ~counter~0 0)} {14972#(<= ~counter~0 0)} #92#return; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {14972#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14972#(<= ~counter~0 0)} is VALID [2022-04-15 09:01:48,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {14972#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {15021#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {15021#(<= ~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)); {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {15021#(<= ~counter~0 1)} ~cond := #in~cond; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {15021#(<= ~counter~0 1)} assume !(0 == ~cond); {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {15021#(<= ~counter~0 1)} assume true; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,296 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15021#(<= ~counter~0 1)} {15021#(<= ~counter~0 1)} #94#return; {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {15021#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15021#(<= ~counter~0 1)} is VALID [2022-04-15 09:01:48,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {15021#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {15046#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,297 INFO L272 TraceCheckUtils]: 27: Hoare triple {15046#(<= ~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)); {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {15046#(<= ~counter~0 2)} ~cond := #in~cond; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {15046#(<= ~counter~0 2)} assume !(0 == ~cond); {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {15046#(<= ~counter~0 2)} assume true; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,298 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15046#(<= ~counter~0 2)} {15046#(<= ~counter~0 2)} #96#return; {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {15046#(<= ~counter~0 2)} assume !(~r~0 > 0); {15046#(<= ~counter~0 2)} is VALID [2022-04-15 09:01:48,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {15046#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {15071#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,300 INFO L272 TraceCheckUtils]: 35: Hoare triple {15071#(<= ~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)); {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {15071#(<= ~counter~0 3)} ~cond := #in~cond; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {15071#(<= ~counter~0 3)} assume !(0 == ~cond); {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {15071#(<= ~counter~0 3)} assume true; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,301 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15071#(<= ~counter~0 3)} {15071#(<= ~counter~0 3)} #98#return; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {15071#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15071#(<= ~counter~0 3)} is VALID [2022-04-15 09:01:48,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {15071#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {15096#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,302 INFO L272 TraceCheckUtils]: 43: Hoare triple {15096#(<= ~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)); {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {15096#(<= ~counter~0 4)} ~cond := #in~cond; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {15096#(<= ~counter~0 4)} assume !(0 == ~cond); {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {15096#(<= ~counter~0 4)} assume true; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,303 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15096#(<= ~counter~0 4)} {15096#(<= ~counter~0 4)} #98#return; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {15096#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15096#(<= ~counter~0 4)} is VALID [2022-04-15 09:01:48,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {15096#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {15121#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,304 INFO L272 TraceCheckUtils]: 51: Hoare triple {15121#(<= ~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)); {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {15121#(<= ~counter~0 5)} ~cond := #in~cond; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {15121#(<= ~counter~0 5)} assume !(0 == ~cond); {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {15121#(<= ~counter~0 5)} assume true; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,305 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15121#(<= ~counter~0 5)} {15121#(<= ~counter~0 5)} #98#return; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {15121#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15121#(<= ~counter~0 5)} is VALID [2022-04-15 09:01:48,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {15121#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {15146#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,306 INFO L272 TraceCheckUtils]: 59: Hoare triple {15146#(<= ~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)); {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {15146#(<= ~counter~0 6)} ~cond := #in~cond; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {15146#(<= ~counter~0 6)} assume !(0 == ~cond); {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {15146#(<= ~counter~0 6)} assume true; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,308 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15146#(<= ~counter~0 6)} {15146#(<= ~counter~0 6)} #98#return; {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {15146#(<= ~counter~0 6)} assume !(~r~0 < 0); {15146#(<= ~counter~0 6)} is VALID [2022-04-15 09:01:48,308 INFO L290 TraceCheckUtils]: 65: Hoare triple {15146#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15171#(<= |main_#t~post6| 6)} is VALID [2022-04-15 09:01:48,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {15171#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {14965#false} is VALID [2022-04-15 09:01:48,308 INFO L272 TraceCheckUtils]: 67: Hoare triple {14965#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)); {14965#false} is VALID [2022-04-15 09:01:48,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {14965#false} ~cond := #in~cond; {14965#false} is VALID [2022-04-15 09:01:48,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {14965#false} assume 0 == ~cond; {14965#false} is VALID [2022-04-15 09:01:48,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {14965#false} assume !false; {14965#false} is VALID [2022-04-15 09:01:48,309 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-15 09:01:48,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:01:48,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {14965#false} assume !false; {14965#false} is VALID [2022-04-15 09:01:48,545 INFO L290 TraceCheckUtils]: 69: Hoare triple {14965#false} assume 0 == ~cond; {14965#false} is VALID [2022-04-15 09:01:48,545 INFO L290 TraceCheckUtils]: 68: Hoare triple {14965#false} ~cond := #in~cond; {14965#false} is VALID [2022-04-15 09:01:48,545 INFO L272 TraceCheckUtils]: 67: Hoare triple {14965#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)); {14965#false} is VALID [2022-04-15 09:01:48,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {15199#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {14965#false} is VALID [2022-04-15 09:01:48,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {15203#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15199#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:01:48,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {15203#(< ~counter~0 50)} assume !(~r~0 < 0); {15203#(< ~counter~0 50)} is VALID [2022-04-15 09:01:48,546 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14964#true} {15203#(< ~counter~0 50)} #98#return; {15203#(< ~counter~0 50)} is VALID [2022-04-15 09:01:48,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,547 INFO L272 TraceCheckUtils]: 59: Hoare triple {15203#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {15203#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {15203#(< ~counter~0 50)} is VALID [2022-04-15 09:01:48,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {15228#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15203#(< ~counter~0 50)} is VALID [2022-04-15 09:01:48,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {15228#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15228#(< ~counter~0 49)} is VALID [2022-04-15 09:01:48,548 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14964#true} {15228#(< ~counter~0 49)} #98#return; {15228#(< ~counter~0 49)} is VALID [2022-04-15 09:01:48,548 INFO L290 TraceCheckUtils]: 54: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,548 INFO L272 TraceCheckUtils]: 51: Hoare triple {15228#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,569 INFO L290 TraceCheckUtils]: 50: Hoare triple {15228#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {15228#(< ~counter~0 49)} is VALID [2022-04-15 09:01:48,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {15253#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15228#(< ~counter~0 49)} is VALID [2022-04-15 09:01:48,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {15253#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15253#(< ~counter~0 48)} is VALID [2022-04-15 09:01:48,571 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14964#true} {15253#(< ~counter~0 48)} #98#return; {15253#(< ~counter~0 48)} is VALID [2022-04-15 09:01:48,571 INFO L290 TraceCheckUtils]: 46: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,571 INFO L272 TraceCheckUtils]: 43: Hoare triple {15253#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {15253#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {15253#(< ~counter~0 48)} is VALID [2022-04-15 09:01:48,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {15278#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15253#(< ~counter~0 48)} is VALID [2022-04-15 09:01:48,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {15278#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15278#(< ~counter~0 47)} is VALID [2022-04-15 09:01:48,572 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14964#true} {15278#(< ~counter~0 47)} #98#return; {15278#(< ~counter~0 47)} is VALID [2022-04-15 09:01:48,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,572 INFO L272 TraceCheckUtils]: 35: Hoare triple {15278#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {15278#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {15278#(< ~counter~0 47)} is VALID [2022-04-15 09:01:48,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {15303#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15278#(< ~counter~0 47)} is VALID [2022-04-15 09:01:48,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {15303#(< ~counter~0 46)} assume !(~r~0 > 0); {15303#(< ~counter~0 46)} is VALID [2022-04-15 09:01:48,573 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14964#true} {15303#(< ~counter~0 46)} #96#return; {15303#(< ~counter~0 46)} is VALID [2022-04-15 09:01:48,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,574 INFO L272 TraceCheckUtils]: 27: Hoare triple {15303#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {15303#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {15303#(< ~counter~0 46)} is VALID [2022-04-15 09:01:48,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {15328#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15303#(< ~counter~0 46)} is VALID [2022-04-15 09:01:48,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {15328#(< ~counter~0 45)} assume !!(0 != ~r~0); {15328#(< ~counter~0 45)} is VALID [2022-04-15 09:01:48,575 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14964#true} {15328#(< ~counter~0 45)} #94#return; {15328#(< ~counter~0 45)} is VALID [2022-04-15 09:01:48,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,575 INFO L272 TraceCheckUtils]: 19: Hoare triple {15328#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {15328#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {15328#(< ~counter~0 45)} is VALID [2022-04-15 09:01:48,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {15353#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15328#(< ~counter~0 45)} is VALID [2022-04-15 09:01:48,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {15353#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,576 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14964#true} {15353#(< ~counter~0 44)} #92#return; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {15353#(< ~counter~0 44)} 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)); {14964#true} is VALID [2022-04-15 09:01:48,577 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14964#true} {15353#(< ~counter~0 44)} #90#return; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {14964#true} assume true; {14964#true} is VALID [2022-04-15 09:01:48,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {14964#true} assume !(0 == ~cond); {14964#true} is VALID [2022-04-15 09:01:48,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {14964#true} ~cond := #in~cond; {14964#true} is VALID [2022-04-15 09:01:48,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {15353#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14964#true} is VALID [2022-04-15 09:01:48,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {15353#(< ~counter~0 44)} 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; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {15353#(< ~counter~0 44)} call #t~ret9 := main(); {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15353#(< ~counter~0 44)} {14964#true} #102#return; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {15353#(< ~counter~0 44)} assume true; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {14964#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; {15353#(< ~counter~0 44)} is VALID [2022-04-15 09:01:48,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {14964#true} call ULTIMATE.init(); {14964#true} is VALID [2022-04-15 09:01:48,578 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-15 09:01:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052301215] [2022-04-15 09:01:48,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642419729] [2022-04-15 09:01:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642419729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:01:48,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:01:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 09:01:48,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:48,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120139395] [2022-04-15 09:01:48,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120139395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:48,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:01:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125486493] [2022-04-15 09:01:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:48,580 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-15 09:01:48,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:48,580 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-15 09:01:48,608 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-15 09:01:48,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:01:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:01:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:01:48,609 INFO L87 Difference]: Start difference. First operand 172 states and 213 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-15 09:01:49,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:49,043 INFO L93 Difference]: Finished difference Result 210 states and 262 transitions. [2022-04-15 09:01:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 09:01:49,043 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-15 09:01:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:49,044 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-15 09:01:49,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 09:01:49,045 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-15 09:01:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 09:01:49,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-15 09:01:49,105 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-15 09:01:49,108 INFO L225 Difference]: With dead ends: 210 [2022-04-15 09:01:49,109 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 09:01:49,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-15 09:01:49,109 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:01:49,109 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:01:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 09:01:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2022-04-15 09:01:49,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:49,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:01:49,212 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:01:49,212 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:01:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:49,215 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2022-04-15 09:01:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2022-04-15 09:01:49,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:49,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:49,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 205 states. [2022-04-15 09:01:49,231 INFO L87 Difference]: Start difference. First operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) Second operand 205 states. [2022-04-15 09:01:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:49,236 INFO L93 Difference]: Finished difference Result 205 states and 256 transitions. [2022-04-15 09:01:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2022-04-15 09:01:49,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:49,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:49,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:49,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 141 states have (on average 1.198581560283688) internal successors, (169), 146 states have internal predecessors, (169), 37 states have call successors, (37), 16 states have call predecessors, (37), 14 states have return successors, (35), 30 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:01:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2022-04-15 09:01:49,241 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 71 [2022-04-15 09:01:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:49,242 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2022-04-15 09:01:49,242 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-15 09:01:49,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 241 transitions. [2022-04-15 09:01:58,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 239 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:01:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2022-04-15 09:01:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 09:01:58,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:01:58,458 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-15 09:01:58,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 09:01:58,659 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-15 09:01:58,659 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:01:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:01:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-15 09:01:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1451881878] [2022-04-15 09:01:58,660 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:01:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-15 09:01:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:01:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282687261] [2022-04-15 09:01:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:01:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:01:58,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:01:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99776072] [2022-04-15 09:01:58,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:01:58,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:01:58,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:01:58,673 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-15 09:01:58,674 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-15 09:01:58,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:01:58,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:01:58,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 09:01:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:01:58,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:01:58,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {16629#true} call ULTIMATE.init(); {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {16629#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; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16629#true} {16629#true} #102#return; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {16629#true} call #t~ret9 := main(); {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {16629#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; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {16629#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16629#true} {16629#true} #90#return; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L272 TraceCheckUtils]: 11: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16629#true} {16629#true} #92#return; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {16629#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {16629#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {16629#true} assume !!(#t~post6 < 50);havoc #t~post6; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16629#true} {16629#true} #94#return; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {16629#true} assume !!(0 != ~r~0); {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {16629#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {16629#true} assume !!(#t~post7 < 50);havoc #t~post7; {16629#true} is VALID [2022-04-15 09:01:58,899 INFO L272 TraceCheckUtils]: 27: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16629#true} {16629#true} #96#return; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {16629#true} assume !(~r~0 > 0); {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {16629#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {16629#true} assume !!(#t~post8 < 50);havoc #t~post8; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L272 TraceCheckUtils]: 35: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16629#true} {16629#true} #98#return; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {16629#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16629#true} is VALID [2022-04-15 09:01:58,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {16629#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {16629#true} assume !!(#t~post8 < 50);havoc #t~post8; {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L272 TraceCheckUtils]: 43: Hoare triple {16629#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)); {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16629#true} {16629#true} #98#return; {16629#true} is VALID [2022-04-15 09:01:58,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {16629#true} assume !(~r~0 < 0); {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 09:01:58,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {16778#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 09:01:58,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {16778#(not (< main_~r~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 09:01:58,902 INFO L272 TraceCheckUtils]: 51: Hoare triple {16778#(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)); {16629#true} is VALID [2022-04-15 09:01:58,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,903 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16629#true} {16778#(not (< main_~r~0 0))} #94#return; {16778#(not (< main_~r~0 0))} is VALID [2022-04-15 09:01:58,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {16778#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:01:58,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:01:58,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 50);havoc #t~post7; {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:01:58,904 INFO L272 TraceCheckUtils]: 59: Hoare triple {16803#(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)); {16629#true} is VALID [2022-04-15 09:01:58,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {16629#true} ~cond := #in~cond; {16629#true} is VALID [2022-04-15 09:01:58,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {16629#true} assume !(0 == ~cond); {16629#true} is VALID [2022-04-15 09:01:58,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {16629#true} assume true; {16629#true} is VALID [2022-04-15 09:01:58,905 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16629#true} {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:01:58,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {16803#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {16630#false} is VALID [2022-04-15 09:01:58,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {16630#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16630#false} is VALID [2022-04-15 09:01:58,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {16630#false} assume !(#t~post8 < 50);havoc #t~post8; {16630#false} is VALID [2022-04-15 09:01:58,905 INFO L290 TraceCheckUtils]: 67: Hoare triple {16630#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16630#false} is VALID [2022-04-15 09:01:58,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {16630#false} assume !(#t~post6 < 50);havoc #t~post6; {16630#false} is VALID [2022-04-15 09:01:58,906 INFO L272 TraceCheckUtils]: 69: Hoare triple {16630#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)); {16630#false} is VALID [2022-04-15 09:01:58,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {16630#false} ~cond := #in~cond; {16630#false} is VALID [2022-04-15 09:01:58,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {16630#false} assume 0 == ~cond; {16630#false} is VALID [2022-04-15 09:01:58,906 INFO L290 TraceCheckUtils]: 72: Hoare triple {16630#false} assume !false; {16630#false} is VALID [2022-04-15 09:01:58,906 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-15 09:01:58,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:01:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:01:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282687261] [2022-04-15 09:01:58,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:01:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99776072] [2022-04-15 09:01:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99776072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:01:58,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:01:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1451881878] [2022-04-15 09:01:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1451881878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:01:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:01:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:01:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064408809] [2022-04-15 09:01:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:01:58,907 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-15 09:01:58,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:01:58,908 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-15 09:01:58,947 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-15 09:01:58,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:01:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:01:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:01:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:01:58,948 INFO L87 Difference]: Start difference. First operand 193 states and 241 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-15 09:01:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:59,257 INFO L93 Difference]: Finished difference Result 292 states and 388 transitions. [2022-04-15 09:01:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:01:59,257 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-15 09:01:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:01:59,257 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-15 09:01:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 09:01:59,258 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-15 09:01:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 09:01:59,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 09:01:59,321 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-15 09:01:59,324 INFO L225 Difference]: With dead ends: 292 [2022-04-15 09:01:59,324 INFO L226 Difference]: Without dead ends: 227 [2022-04-15 09:01:59,325 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-15 09:01:59,325 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-15 09:01:59,325 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-15 09:01:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-15 09:01:59,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 211. [2022-04-15 09:01:59,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:01:59,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:01:59,533 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:01:59,533 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:01:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:59,537 INFO L93 Difference]: Finished difference Result 227 states and 291 transitions. [2022-04-15 09:01:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 291 transitions. [2022-04-15 09:01:59,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:59,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:59,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) Second operand 227 states. [2022-04-15 09:01:59,538 INFO L87 Difference]: Start difference. First operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) Second operand 227 states. [2022-04-15 09:01:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:01:59,542 INFO L93 Difference]: Finished difference Result 227 states and 291 transitions. [2022-04-15 09:01:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 291 transitions. [2022-04-15 09:01:59,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:01:59,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:01:59,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:01:59,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:01:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 160 states have internal predecessors, (189), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 34 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:01:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 269 transitions. [2022-04-15 09:01:59,546 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 269 transitions. Word has length 73 [2022-04-15 09:01:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:01:59,546 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 269 transitions. [2022-04-15 09:01:59,546 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-15 09:01:59,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 269 transitions. [2022-04-15 09:02:09,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 267 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:02:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 269 transitions. [2022-04-15 09:02:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 09:02:09,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:02:09,323 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-15 09:02:09,340 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-15 09:02:09,523 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-15 09:02:09,523 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:02:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:02:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-15 09:02:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1406236013] [2022-04-15 09:02:09,524 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:02:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-15 09:02:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:02:09,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370114488] [2022-04-15 09:02:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:02:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:02:09,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:02:09,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464205706] [2022-04-15 09:02:09,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:02:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:02:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:02:09,535 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-15 09:02:09,541 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-15 09:02:09,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:02:09,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:02:09,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:02:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:02:09,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:02:09,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {18311#true} call ULTIMATE.init(); {18311#true} is VALID [2022-04-15 09:02:09,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {18311#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; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {18319#(<= ~counter~0 0)} assume true; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18319#(<= ~counter~0 0)} {18311#true} #102#return; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {18319#(<= ~counter~0 0)} call #t~ret9 := main(); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {18319#(<= ~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; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {18319#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {18319#(<= ~counter~0 0)} ~cond := #in~cond; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {18319#(<= ~counter~0 0)} assume !(0 == ~cond); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {18319#(<= ~counter~0 0)} assume true; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18319#(<= ~counter~0 0)} {18319#(<= ~counter~0 0)} #90#return; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {18319#(<= ~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)); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {18319#(<= ~counter~0 0)} ~cond := #in~cond; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {18319#(<= ~counter~0 0)} assume !(0 == ~cond); {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {18319#(<= ~counter~0 0)} assume true; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18319#(<= ~counter~0 0)} {18319#(<= ~counter~0 0)} #92#return; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {18319#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18319#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:09,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {18319#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {18368#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {18368#(<= ~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)); {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {18368#(<= ~counter~0 1)} ~cond := #in~cond; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {18368#(<= ~counter~0 1)} assume !(0 == ~cond); {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {18368#(<= ~counter~0 1)} assume true; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18368#(<= ~counter~0 1)} {18368#(<= ~counter~0 1)} #94#return; {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {18368#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18368#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:09,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {18368#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {18393#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,955 INFO L272 TraceCheckUtils]: 27: Hoare triple {18393#(<= ~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)); {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {18393#(<= ~counter~0 2)} ~cond := #in~cond; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {18393#(<= ~counter~0 2)} assume !(0 == ~cond); {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {18393#(<= ~counter~0 2)} assume true; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,956 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18393#(<= ~counter~0 2)} {18393#(<= ~counter~0 2)} #96#return; {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {18393#(<= ~counter~0 2)} assume !(~r~0 > 0); {18393#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:09,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {18393#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {18418#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,958 INFO L272 TraceCheckUtils]: 35: Hoare triple {18418#(<= ~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)); {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {18418#(<= ~counter~0 3)} ~cond := #in~cond; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {18418#(<= ~counter~0 3)} assume !(0 == ~cond); {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {18418#(<= ~counter~0 3)} assume true; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,959 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18418#(<= ~counter~0 3)} {18418#(<= ~counter~0 3)} #98#return; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {18418#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18418#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:09,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {18418#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {18443#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,961 INFO L272 TraceCheckUtils]: 43: Hoare triple {18443#(<= ~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)); {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {18443#(<= ~counter~0 4)} ~cond := #in~cond; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {18443#(<= ~counter~0 4)} assume !(0 == ~cond); {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {18443#(<= ~counter~0 4)} assume true; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,962 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18443#(<= ~counter~0 4)} {18443#(<= ~counter~0 4)} #98#return; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {18443#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18443#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:09,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {18443#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {18468#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,964 INFO L272 TraceCheckUtils]: 51: Hoare triple {18468#(<= ~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)); {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {18468#(<= ~counter~0 5)} ~cond := #in~cond; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {18468#(<= ~counter~0 5)} assume !(0 == ~cond); {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {18468#(<= ~counter~0 5)} assume true; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,965 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18468#(<= ~counter~0 5)} {18468#(<= ~counter~0 5)} #98#return; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {18468#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18468#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:09,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {18468#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {18493#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,966 INFO L272 TraceCheckUtils]: 59: Hoare triple {18493#(<= ~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)); {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {18493#(<= ~counter~0 6)} ~cond := #in~cond; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {18493#(<= ~counter~0 6)} assume !(0 == ~cond); {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {18493#(<= ~counter~0 6)} assume true; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,968 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18493#(<= ~counter~0 6)} {18493#(<= ~counter~0 6)} #98#return; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {18493#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18493#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:09,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {18493#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18518#(<= |main_#t~post8| 6)} is VALID [2022-04-15 09:02:09,969 INFO L290 TraceCheckUtils]: 66: Hoare triple {18518#(<= |main_#t~post8| 6)} assume !(#t~post8 < 50);havoc #t~post8; {18312#false} is VALID [2022-04-15 09:02:09,969 INFO L290 TraceCheckUtils]: 67: Hoare triple {18312#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18312#false} is VALID [2022-04-15 09:02:09,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {18312#false} assume !(#t~post6 < 50);havoc #t~post6; {18312#false} is VALID [2022-04-15 09:02:09,969 INFO L272 TraceCheckUtils]: 69: Hoare triple {18312#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)); {18312#false} is VALID [2022-04-15 09:02:09,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {18312#false} ~cond := #in~cond; {18312#false} is VALID [2022-04-15 09:02:09,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {18312#false} assume 0 == ~cond; {18312#false} is VALID [2022-04-15 09:02:09,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {18312#false} assume !false; {18312#false} is VALID [2022-04-15 09:02:09,969 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-15 09:02:09,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:02:10,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {18312#false} assume !false; {18312#false} is VALID [2022-04-15 09:02:10,333 INFO L290 TraceCheckUtils]: 71: Hoare triple {18312#false} assume 0 == ~cond; {18312#false} is VALID [2022-04-15 09:02:10,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {18312#false} ~cond := #in~cond; {18312#false} is VALID [2022-04-15 09:02:10,333 INFO L272 TraceCheckUtils]: 69: Hoare triple {18312#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)); {18312#false} is VALID [2022-04-15 09:02:10,333 INFO L290 TraceCheckUtils]: 68: Hoare triple {18312#false} assume !(#t~post6 < 50);havoc #t~post6; {18312#false} is VALID [2022-04-15 09:02:10,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {18312#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18312#false} is VALID [2022-04-15 09:02:10,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {18558#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {18312#false} is VALID [2022-04-15 09:02:10,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {18562#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18558#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:02:10,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {18562#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18562#(< ~counter~0 50)} is VALID [2022-04-15 09:02:10,335 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18311#true} {18562#(< ~counter~0 50)} #98#return; {18562#(< ~counter~0 50)} is VALID [2022-04-15 09:02:10,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,335 INFO L272 TraceCheckUtils]: 59: Hoare triple {18562#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {18562#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {18562#(< ~counter~0 50)} is VALID [2022-04-15 09:02:10,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {18587#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18562#(< ~counter~0 50)} is VALID [2022-04-15 09:02:10,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {18587#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18587#(< ~counter~0 49)} is VALID [2022-04-15 09:02:10,337 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18311#true} {18587#(< ~counter~0 49)} #98#return; {18587#(< ~counter~0 49)} is VALID [2022-04-15 09:02:10,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,337 INFO L272 TraceCheckUtils]: 51: Hoare triple {18587#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {18587#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {18587#(< ~counter~0 49)} is VALID [2022-04-15 09:02:10,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {18612#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18587#(< ~counter~0 49)} is VALID [2022-04-15 09:02:10,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {18612#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18612#(< ~counter~0 48)} is VALID [2022-04-15 09:02:10,339 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18311#true} {18612#(< ~counter~0 48)} #98#return; {18612#(< ~counter~0 48)} is VALID [2022-04-15 09:02:10,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,339 INFO L272 TraceCheckUtils]: 43: Hoare triple {18612#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {18612#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {18612#(< ~counter~0 48)} is VALID [2022-04-15 09:02:10,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {18637#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18612#(< ~counter~0 48)} is VALID [2022-04-15 09:02:10,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {18637#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18637#(< ~counter~0 47)} is VALID [2022-04-15 09:02:10,341 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18311#true} {18637#(< ~counter~0 47)} #98#return; {18637#(< ~counter~0 47)} is VALID [2022-04-15 09:02:10,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,341 INFO L272 TraceCheckUtils]: 35: Hoare triple {18637#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {18637#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {18637#(< ~counter~0 47)} is VALID [2022-04-15 09:02:10,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {18662#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18637#(< ~counter~0 47)} is VALID [2022-04-15 09:02:10,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {18662#(< ~counter~0 46)} assume !(~r~0 > 0); {18662#(< ~counter~0 46)} is VALID [2022-04-15 09:02:10,342 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18311#true} {18662#(< ~counter~0 46)} #96#return; {18662#(< ~counter~0 46)} is VALID [2022-04-15 09:02:10,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,343 INFO L272 TraceCheckUtils]: 27: Hoare triple {18662#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {18662#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {18662#(< ~counter~0 46)} is VALID [2022-04-15 09:02:10,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {18687#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18662#(< ~counter~0 46)} is VALID [2022-04-15 09:02:10,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {18687#(< ~counter~0 45)} assume !!(0 != ~r~0); {18687#(< ~counter~0 45)} is VALID [2022-04-15 09:02:10,344 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18311#true} {18687#(< ~counter~0 45)} #94#return; {18687#(< ~counter~0 45)} is VALID [2022-04-15 09:02:10,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,345 INFO L272 TraceCheckUtils]: 19: Hoare triple {18687#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {18687#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {18687#(< ~counter~0 45)} is VALID [2022-04-15 09:02:10,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {18712#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18687#(< ~counter~0 45)} is VALID [2022-04-15 09:02:10,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {18712#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,346 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18311#true} {18712#(< ~counter~0 44)} #92#return; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,346 INFO L272 TraceCheckUtils]: 11: Hoare triple {18712#(< ~counter~0 44)} 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)); {18311#true} is VALID [2022-04-15 09:02:10,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18311#true} {18712#(< ~counter~0 44)} #90#return; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {18311#true} assume true; {18311#true} is VALID [2022-04-15 09:02:10,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {18311#true} assume !(0 == ~cond); {18311#true} is VALID [2022-04-15 09:02:10,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {18311#true} ~cond := #in~cond; {18311#true} is VALID [2022-04-15 09:02:10,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {18712#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18311#true} is VALID [2022-04-15 09:02:10,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {18712#(< ~counter~0 44)} 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; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {18712#(< ~counter~0 44)} call #t~ret9 := main(); {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18712#(< ~counter~0 44)} {18311#true} #102#return; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {18712#(< ~counter~0 44)} assume true; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {18311#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; {18712#(< ~counter~0 44)} is VALID [2022-04-15 09:02:10,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {18311#true} call ULTIMATE.init(); {18311#true} is VALID [2022-04-15 09:02:10,349 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-15 09:02:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:02:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370114488] [2022-04-15 09:02:10,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:02:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464205706] [2022-04-15 09:02:10,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464205706] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:02:10,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:02:10,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 09:02:10,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:02:10,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1406236013] [2022-04-15 09:02:10,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1406236013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:02:10,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:02:10,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:02:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187096963] [2022-04-15 09:02:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:02:10,350 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-15 09:02:10,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:02:10,351 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-15 09:02:10,397 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-15 09:02:10,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:02:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:02:10,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:02:10,398 INFO L87 Difference]: Start difference. First operand 211 states and 269 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-15 09:02:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:10,910 INFO L93 Difference]: Finished difference Result 309 states and 409 transitions. [2022-04-15 09:02:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 09:02:10,910 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-15 09:02:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:02:10,911 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-15 09:02:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 09:02:10,912 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-15 09:02:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 09:02:10,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-15 09:02:11,029 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-15 09:02:11,032 INFO L225 Difference]: With dead ends: 309 [2022-04-15 09:02:11,032 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 09:02:11,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:02:11,033 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 66 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:02:11,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 184 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:02:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 09:02:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 216. [2022-04-15 09:02:11,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:02:11,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:11,230 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:11,230 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:11,235 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2022-04-15 09:02:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2022-04-15 09:02:11,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:11,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:11,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) Second operand 222 states. [2022-04-15 09:02:11,236 INFO L87 Difference]: Start difference. First operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) Second operand 222 states. [2022-04-15 09:02:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:11,240 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2022-04-15 09:02:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2022-04-15 09:02:11,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:11,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:11,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:02:11,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:02:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 160 states have (on average 1.21875) internal successors, (195), 164 states have internal predecessors, (195), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 35 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2022-04-15 09:02:11,246 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 73 [2022-04-15 09:02:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:02:11,246 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2022-04-15 09:02:11,246 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-15 09:02:11,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 275 transitions. [2022-04-15 09:02:24,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 270 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 09:02:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2022-04-15 09:02:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 09:02:24,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:02:24,937 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-15 09:02:24,955 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-15 09:02:25,137 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-15 09:02:25,138 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:02:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:02:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-15 09:02:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:25,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527346075] [2022-04-15 09:02:25,138 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:02:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-15 09:02:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:02:25,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139642270] [2022-04-15 09:02:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:02:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:02:25,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:02:25,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270213154] [2022-04-15 09:02:25,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:02:25,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:02:25,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:02:25,149 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-15 09:02:25,150 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-15 09:02:25,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:02:25,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:02:25,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:02:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:02:25,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:02:25,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {20268#true} call ULTIMATE.init(); {20268#true} is VALID [2022-04-15 09:02:25,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {20268#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; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {20276#(<= ~counter~0 0)} assume true; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20276#(<= ~counter~0 0)} {20268#true} #102#return; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {20276#(<= ~counter~0 0)} call #t~ret9 := main(); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {20276#(<= ~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; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {20276#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {20276#(<= ~counter~0 0)} ~cond := #in~cond; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {20276#(<= ~counter~0 0)} assume !(0 == ~cond); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {20276#(<= ~counter~0 0)} assume true; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,560 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20276#(<= ~counter~0 0)} {20276#(<= ~counter~0 0)} #90#return; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {20276#(<= ~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)); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {20276#(<= ~counter~0 0)} ~cond := #in~cond; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {20276#(<= ~counter~0 0)} assume !(0 == ~cond); {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {20276#(<= ~counter~0 0)} assume true; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20276#(<= ~counter~0 0)} {20276#(<= ~counter~0 0)} #92#return; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {20276#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20276#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:25,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {20276#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {20325#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {20325#(<= ~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)); {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {20325#(<= ~counter~0 1)} ~cond := #in~cond; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {20325#(<= ~counter~0 1)} assume !(0 == ~cond); {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {20325#(<= ~counter~0 1)} assume true; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,564 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20325#(<= ~counter~0 1)} {20325#(<= ~counter~0 1)} #94#return; {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {20325#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20325#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:25,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {20325#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {20350#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,566 INFO L272 TraceCheckUtils]: 27: Hoare triple {20350#(<= ~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)); {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {20350#(<= ~counter~0 2)} ~cond := #in~cond; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {20350#(<= ~counter~0 2)} assume !(0 == ~cond); {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {20350#(<= ~counter~0 2)} assume true; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,567 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20350#(<= ~counter~0 2)} {20350#(<= ~counter~0 2)} #96#return; {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {20350#(<= ~counter~0 2)} assume !(~r~0 > 0); {20350#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:25,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {20350#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {20375#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,568 INFO L272 TraceCheckUtils]: 35: Hoare triple {20375#(<= ~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)); {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {20375#(<= ~counter~0 3)} ~cond := #in~cond; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {20375#(<= ~counter~0 3)} assume !(0 == ~cond); {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {20375#(<= ~counter~0 3)} assume true; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,570 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20375#(<= ~counter~0 3)} {20375#(<= ~counter~0 3)} #98#return; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {20375#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20375#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:25,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {20375#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {20400#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,571 INFO L272 TraceCheckUtils]: 43: Hoare triple {20400#(<= ~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)); {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {20400#(<= ~counter~0 4)} ~cond := #in~cond; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {20400#(<= ~counter~0 4)} assume !(0 == ~cond); {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {20400#(<= ~counter~0 4)} assume true; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,572 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20400#(<= ~counter~0 4)} {20400#(<= ~counter~0 4)} #98#return; {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {20400#(<= ~counter~0 4)} assume !(~r~0 < 0); {20400#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:25,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {20400#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {20425#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,574 INFO L272 TraceCheckUtils]: 51: Hoare triple {20425#(<= ~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)); {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {20425#(<= ~counter~0 5)} ~cond := #in~cond; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {20425#(<= ~counter~0 5)} assume !(0 == ~cond); {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {20425#(<= ~counter~0 5)} assume true; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,575 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20425#(<= ~counter~0 5)} {20425#(<= ~counter~0 5)} #94#return; {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {20425#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20425#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:25,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {20425#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {20450#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,577 INFO L272 TraceCheckUtils]: 59: Hoare triple {20450#(<= ~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)); {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {20450#(<= ~counter~0 6)} ~cond := #in~cond; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {20450#(<= ~counter~0 6)} assume !(0 == ~cond); {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {20450#(<= ~counter~0 6)} assume true; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,578 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20450#(<= ~counter~0 6)} {20450#(<= ~counter~0 6)} #96#return; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {20450#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20450#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {20450#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20475#(<= |main_#t~post7| 6)} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {20475#(<= |main_#t~post7| 6)} assume !(#t~post7 < 50);havoc #t~post7; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 67: Hoare triple {20269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 68: Hoare triple {20269#false} assume !(#t~post8 < 50);havoc #t~post8; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 69: Hoare triple {20269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 70: Hoare triple {20269#false} assume !(#t~post6 < 50);havoc #t~post6; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L272 TraceCheckUtils]: 71: Hoare triple {20269#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)); {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {20269#false} ~cond := #in~cond; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {20269#false} assume 0 == ~cond; {20269#false} is VALID [2022-04-15 09:02:25,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {20269#false} assume !false; {20269#false} is VALID [2022-04-15 09:02:25,580 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-15 09:02:25,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:02:25,932 INFO L290 TraceCheckUtils]: 74: Hoare triple {20269#false} assume !false; {20269#false} is VALID [2022-04-15 09:02:25,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {20269#false} assume 0 == ~cond; {20269#false} is VALID [2022-04-15 09:02:25,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {20269#false} ~cond := #in~cond; {20269#false} is VALID [2022-04-15 09:02:25,932 INFO L272 TraceCheckUtils]: 71: Hoare triple {20269#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)); {20269#false} is VALID [2022-04-15 09:02:25,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {20269#false} assume !(#t~post6 < 50);havoc #t~post6; {20269#false} is VALID [2022-04-15 09:02:25,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {20269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20269#false} is VALID [2022-04-15 09:02:25,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {20269#false} assume !(#t~post8 < 50);havoc #t~post8; {20269#false} is VALID [2022-04-15 09:02:25,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {20269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20269#false} is VALID [2022-04-15 09:02:25,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {20527#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {20269#false} is VALID [2022-04-15 09:02:25,933 INFO L290 TraceCheckUtils]: 65: Hoare triple {20531#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20527#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:02:25,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {20531#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20531#(< ~counter~0 50)} is VALID [2022-04-15 09:02:25,934 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20268#true} {20531#(< ~counter~0 50)} #96#return; {20531#(< ~counter~0 50)} is VALID [2022-04-15 09:02:25,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,935 INFO L272 TraceCheckUtils]: 59: Hoare triple {20531#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {20531#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {20531#(< ~counter~0 50)} is VALID [2022-04-15 09:02:25,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {20556#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20531#(< ~counter~0 50)} is VALID [2022-04-15 09:02:25,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {20556#(< ~counter~0 49)} assume !!(0 != ~r~0); {20556#(< ~counter~0 49)} is VALID [2022-04-15 09:02:25,936 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20268#true} {20556#(< ~counter~0 49)} #94#return; {20556#(< ~counter~0 49)} is VALID [2022-04-15 09:02:25,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,937 INFO L272 TraceCheckUtils]: 51: Hoare triple {20556#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {20556#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {20556#(< ~counter~0 49)} is VALID [2022-04-15 09:02:25,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {20581#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20556#(< ~counter~0 49)} is VALID [2022-04-15 09:02:25,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {20581#(< ~counter~0 48)} assume !(~r~0 < 0); {20581#(< ~counter~0 48)} is VALID [2022-04-15 09:02:25,938 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20268#true} {20581#(< ~counter~0 48)} #98#return; {20581#(< ~counter~0 48)} is VALID [2022-04-15 09:02:25,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,938 INFO L272 TraceCheckUtils]: 43: Hoare triple {20581#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {20581#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {20581#(< ~counter~0 48)} is VALID [2022-04-15 09:02:25,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {20606#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20581#(< ~counter~0 48)} is VALID [2022-04-15 09:02:25,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {20606#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20606#(< ~counter~0 47)} is VALID [2022-04-15 09:02:25,940 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20268#true} {20606#(< ~counter~0 47)} #98#return; {20606#(< ~counter~0 47)} is VALID [2022-04-15 09:02:25,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,940 INFO L272 TraceCheckUtils]: 35: Hoare triple {20606#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {20606#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {20606#(< ~counter~0 47)} is VALID [2022-04-15 09:02:25,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {20631#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20606#(< ~counter~0 47)} is VALID [2022-04-15 09:02:25,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {20631#(< ~counter~0 46)} assume !(~r~0 > 0); {20631#(< ~counter~0 46)} is VALID [2022-04-15 09:02:25,942 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20268#true} {20631#(< ~counter~0 46)} #96#return; {20631#(< ~counter~0 46)} is VALID [2022-04-15 09:02:25,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,942 INFO L290 TraceCheckUtils]: 28: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,942 INFO L272 TraceCheckUtils]: 27: Hoare triple {20631#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {20631#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {20631#(< ~counter~0 46)} is VALID [2022-04-15 09:02:25,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {20656#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20631#(< ~counter~0 46)} is VALID [2022-04-15 09:02:25,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {20656#(< ~counter~0 45)} assume !!(0 != ~r~0); {20656#(< ~counter~0 45)} is VALID [2022-04-15 09:02:25,944 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20268#true} {20656#(< ~counter~0 45)} #94#return; {20656#(< ~counter~0 45)} is VALID [2022-04-15 09:02:25,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,944 INFO L272 TraceCheckUtils]: 19: Hoare triple {20656#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {20656#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {20656#(< ~counter~0 45)} is VALID [2022-04-15 09:02:25,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {20681#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20656#(< ~counter~0 45)} is VALID [2022-04-15 09:02:25,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {20681#(< ~counter~0 44)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,946 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20268#true} {20681#(< ~counter~0 44)} #92#return; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,946 INFO L272 TraceCheckUtils]: 11: Hoare triple {20681#(< ~counter~0 44)} 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)); {20268#true} is VALID [2022-04-15 09:02:25,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20268#true} {20681#(< ~counter~0 44)} #90#return; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {20268#true} assume true; {20268#true} is VALID [2022-04-15 09:02:25,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {20268#true} assume !(0 == ~cond); {20268#true} is VALID [2022-04-15 09:02:25,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {20268#true} ~cond := #in~cond; {20268#true} is VALID [2022-04-15 09:02:25,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {20681#(< ~counter~0 44)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20268#true} is VALID [2022-04-15 09:02:25,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {20681#(< ~counter~0 44)} 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; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {20681#(< ~counter~0 44)} call #t~ret9 := main(); {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20681#(< ~counter~0 44)} {20268#true} #102#return; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {20681#(< ~counter~0 44)} assume true; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {20268#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; {20681#(< ~counter~0 44)} is VALID [2022-04-15 09:02:25,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {20268#true} call ULTIMATE.init(); {20268#true} is VALID [2022-04-15 09:02:25,949 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-15 09:02:25,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:02:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139642270] [2022-04-15 09:02:25,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:02:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270213154] [2022-04-15 09:02:25,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270213154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:02:25,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:02:25,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 09:02:25,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:02:25,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527346075] [2022-04-15 09:02:25,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527346075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:02:25,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:02:25,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:02:25,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081245807] [2022-04-15 09:02:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:02:25,950 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-15 09:02:25,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:02:25,950 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-15 09:02:25,999 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-15 09:02:25,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:02:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:26,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:02:26,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:02:26,000 INFO L87 Difference]: Start difference. First operand 216 states and 275 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-15 09:02:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:26,548 INFO L93 Difference]: Finished difference Result 288 states and 375 transitions. [2022-04-15 09:02:26,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 09:02:26,549 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-15 09:02:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:02:26,549 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-15 09:02:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 09:02:26,551 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-15 09:02:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 09:02:26,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-15 09:02:26,660 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-15 09:02:26,663 INFO L225 Difference]: With dead ends: 288 [2022-04-15 09:02:26,663 INFO L226 Difference]: Without dead ends: 225 [2022-04-15 09:02:26,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-15 09:02:26,664 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 53 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:02:26,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:02:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-15 09:02:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2022-04-15 09:02:26,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:02:26,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:26,878 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:26,878 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:26,882 INFO L93 Difference]: Finished difference Result 225 states and 284 transitions. [2022-04-15 09:02:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2022-04-15 09:02:26,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:26,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:26,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 225 states. [2022-04-15 09:02:26,883 INFO L87 Difference]: Start difference. First operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand 225 states. [2022-04-15 09:02:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:26,888 INFO L93 Difference]: Finished difference Result 225 states and 284 transitions. [2022-04-15 09:02:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2022-04-15 09:02:26,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:26,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:26,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:02:26,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:02:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 166 states have (on average 1.2108433734939759) internal successors, (201), 168 states have internal predecessors, (201), 41 states have call successors, (41), 16 states have call predecessors, (41), 14 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-15 09:02:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2022-04-15 09:02:26,893 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 75 [2022-04-15 09:02:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:02:26,893 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2022-04-15 09:02:26,893 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-15 09:02:26,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 281 transitions. [2022-04-15 09:02:40,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 276 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 09:02:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2022-04-15 09:02:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 09:02:40,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:02:40,903 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-15 09:02:40,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 09:02:41,103 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-15 09:02:41,103 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:02:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:02:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-15 09:02:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:41,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1601097571] [2022-04-15 09:02:41,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:02:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-15 09:02:41,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:02:41,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9071704] [2022-04-15 09:02:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:02:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:02:41,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:02:41,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533337171] [2022-04-15 09:02:41,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:02:41,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:02:41,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:02:41,121 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-15 09:02:41,121 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-15 09:02:41,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:02:41,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:02:41,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 09:02:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:02:41,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:02:41,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID [2022-04-15 09:02:41,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#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; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {22223#(<= ~counter~0 0)} assume true; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22223#(<= ~counter~0 0)} {22215#true} #102#return; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {22223#(<= ~counter~0 0)} call #t~ret9 := main(); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {22223#(<= ~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; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {22223#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {22223#(<= ~counter~0 0)} ~cond := #in~cond; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {22223#(<= ~counter~0 0)} assume !(0 == ~cond); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {22223#(<= ~counter~0 0)} assume true; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22223#(<= ~counter~0 0)} {22223#(<= ~counter~0 0)} #90#return; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,583 INFO L272 TraceCheckUtils]: 11: Hoare triple {22223#(<= ~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)); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {22223#(<= ~counter~0 0)} ~cond := #in~cond; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {22223#(<= ~counter~0 0)} assume !(0 == ~cond); {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {22223#(<= ~counter~0 0)} assume true; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,584 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22223#(<= ~counter~0 0)} {22223#(<= ~counter~0 0)} #92#return; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {22223#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22223#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:41,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {22223#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {22272#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,586 INFO L272 TraceCheckUtils]: 19: Hoare triple {22272#(<= ~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)); {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {22272#(<= ~counter~0 1)} ~cond := #in~cond; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {22272#(<= ~counter~0 1)} assume !(0 == ~cond); {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {22272#(<= ~counter~0 1)} assume true; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,587 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22272#(<= ~counter~0 1)} {22272#(<= ~counter~0 1)} #94#return; {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {22272#(<= ~counter~0 1)} assume !!(0 != ~r~0); {22272#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:41,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {22272#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {22297#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,589 INFO L272 TraceCheckUtils]: 27: Hoare triple {22297#(<= ~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)); {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {22297#(<= ~counter~0 2)} ~cond := #in~cond; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {22297#(<= ~counter~0 2)} assume !(0 == ~cond); {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {22297#(<= ~counter~0 2)} assume true; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,590 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22297#(<= ~counter~0 2)} {22297#(<= ~counter~0 2)} #96#return; {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,590 INFO L290 TraceCheckUtils]: 32: Hoare triple {22297#(<= ~counter~0 2)} assume !(~r~0 > 0); {22297#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:41,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {22297#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {22322#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,592 INFO L272 TraceCheckUtils]: 35: Hoare triple {22322#(<= ~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)); {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {22322#(<= ~counter~0 3)} ~cond := #in~cond; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {22322#(<= ~counter~0 3)} assume !(0 == ~cond); {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {22322#(<= ~counter~0 3)} assume true; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,593 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22322#(<= ~counter~0 3)} {22322#(<= ~counter~0 3)} #98#return; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,593 INFO L290 TraceCheckUtils]: 40: Hoare triple {22322#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22322#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:41,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {22322#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {22347#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,594 INFO L272 TraceCheckUtils]: 43: Hoare triple {22347#(<= ~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)); {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,595 INFO L290 TraceCheckUtils]: 44: Hoare triple {22347#(<= ~counter~0 4)} ~cond := #in~cond; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {22347#(<= ~counter~0 4)} assume !(0 == ~cond); {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {22347#(<= ~counter~0 4)} assume true; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,596 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22347#(<= ~counter~0 4)} {22347#(<= ~counter~0 4)} #98#return; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {22347#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22347#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:41,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {22347#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {22372#(<= ~counter~0 5)} assume !!(#t~post8 < 50);havoc #t~post8; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,597 INFO L272 TraceCheckUtils]: 51: Hoare triple {22372#(<= ~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)); {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {22372#(<= ~counter~0 5)} ~cond := #in~cond; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {22372#(<= ~counter~0 5)} assume !(0 == ~cond); {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {22372#(<= ~counter~0 5)} assume true; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,599 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22372#(<= ~counter~0 5)} {22372#(<= ~counter~0 5)} #98#return; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,599 INFO L290 TraceCheckUtils]: 56: Hoare triple {22372#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22372#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:41,599 INFO L290 TraceCheckUtils]: 57: Hoare triple {22372#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {22397#(<= ~counter~0 6)} assume !!(#t~post8 < 50);havoc #t~post8; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,600 INFO L272 TraceCheckUtils]: 59: Hoare triple {22397#(<= ~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)); {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {22397#(<= ~counter~0 6)} ~cond := #in~cond; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {22397#(<= ~counter~0 6)} assume !(0 == ~cond); {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {22397#(<= ~counter~0 6)} assume true; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,602 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22397#(<= ~counter~0 6)} {22397#(<= ~counter~0 6)} #98#return; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,602 INFO L290 TraceCheckUtils]: 64: Hoare triple {22397#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22397#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:41,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {22397#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,603 INFO L290 TraceCheckUtils]: 66: Hoare triple {22422#(<= ~counter~0 7)} assume !!(#t~post8 < 50);havoc #t~post8; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,603 INFO L272 TraceCheckUtils]: 67: Hoare triple {22422#(<= ~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)); {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,603 INFO L290 TraceCheckUtils]: 68: Hoare triple {22422#(<= ~counter~0 7)} ~cond := #in~cond; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,604 INFO L290 TraceCheckUtils]: 69: Hoare triple {22422#(<= ~counter~0 7)} assume !(0 == ~cond); {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,604 INFO L290 TraceCheckUtils]: 70: Hoare triple {22422#(<= ~counter~0 7)} assume true; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,604 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22422#(<= ~counter~0 7)} {22422#(<= ~counter~0 7)} #98#return; {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,605 INFO L290 TraceCheckUtils]: 72: Hoare triple {22422#(<= ~counter~0 7)} assume !(~r~0 < 0); {22422#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:41,605 INFO L290 TraceCheckUtils]: 73: Hoare triple {22422#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22447#(<= |main_#t~post6| 7)} is VALID [2022-04-15 09:02:41,605 INFO L290 TraceCheckUtils]: 74: Hoare triple {22447#(<= |main_#t~post6| 7)} assume !(#t~post6 < 50);havoc #t~post6; {22216#false} is VALID [2022-04-15 09:02:41,605 INFO L272 TraceCheckUtils]: 75: Hoare triple {22216#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)); {22216#false} is VALID [2022-04-15 09:02:41,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-15 09:02:41,606 INFO L290 TraceCheckUtils]: 77: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-15 09:02:41,606 INFO L290 TraceCheckUtils]: 78: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-15 09:02:41,606 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-15 09:02:41,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:02:42,003 INFO L290 TraceCheckUtils]: 78: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-15 09:02:42,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-15 09:02:42,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-15 09:02:42,004 INFO L272 TraceCheckUtils]: 75: Hoare triple {22216#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)); {22216#false} is VALID [2022-04-15 09:02:42,004 INFO L290 TraceCheckUtils]: 74: Hoare triple {22475#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {22216#false} is VALID [2022-04-15 09:02:42,004 INFO L290 TraceCheckUtils]: 73: Hoare triple {22479#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22475#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:02:42,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {22479#(< ~counter~0 50)} assume !(~r~0 < 0); {22479#(< ~counter~0 50)} is VALID [2022-04-15 09:02:42,005 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22215#true} {22479#(< ~counter~0 50)} #98#return; {22479#(< ~counter~0 50)} is VALID [2022-04-15 09:02:42,005 INFO L290 TraceCheckUtils]: 70: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,005 INFO L290 TraceCheckUtils]: 69: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,005 INFO L290 TraceCheckUtils]: 68: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,005 INFO L272 TraceCheckUtils]: 67: Hoare triple {22479#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,006 INFO L290 TraceCheckUtils]: 66: Hoare triple {22479#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {22479#(< ~counter~0 50)} is VALID [2022-04-15 09:02:42,006 INFO L290 TraceCheckUtils]: 65: Hoare triple {22504#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22479#(< ~counter~0 50)} is VALID [2022-04-15 09:02:42,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {22504#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22504#(< ~counter~0 49)} is VALID [2022-04-15 09:02:42,007 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22215#true} {22504#(< ~counter~0 49)} #98#return; {22504#(< ~counter~0 49)} is VALID [2022-04-15 09:02:42,007 INFO L290 TraceCheckUtils]: 62: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,007 INFO L290 TraceCheckUtils]: 61: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,007 INFO L272 TraceCheckUtils]: 59: Hoare triple {22504#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {22504#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {22504#(< ~counter~0 49)} is VALID [2022-04-15 09:02:42,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {22529#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22504#(< ~counter~0 49)} is VALID [2022-04-15 09:02:42,008 INFO L290 TraceCheckUtils]: 56: Hoare triple {22529#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22529#(< ~counter~0 48)} is VALID [2022-04-15 09:02:42,009 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22215#true} {22529#(< ~counter~0 48)} #98#return; {22529#(< ~counter~0 48)} is VALID [2022-04-15 09:02:42,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,009 INFO L290 TraceCheckUtils]: 53: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,009 INFO L272 TraceCheckUtils]: 51: Hoare triple {22529#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {22529#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {22529#(< ~counter~0 48)} is VALID [2022-04-15 09:02:42,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {22554#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22529#(< ~counter~0 48)} is VALID [2022-04-15 09:02:42,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {22554#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22554#(< ~counter~0 47)} is VALID [2022-04-15 09:02:42,011 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22215#true} {22554#(< ~counter~0 47)} #98#return; {22554#(< ~counter~0 47)} is VALID [2022-04-15 09:02:42,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,011 INFO L272 TraceCheckUtils]: 43: Hoare triple {22554#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {22554#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {22554#(< ~counter~0 47)} is VALID [2022-04-15 09:02:42,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {22579#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22554#(< ~counter~0 47)} is VALID [2022-04-15 09:02:42,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {22579#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22579#(< ~counter~0 46)} is VALID [2022-04-15 09:02:42,013 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22215#true} {22579#(< ~counter~0 46)} #98#return; {22579#(< ~counter~0 46)} is VALID [2022-04-15 09:02:42,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,013 INFO L290 TraceCheckUtils]: 37: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,013 INFO L272 TraceCheckUtils]: 35: Hoare triple {22579#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {22579#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {22579#(< ~counter~0 46)} is VALID [2022-04-15 09:02:42,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {22604#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22579#(< ~counter~0 46)} is VALID [2022-04-15 09:02:42,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {22604#(< ~counter~0 45)} assume !(~r~0 > 0); {22604#(< ~counter~0 45)} is VALID [2022-04-15 09:02:42,014 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22215#true} {22604#(< ~counter~0 45)} #96#return; {22604#(< ~counter~0 45)} is VALID [2022-04-15 09:02:42,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,015 INFO L272 TraceCheckUtils]: 27: Hoare triple {22604#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {22604#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {22604#(< ~counter~0 45)} is VALID [2022-04-15 09:02:42,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {22629#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22604#(< ~counter~0 45)} is VALID [2022-04-15 09:02:42,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {22629#(< ~counter~0 44)} assume !!(0 != ~r~0); {22629#(< ~counter~0 44)} is VALID [2022-04-15 09:02:42,016 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22215#true} {22629#(< ~counter~0 44)} #94#return; {22629#(< ~counter~0 44)} is VALID [2022-04-15 09:02:42,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,016 INFO L272 TraceCheckUtils]: 19: Hoare triple {22629#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {22629#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {22629#(< ~counter~0 44)} is VALID [2022-04-15 09:02:42,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {22654#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22629#(< ~counter~0 44)} is VALID [2022-04-15 09:02:42,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {22654#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22215#true} {22654#(< ~counter~0 43)} #92#return; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,018 INFO L272 TraceCheckUtils]: 11: Hoare triple {22654#(< ~counter~0 43)} 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)); {22215#true} is VALID [2022-04-15 09:02:42,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22215#true} {22654#(< ~counter~0 43)} #90#return; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-15 09:02:42,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {22215#true} assume !(0 == ~cond); {22215#true} is VALID [2022-04-15 09:02:42,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {22215#true} ~cond := #in~cond; {22215#true} is VALID [2022-04-15 09:02:42,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {22654#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22215#true} is VALID [2022-04-15 09:02:42,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {22654#(< ~counter~0 43)} 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; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {22654#(< ~counter~0 43)} call #t~ret9 := main(); {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22654#(< ~counter~0 43)} {22215#true} #102#return; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {22654#(< ~counter~0 43)} assume true; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#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; {22654#(< ~counter~0 43)} is VALID [2022-04-15 09:02:42,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID [2022-04-15 09:02:42,021 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-15 09:02:42,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:02:42,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9071704] [2022-04-15 09:02:42,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:02:42,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533337171] [2022-04-15 09:02:42,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533337171] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:02:42,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:02:42,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 09:02:42,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:02:42,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1601097571] [2022-04-15 09:02:42,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1601097571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:02:42,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:02:42,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:02:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330576611] [2022-04-15 09:02:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:02:42,022 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-15 09:02:42,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:02:42,022 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-15 09:02:42,074 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-15 09:02:42,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:02:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:02:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 09:02:42,075 INFO L87 Difference]: Start difference. First operand 222 states and 281 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-15 09:02:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:42,663 INFO L93 Difference]: Finished difference Result 256 states and 323 transitions. [2022-04-15 09:02:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 09:02:42,663 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-15 09:02:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:02:42,663 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-15 09:02:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 09:02:42,664 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-15 09:02:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 09:02:42,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-15 09:02:42,810 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-15 09:02:42,814 INFO L225 Difference]: With dead ends: 256 [2022-04-15 09:02:42,814 INFO L226 Difference]: Without dead ends: 251 [2022-04-15 09:02:42,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:02:42,815 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:02:42,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 198 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:02:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-04-15 09:02:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 242. [2022-04-15 09:02:43,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:02:43,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:43,013 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:43,013 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:43,016 INFO L93 Difference]: Finished difference Result 251 states and 317 transitions. [2022-04-15 09:02:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 317 transitions. [2022-04-15 09:02:43,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:43,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:43,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) Second operand 251 states. [2022-04-15 09:02:43,018 INFO L87 Difference]: Start difference. First operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) Second operand 251 states. [2022-04-15 09:02:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:43,022 INFO L93 Difference]: Finished difference Result 251 states and 317 transitions. [2022-04-15 09:02:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 317 transitions. [2022-04-15 09:02:43,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:43,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:43,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:02:43,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:02:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 178 states have (on average 1.2078651685393258) internal successors, (215), 184 states have internal predecessors, (215), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 307 transitions. [2022-04-15 09:02:43,026 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 307 transitions. Word has length 79 [2022-04-15 09:02:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:02:43,026 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 307 transitions. [2022-04-15 09:02:43,027 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-15 09:02:43,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 307 transitions. [2022-04-15 09:02:52,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 304 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:02:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 307 transitions. [2022-04-15 09:02:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 09:02:52,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:02:52,358 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-15 09:02:52,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 09:02:52,558 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-15 09:02:52,558 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:02:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:02:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-15 09:02:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503058940] [2022-04-15 09:02:52,559 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:02:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-15 09:02:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:02:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420688393] [2022-04-15 09:02:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:02:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:02:52,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:02:52,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649009346] [2022-04-15 09:02:52,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:02:52,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:02:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:02:52,571 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-15 09:02:52,572 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-15 09:02:52,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:02:52,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:02:52,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 09:02:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:02:52,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:02:53,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {24214#true} call ULTIMATE.init(); {24214#true} is VALID [2022-04-15 09:02:53,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {24214#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; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {24222#(<= ~counter~0 0)} assume true; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24222#(<= ~counter~0 0)} {24214#true} #102#return; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {24222#(<= ~counter~0 0)} call #t~ret9 := main(); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {24222#(<= ~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; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {24222#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {24222#(<= ~counter~0 0)} ~cond := #in~cond; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {24222#(<= ~counter~0 0)} assume !(0 == ~cond); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {24222#(<= ~counter~0 0)} assume true; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24222#(<= ~counter~0 0)} {24222#(<= ~counter~0 0)} #90#return; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {24222#(<= ~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)); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {24222#(<= ~counter~0 0)} ~cond := #in~cond; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {24222#(<= ~counter~0 0)} assume !(0 == ~cond); {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {24222#(<= ~counter~0 0)} assume true; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,020 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24222#(<= ~counter~0 0)} {24222#(<= ~counter~0 0)} #92#return; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {24222#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24222#(<= ~counter~0 0)} is VALID [2022-04-15 09:02:53,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {24222#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {24271#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,021 INFO L272 TraceCheckUtils]: 19: Hoare triple {24271#(<= ~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)); {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {24271#(<= ~counter~0 1)} ~cond := #in~cond; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {24271#(<= ~counter~0 1)} assume !(0 == ~cond); {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {24271#(<= ~counter~0 1)} assume true; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,022 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24271#(<= ~counter~0 1)} {24271#(<= ~counter~0 1)} #94#return; {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {24271#(<= ~counter~0 1)} assume !!(0 != ~r~0); {24271#(<= ~counter~0 1)} is VALID [2022-04-15 09:02:53,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {24271#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {24296#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,024 INFO L272 TraceCheckUtils]: 27: Hoare triple {24296#(<= ~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)); {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {24296#(<= ~counter~0 2)} ~cond := #in~cond; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {24296#(<= ~counter~0 2)} assume !(0 == ~cond); {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {24296#(<= ~counter~0 2)} assume true; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,025 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24296#(<= ~counter~0 2)} {24296#(<= ~counter~0 2)} #96#return; {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {24296#(<= ~counter~0 2)} assume !(~r~0 > 0); {24296#(<= ~counter~0 2)} is VALID [2022-04-15 09:02:53,025 INFO L290 TraceCheckUtils]: 33: Hoare triple {24296#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {24321#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,026 INFO L272 TraceCheckUtils]: 35: Hoare triple {24321#(<= ~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)); {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {24321#(<= ~counter~0 3)} ~cond := #in~cond; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {24321#(<= ~counter~0 3)} assume !(0 == ~cond); {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {24321#(<= ~counter~0 3)} assume true; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,027 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24321#(<= ~counter~0 3)} {24321#(<= ~counter~0 3)} #98#return; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {24321#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24321#(<= ~counter~0 3)} is VALID [2022-04-15 09:02:53,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {24321#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {24346#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,028 INFO L272 TraceCheckUtils]: 43: Hoare triple {24346#(<= ~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)); {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {24346#(<= ~counter~0 4)} ~cond := #in~cond; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {24346#(<= ~counter~0 4)} assume !(0 == ~cond); {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {24346#(<= ~counter~0 4)} assume true; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,029 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24346#(<= ~counter~0 4)} {24346#(<= ~counter~0 4)} #98#return; {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {24346#(<= ~counter~0 4)} assume !(~r~0 < 0); {24346#(<= ~counter~0 4)} is VALID [2022-04-15 09:02:53,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {24346#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {24371#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,030 INFO L272 TraceCheckUtils]: 51: Hoare triple {24371#(<= ~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)); {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {24371#(<= ~counter~0 5)} ~cond := #in~cond; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {24371#(<= ~counter~0 5)} assume !(0 == ~cond); {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {24371#(<= ~counter~0 5)} assume true; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,032 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24371#(<= ~counter~0 5)} {24371#(<= ~counter~0 5)} #94#return; {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {24371#(<= ~counter~0 5)} assume !!(0 != ~r~0); {24371#(<= ~counter~0 5)} is VALID [2022-04-15 09:02:53,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {24371#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,032 INFO L290 TraceCheckUtils]: 58: Hoare triple {24396#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,033 INFO L272 TraceCheckUtils]: 59: Hoare triple {24396#(<= ~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)); {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {24396#(<= ~counter~0 6)} ~cond := #in~cond; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {24396#(<= ~counter~0 6)} assume !(0 == ~cond); {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {24396#(<= ~counter~0 6)} assume true; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,034 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24396#(<= ~counter~0 6)} {24396#(<= ~counter~0 6)} #96#return; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,034 INFO L290 TraceCheckUtils]: 64: Hoare triple {24396#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24396#(<= ~counter~0 6)} is VALID [2022-04-15 09:02:53,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {24396#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,035 INFO L290 TraceCheckUtils]: 66: Hoare triple {24421#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,035 INFO L272 TraceCheckUtils]: 67: Hoare triple {24421#(<= ~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)); {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {24421#(<= ~counter~0 7)} ~cond := #in~cond; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {24421#(<= ~counter~0 7)} assume !(0 == ~cond); {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {24421#(<= ~counter~0 7)} assume true; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,036 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24421#(<= ~counter~0 7)} {24421#(<= ~counter~0 7)} #96#return; {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,036 INFO L290 TraceCheckUtils]: 72: Hoare triple {24421#(<= ~counter~0 7)} assume !(~r~0 > 0); {24421#(<= ~counter~0 7)} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {24421#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24446#(<= |main_#t~post8| 7)} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {24446#(<= |main_#t~post8| 7)} assume !(#t~post8 < 50);havoc #t~post8; {24215#false} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {24215#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24215#false} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {24215#false} assume !(#t~post6 < 50);havoc #t~post6; {24215#false} is VALID [2022-04-15 09:02:53,037 INFO L272 TraceCheckUtils]: 77: Hoare triple {24215#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)); {24215#false} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 78: Hoare triple {24215#false} ~cond := #in~cond; {24215#false} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {24215#false} assume 0 == ~cond; {24215#false} is VALID [2022-04-15 09:02:53,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {24215#false} assume !false; {24215#false} is VALID [2022-04-15 09:02:53,038 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-15 09:02:53,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:02:53,361 INFO L290 TraceCheckUtils]: 80: Hoare triple {24215#false} assume !false; {24215#false} is VALID [2022-04-15 09:02:53,361 INFO L290 TraceCheckUtils]: 79: Hoare triple {24215#false} assume 0 == ~cond; {24215#false} is VALID [2022-04-15 09:02:53,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {24215#false} ~cond := #in~cond; {24215#false} is VALID [2022-04-15 09:02:53,361 INFO L272 TraceCheckUtils]: 77: Hoare triple {24215#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)); {24215#false} is VALID [2022-04-15 09:02:53,362 INFO L290 TraceCheckUtils]: 76: Hoare triple {24215#false} assume !(#t~post6 < 50);havoc #t~post6; {24215#false} is VALID [2022-04-15 09:02:53,362 INFO L290 TraceCheckUtils]: 75: Hoare triple {24215#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24215#false} is VALID [2022-04-15 09:02:53,362 INFO L290 TraceCheckUtils]: 74: Hoare triple {24486#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {24215#false} is VALID [2022-04-15 09:02:53,362 INFO L290 TraceCheckUtils]: 73: Hoare triple {24490#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24486#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:02:53,362 INFO L290 TraceCheckUtils]: 72: Hoare triple {24490#(< ~counter~0 50)} assume !(~r~0 > 0); {24490#(< ~counter~0 50)} is VALID [2022-04-15 09:02:53,363 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24214#true} {24490#(< ~counter~0 50)} #96#return; {24490#(< ~counter~0 50)} is VALID [2022-04-15 09:02:53,363 INFO L290 TraceCheckUtils]: 70: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,363 INFO L290 TraceCheckUtils]: 69: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,363 INFO L290 TraceCheckUtils]: 68: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,363 INFO L272 TraceCheckUtils]: 67: Hoare triple {24490#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,363 INFO L290 TraceCheckUtils]: 66: Hoare triple {24490#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {24490#(< ~counter~0 50)} is VALID [2022-04-15 09:02:53,364 INFO L290 TraceCheckUtils]: 65: Hoare triple {24515#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24490#(< ~counter~0 50)} is VALID [2022-04-15 09:02:53,364 INFO L290 TraceCheckUtils]: 64: Hoare triple {24515#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24515#(< ~counter~0 49)} is VALID [2022-04-15 09:02:53,365 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24214#true} {24515#(< ~counter~0 49)} #96#return; {24515#(< ~counter~0 49)} is VALID [2022-04-15 09:02:53,365 INFO L290 TraceCheckUtils]: 62: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,365 INFO L290 TraceCheckUtils]: 61: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,365 INFO L290 TraceCheckUtils]: 60: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,365 INFO L272 TraceCheckUtils]: 59: Hoare triple {24515#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,365 INFO L290 TraceCheckUtils]: 58: Hoare triple {24515#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {24515#(< ~counter~0 49)} is VALID [2022-04-15 09:02:53,366 INFO L290 TraceCheckUtils]: 57: Hoare triple {24540#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24515#(< ~counter~0 49)} is VALID [2022-04-15 09:02:53,366 INFO L290 TraceCheckUtils]: 56: Hoare triple {24540#(< ~counter~0 48)} assume !!(0 != ~r~0); {24540#(< ~counter~0 48)} is VALID [2022-04-15 09:02:53,367 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24214#true} {24540#(< ~counter~0 48)} #94#return; {24540#(< ~counter~0 48)} is VALID [2022-04-15 09:02:53,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,367 INFO L290 TraceCheckUtils]: 52: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,367 INFO L272 TraceCheckUtils]: 51: Hoare triple {24540#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {24540#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {24540#(< ~counter~0 48)} is VALID [2022-04-15 09:02:53,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {24565#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24540#(< ~counter~0 48)} is VALID [2022-04-15 09:02:53,370 INFO L290 TraceCheckUtils]: 48: Hoare triple {24565#(< ~counter~0 47)} assume !(~r~0 < 0); {24565#(< ~counter~0 47)} is VALID [2022-04-15 09:02:53,370 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24214#true} {24565#(< ~counter~0 47)} #98#return; {24565#(< ~counter~0 47)} is VALID [2022-04-15 09:02:53,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,370 INFO L272 TraceCheckUtils]: 43: Hoare triple {24565#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {24565#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {24565#(< ~counter~0 47)} is VALID [2022-04-15 09:02:53,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {24590#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24565#(< ~counter~0 47)} is VALID [2022-04-15 09:02:53,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {24590#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24590#(< ~counter~0 46)} is VALID [2022-04-15 09:02:53,372 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24214#true} {24590#(< ~counter~0 46)} #98#return; {24590#(< ~counter~0 46)} is VALID [2022-04-15 09:02:53,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,372 INFO L272 TraceCheckUtils]: 35: Hoare triple {24590#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {24590#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {24590#(< ~counter~0 46)} is VALID [2022-04-15 09:02:53,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {24615#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24590#(< ~counter~0 46)} is VALID [2022-04-15 09:02:53,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {24615#(< ~counter~0 45)} assume !(~r~0 > 0); {24615#(< ~counter~0 45)} is VALID [2022-04-15 09:02:53,373 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24214#true} {24615#(< ~counter~0 45)} #96#return; {24615#(< ~counter~0 45)} is VALID [2022-04-15 09:02:53,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,374 INFO L272 TraceCheckUtils]: 27: Hoare triple {24615#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {24615#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {24615#(< ~counter~0 45)} is VALID [2022-04-15 09:02:53,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {24640#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24615#(< ~counter~0 45)} is VALID [2022-04-15 09:02:53,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {24640#(< ~counter~0 44)} assume !!(0 != ~r~0); {24640#(< ~counter~0 44)} is VALID [2022-04-15 09:02:53,375 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24214#true} {24640#(< ~counter~0 44)} #94#return; {24640#(< ~counter~0 44)} is VALID [2022-04-15 09:02:53,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,375 INFO L272 TraceCheckUtils]: 19: Hoare triple {24640#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {24640#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {24640#(< ~counter~0 44)} is VALID [2022-04-15 09:02:53,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {24665#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24640#(< ~counter~0 44)} is VALID [2022-04-15 09:02:53,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {24665#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,377 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24214#true} {24665#(< ~counter~0 43)} #92#return; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,377 INFO L272 TraceCheckUtils]: 11: Hoare triple {24665#(< ~counter~0 43)} 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)); {24214#true} is VALID [2022-04-15 09:02:53,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24214#true} {24665#(< ~counter~0 43)} #90#return; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {24214#true} assume true; {24214#true} is VALID [2022-04-15 09:02:53,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {24214#true} assume !(0 == ~cond); {24214#true} is VALID [2022-04-15 09:02:53,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {24214#true} ~cond := #in~cond; {24214#true} is VALID [2022-04-15 09:02:53,378 INFO L272 TraceCheckUtils]: 6: Hoare triple {24665#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {24214#true} is VALID [2022-04-15 09:02:53,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {24665#(< ~counter~0 43)} 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; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {24665#(< ~counter~0 43)} call #t~ret9 := main(); {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24665#(< ~counter~0 43)} {24214#true} #102#return; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {24665#(< ~counter~0 43)} assume true; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {24214#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; {24665#(< ~counter~0 43)} is VALID [2022-04-15 09:02:53,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {24214#true} call ULTIMATE.init(); {24214#true} is VALID [2022-04-15 09:02:53,379 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-15 09:02:53,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:02:53,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420688393] [2022-04-15 09:02:53,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:02:53,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649009346] [2022-04-15 09:02:53,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649009346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:02:53,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:02:53,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 09:02:53,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:02:53,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1503058940] [2022-04-15 09:02:53,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1503058940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:02:53,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:02:53,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:02:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716586458] [2022-04-15 09:02:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:02:53,381 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-15 09:02:53,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:02:53,382 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-15 09:02:53,446 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-15 09:02:53,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:02:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:02:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:02:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 09:02:53,447 INFO L87 Difference]: Start difference. First operand 242 states and 307 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-15 09:02:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:54,138 INFO L93 Difference]: Finished difference Result 340 states and 447 transitions. [2022-04-15 09:02:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 09:02:54,138 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-15 09:02:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:02:54,138 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-15 09:02:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 09:02:54,140 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-15 09:02:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 09:02:54,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-15 09:02:54,282 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-15 09:02:54,286 INFO L225 Difference]: With dead ends: 340 [2022-04-15 09:02:54,286 INFO L226 Difference]: Without dead ends: 253 [2022-04-15 09:02:54,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-15 09:02:54,287 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 78 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:02:54,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 195 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:02:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-15 09:02:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247. [2022-04-15 09:02:54,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:02:54,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:54,550 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:54,550 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:54,554 INFO L93 Difference]: Finished difference Result 253 states and 319 transitions. [2022-04-15 09:02:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 319 transitions. [2022-04-15 09:02:54,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:54,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:54,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) Second operand 253 states. [2022-04-15 09:02:54,555 INFO L87 Difference]: Start difference. First operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) Second operand 253 states. [2022-04-15 09:02:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:02:54,559 INFO L93 Difference]: Finished difference Result 253 states and 319 transitions. [2022-04-15 09:02:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 319 transitions. [2022-04-15 09:02:54,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:02:54,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:02:54,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:02:54,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:02:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 188 states have internal predecessors, (221), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 40 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:02:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 313 transitions. [2022-04-15 09:02:54,563 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 313 transitions. Word has length 81 [2022-04-15 09:02:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:02:54,563 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 313 transitions. [2022-04-15 09:02:54,564 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-15 09:02:54,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 247 states and 313 transitions. [2022-04-15 09:03:06,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 309 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 09:03:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-15 09:03:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 09:03:06,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:03:06,797 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-15 09:03:06,813 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-15 09:03:06,997 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-15 09:03:06,997 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:03:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:03:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-15 09:03:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:06,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633351018] [2022-04-15 09:03:06,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:03:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-15 09:03:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:03:06,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570209549] [2022-04-15 09:03:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:03:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:03:07,009 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:03:07,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728990543] [2022-04-15 09:03:07,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:03:07,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:03:07,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:03:07,010 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-15 09:03:07,011 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-15 09:03:07,111 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:03:07,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:03:07,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 09:03:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:03:07,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:03:07,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {26409#true} call ULTIMATE.init(); {26409#true} is VALID [2022-04-15 09:03:07,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {26409#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; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {26417#(<= ~counter~0 0)} assume true; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26417#(<= ~counter~0 0)} {26409#true} #102#return; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {26417#(<= ~counter~0 0)} call #t~ret9 := main(); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {26417#(<= ~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; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {26417#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {26417#(<= ~counter~0 0)} ~cond := #in~cond; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {26417#(<= ~counter~0 0)} assume !(0 == ~cond); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {26417#(<= ~counter~0 0)} assume true; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26417#(<= ~counter~0 0)} {26417#(<= ~counter~0 0)} #90#return; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,501 INFO L272 TraceCheckUtils]: 11: Hoare triple {26417#(<= ~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)); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {26417#(<= ~counter~0 0)} ~cond := #in~cond; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {26417#(<= ~counter~0 0)} assume !(0 == ~cond); {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {26417#(<= ~counter~0 0)} assume true; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26417#(<= ~counter~0 0)} {26417#(<= ~counter~0 0)} #92#return; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {26417#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26417#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:07,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {26417#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {26466#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {26466#(<= ~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)); {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {26466#(<= ~counter~0 1)} ~cond := #in~cond; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {26466#(<= ~counter~0 1)} assume !(0 == ~cond); {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {26466#(<= ~counter~0 1)} assume true; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,506 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26466#(<= ~counter~0 1)} {26466#(<= ~counter~0 1)} #94#return; {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {26466#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26466#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:07,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {26466#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {26491#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,507 INFO L272 TraceCheckUtils]: 27: Hoare triple {26491#(<= ~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)); {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {26491#(<= ~counter~0 2)} ~cond := #in~cond; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {26491#(<= ~counter~0 2)} assume !(0 == ~cond); {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {26491#(<= ~counter~0 2)} assume true; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,509 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26491#(<= ~counter~0 2)} {26491#(<= ~counter~0 2)} #96#return; {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {26491#(<= ~counter~0 2)} assume !(~r~0 > 0); {26491#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:07,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {26491#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {26516#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,510 INFO L272 TraceCheckUtils]: 35: Hoare triple {26516#(<= ~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)); {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {26516#(<= ~counter~0 3)} ~cond := #in~cond; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {26516#(<= ~counter~0 3)} assume !(0 == ~cond); {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {26516#(<= ~counter~0 3)} assume true; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,512 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26516#(<= ~counter~0 3)} {26516#(<= ~counter~0 3)} #98#return; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {26516#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26516#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:07,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {26516#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {26541#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,513 INFO L272 TraceCheckUtils]: 43: Hoare triple {26541#(<= ~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)); {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {26541#(<= ~counter~0 4)} ~cond := #in~cond; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {26541#(<= ~counter~0 4)} assume !(0 == ~cond); {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,514 INFO L290 TraceCheckUtils]: 46: Hoare triple {26541#(<= ~counter~0 4)} assume true; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,514 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26541#(<= ~counter~0 4)} {26541#(<= ~counter~0 4)} #98#return; {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {26541#(<= ~counter~0 4)} assume !(~r~0 < 0); {26541#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:07,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {26541#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {26566#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,516 INFO L272 TraceCheckUtils]: 51: Hoare triple {26566#(<= ~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)); {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {26566#(<= ~counter~0 5)} ~cond := #in~cond; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {26566#(<= ~counter~0 5)} assume !(0 == ~cond); {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {26566#(<= ~counter~0 5)} assume true; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,517 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26566#(<= ~counter~0 5)} {26566#(<= ~counter~0 5)} #94#return; {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {26566#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26566#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:07,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {26566#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,518 INFO L290 TraceCheckUtils]: 58: Hoare triple {26591#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,519 INFO L272 TraceCheckUtils]: 59: Hoare triple {26591#(<= ~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)); {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,519 INFO L290 TraceCheckUtils]: 60: Hoare triple {26591#(<= ~counter~0 6)} ~cond := #in~cond; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,519 INFO L290 TraceCheckUtils]: 61: Hoare triple {26591#(<= ~counter~0 6)} assume !(0 == ~cond); {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,520 INFO L290 TraceCheckUtils]: 62: Hoare triple {26591#(<= ~counter~0 6)} assume true; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,520 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26591#(<= ~counter~0 6)} {26591#(<= ~counter~0 6)} #96#return; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {26591#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26591#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:07,521 INFO L290 TraceCheckUtils]: 65: Hoare triple {26591#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {26616#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,522 INFO L272 TraceCheckUtils]: 67: Hoare triple {26616#(<= ~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)); {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {26616#(<= ~counter~0 7)} ~cond := #in~cond; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {26616#(<= ~counter~0 7)} assume !(0 == ~cond); {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {26616#(<= ~counter~0 7)} assume true; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,523 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26616#(<= ~counter~0 7)} {26616#(<= ~counter~0 7)} #96#return; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {26616#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26616#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {26616#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26641#(<= |main_#t~post7| 7)} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {26641#(<= |main_#t~post7| 7)} assume !(#t~post7 < 50);havoc #t~post7; {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {26410#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 76: Hoare triple {26410#false} assume !(#t~post8 < 50);havoc #t~post8; {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {26410#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {26410#false} assume !(#t~post6 < 50);havoc #t~post6; {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L272 TraceCheckUtils]: 79: Hoare triple {26410#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)); {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {26410#false} ~cond := #in~cond; {26410#false} is VALID [2022-04-15 09:03:07,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {26410#false} assume 0 == ~cond; {26410#false} is VALID [2022-04-15 09:03:07,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {26410#false} assume !false; {26410#false} is VALID [2022-04-15 09:03:07,525 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-15 09:03:07,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:03:07,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {26410#false} assume !false; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {26410#false} assume 0 == ~cond; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {26410#false} ~cond := #in~cond; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L272 TraceCheckUtils]: 79: Hoare triple {26410#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)); {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {26410#false} assume !(#t~post6 < 50);havoc #t~post6; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {26410#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 76: Hoare triple {26410#false} assume !(#t~post8 < 50);havoc #t~post8; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {26410#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26410#false} is VALID [2022-04-15 09:03:07,929 INFO L290 TraceCheckUtils]: 74: Hoare triple {26693#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {26410#false} is VALID [2022-04-15 09:03:07,930 INFO L290 TraceCheckUtils]: 73: Hoare triple {26697#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26693#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:03:07,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {26697#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26697#(< ~counter~0 50)} is VALID [2022-04-15 09:03:07,930 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26409#true} {26697#(< ~counter~0 50)} #96#return; {26697#(< ~counter~0 50)} is VALID [2022-04-15 09:03:07,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,931 INFO L272 TraceCheckUtils]: 67: Hoare triple {26697#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {26697#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {26697#(< ~counter~0 50)} is VALID [2022-04-15 09:03:07,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {26722#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26697#(< ~counter~0 50)} is VALID [2022-04-15 09:03:07,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {26722#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26722#(< ~counter~0 49)} is VALID [2022-04-15 09:03:07,933 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26409#true} {26722#(< ~counter~0 49)} #96#return; {26722#(< ~counter~0 49)} is VALID [2022-04-15 09:03:07,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,933 INFO L272 TraceCheckUtils]: 59: Hoare triple {26722#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,933 INFO L290 TraceCheckUtils]: 58: Hoare triple {26722#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {26722#(< ~counter~0 49)} is VALID [2022-04-15 09:03:07,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {26747#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26722#(< ~counter~0 49)} is VALID [2022-04-15 09:03:07,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {26747#(< ~counter~0 48)} assume !!(0 != ~r~0); {26747#(< ~counter~0 48)} is VALID [2022-04-15 09:03:07,934 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26409#true} {26747#(< ~counter~0 48)} #94#return; {26747#(< ~counter~0 48)} is VALID [2022-04-15 09:03:07,935 INFO L290 TraceCheckUtils]: 54: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,935 INFO L290 TraceCheckUtils]: 53: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,935 INFO L290 TraceCheckUtils]: 52: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,935 INFO L272 TraceCheckUtils]: 51: Hoare triple {26747#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {26747#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {26747#(< ~counter~0 48)} is VALID [2022-04-15 09:03:07,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {26772#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26747#(< ~counter~0 48)} is VALID [2022-04-15 09:03:07,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {26772#(< ~counter~0 47)} assume !(~r~0 < 0); {26772#(< ~counter~0 47)} is VALID [2022-04-15 09:03:07,936 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26409#true} {26772#(< ~counter~0 47)} #98#return; {26772#(< ~counter~0 47)} is VALID [2022-04-15 09:03:07,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,937 INFO L290 TraceCheckUtils]: 44: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,937 INFO L272 TraceCheckUtils]: 43: Hoare triple {26772#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {26772#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {26772#(< ~counter~0 47)} is VALID [2022-04-15 09:03:07,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {26797#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26772#(< ~counter~0 47)} is VALID [2022-04-15 09:03:07,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {26797#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26797#(< ~counter~0 46)} is VALID [2022-04-15 09:03:07,938 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26409#true} {26797#(< ~counter~0 46)} #98#return; {26797#(< ~counter~0 46)} is VALID [2022-04-15 09:03:07,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,938 INFO L272 TraceCheckUtils]: 35: Hoare triple {26797#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {26797#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {26797#(< ~counter~0 46)} is VALID [2022-04-15 09:03:07,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {26822#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26797#(< ~counter~0 46)} is VALID [2022-04-15 09:03:07,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {26822#(< ~counter~0 45)} assume !(~r~0 > 0); {26822#(< ~counter~0 45)} is VALID [2022-04-15 09:03:07,940 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26409#true} {26822#(< ~counter~0 45)} #96#return; {26822#(< ~counter~0 45)} is VALID [2022-04-15 09:03:07,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,940 INFO L272 TraceCheckUtils]: 27: Hoare triple {26822#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,941 INFO L290 TraceCheckUtils]: 26: Hoare triple {26822#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {26822#(< ~counter~0 45)} is VALID [2022-04-15 09:03:07,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {26847#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26822#(< ~counter~0 45)} is VALID [2022-04-15 09:03:07,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {26847#(< ~counter~0 44)} assume !!(0 != ~r~0); {26847#(< ~counter~0 44)} is VALID [2022-04-15 09:03:07,942 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26409#true} {26847#(< ~counter~0 44)} #94#return; {26847#(< ~counter~0 44)} is VALID [2022-04-15 09:03:07,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,942 INFO L272 TraceCheckUtils]: 19: Hoare triple {26847#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {26847#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {26847#(< ~counter~0 44)} is VALID [2022-04-15 09:03:07,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {26872#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26847#(< ~counter~0 44)} is VALID [2022-04-15 09:03:07,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {26872#(< ~counter~0 43)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26409#true} {26872#(< ~counter~0 43)} #92#return; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,944 INFO L272 TraceCheckUtils]: 11: Hoare triple {26872#(< ~counter~0 43)} 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)); {26409#true} is VALID [2022-04-15 09:03:07,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26409#true} {26872#(< ~counter~0 43)} #90#return; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {26409#true} assume true; {26409#true} is VALID [2022-04-15 09:03:07,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {26409#true} assume !(0 == ~cond); {26409#true} is VALID [2022-04-15 09:03:07,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {26409#true} ~cond := #in~cond; {26409#true} is VALID [2022-04-15 09:03:07,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {26872#(< ~counter~0 43)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26409#true} is VALID [2022-04-15 09:03:07,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {26872#(< ~counter~0 43)} 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; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {26872#(< ~counter~0 43)} call #t~ret9 := main(); {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26872#(< ~counter~0 43)} {26409#true} #102#return; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {26872#(< ~counter~0 43)} assume true; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {26409#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; {26872#(< ~counter~0 43)} is VALID [2022-04-15 09:03:07,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {26409#true} call ULTIMATE.init(); {26409#true} is VALID [2022-04-15 09:03:07,947 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-15 09:03:07,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:03:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570209549] [2022-04-15 09:03:07,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:03:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728990543] [2022-04-15 09:03:07,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728990543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:03:07,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:03:07,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 09:03:07,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:03:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633351018] [2022-04-15 09:03:07,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633351018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:03:07,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:03:07,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:03:07,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75704968] [2022-04-15 09:03:07,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:03:07,948 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-15 09:03:07,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:03:07,948 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-15 09:03:08,005 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-15 09:03:08,006 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:03:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:08,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:03:08,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 09:03:08,006 INFO L87 Difference]: Start difference. First operand 247 states and 313 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-15 09:03:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:08,529 INFO L93 Difference]: Finished difference Result 319 states and 413 transitions. [2022-04-15 09:03:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 09:03:08,530 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-15 09:03:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:03:08,530 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-15 09:03:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 09:03:08,531 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-15 09:03:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 09:03:08,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-15 09:03:08,649 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-15 09:03:08,653 INFO L225 Difference]: With dead ends: 319 [2022-04-15 09:03:08,653 INFO L226 Difference]: Without dead ends: 256 [2022-04-15 09:03:08,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-15 09:03:08,654 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 98 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:03:08,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 182 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:03:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-15 09:03:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2022-04-15 09:03:08,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:03:08,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:03:08,886 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:03:08,886 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:03:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:08,890 INFO L93 Difference]: Finished difference Result 256 states and 322 transitions. [2022-04-15 09:03:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2022-04-15 09:03:08,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:08,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:08,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 256 states. [2022-04-15 09:03:08,891 INFO L87 Difference]: Start difference. First operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) Second operand 256 states. [2022-04-15 09:03:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:08,894 INFO L93 Difference]: Finished difference Result 256 states and 322 transitions. [2022-04-15 09:03:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2022-04-15 09:03:08,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:08,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:08,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:03:08,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:03:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 189 states have (on average 1.2010582010582012) internal successors, (227), 192 states have internal predecessors, (227), 47 states have call successors, (47), 18 states have call predecessors, (47), 16 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2022-04-15 09:03:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 319 transitions. [2022-04-15 09:03:08,899 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 319 transitions. Word has length 83 [2022-04-15 09:03:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:03:08,899 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 319 transitions. [2022-04-15 09:03:08,899 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-15 09:03:08,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 253 states and 319 transitions. [2022-04-15 09:03:20,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 316 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:03:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 319 transitions. [2022-04-15 09:03:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 09:03:20,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:03:20,937 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-15 09:03:20,953 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-15 09:03:21,137 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-15 09:03:21,137 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:03:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:03:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-15 09:03:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:21,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012522827] [2022-04-15 09:03:21,138 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:03:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-15 09:03:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:03:21,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201601982] [2022-04-15 09:03:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:03:21,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:03:21,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:03:21,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937906179] [2022-04-15 09:03:21,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:03:21,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:03:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:03:21,154 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-15 09:03:21,154 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-15 09:03:21,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:03:21,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:03:21,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 09:03:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:03:21,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:03:21,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {28594#true} call ULTIMATE.init(); {28594#true} is VALID [2022-04-15 09:03:21,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {28594#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; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {28602#(<= ~counter~0 0)} assume true; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28602#(<= ~counter~0 0)} {28594#true} #102#return; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {28602#(<= ~counter~0 0)} call #t~ret9 := main(); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {28602#(<= ~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; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {28602#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {28602#(<= ~counter~0 0)} ~cond := #in~cond; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {28602#(<= ~counter~0 0)} assume !(0 == ~cond); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {28602#(<= ~counter~0 0)} assume true; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28602#(<= ~counter~0 0)} {28602#(<= ~counter~0 0)} #90#return; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,645 INFO L272 TraceCheckUtils]: 11: Hoare triple {28602#(<= ~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)); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {28602#(<= ~counter~0 0)} ~cond := #in~cond; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {28602#(<= ~counter~0 0)} assume !(0 == ~cond); {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {28602#(<= ~counter~0 0)} assume true; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28602#(<= ~counter~0 0)} {28602#(<= ~counter~0 0)} #92#return; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {28602#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28602#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:21,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {28602#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {28651#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {28651#(<= ~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)); {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {28651#(<= ~counter~0 1)} ~cond := #in~cond; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {28651#(<= ~counter~0 1)} assume !(0 == ~cond); {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {28651#(<= ~counter~0 1)} assume true; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,649 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28651#(<= ~counter~0 1)} {28651#(<= ~counter~0 1)} #94#return; {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {28651#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28651#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:21,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {28651#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {28676#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,650 INFO L272 TraceCheckUtils]: 27: Hoare triple {28676#(<= ~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)); {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {28676#(<= ~counter~0 2)} ~cond := #in~cond; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {28676#(<= ~counter~0 2)} assume !(0 == ~cond); {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {28676#(<= ~counter~0 2)} assume true; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,652 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28676#(<= ~counter~0 2)} {28676#(<= ~counter~0 2)} #96#return; {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {28676#(<= ~counter~0 2)} assume !(~r~0 > 0); {28676#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:21,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {28676#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {28701#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,653 INFO L272 TraceCheckUtils]: 35: Hoare triple {28701#(<= ~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)); {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {28701#(<= ~counter~0 3)} ~cond := #in~cond; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {28701#(<= ~counter~0 3)} assume !(0 == ~cond); {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {28701#(<= ~counter~0 3)} assume true; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,654 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28701#(<= ~counter~0 3)} {28701#(<= ~counter~0 3)} #98#return; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {28701#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28701#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:21,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {28701#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {28726#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,656 INFO L272 TraceCheckUtils]: 43: Hoare triple {28726#(<= ~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)); {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {28726#(<= ~counter~0 4)} ~cond := #in~cond; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {28726#(<= ~counter~0 4)} assume !(0 == ~cond); {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {28726#(<= ~counter~0 4)} assume true; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,657 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28726#(<= ~counter~0 4)} {28726#(<= ~counter~0 4)} #98#return; {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {28726#(<= ~counter~0 4)} assume !(~r~0 < 0); {28726#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:21,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {28726#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {28751#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,658 INFO L272 TraceCheckUtils]: 51: Hoare triple {28751#(<= ~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)); {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {28751#(<= ~counter~0 5)} ~cond := #in~cond; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {28751#(<= ~counter~0 5)} assume !(0 == ~cond); {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {28751#(<= ~counter~0 5)} assume true; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,659 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28751#(<= ~counter~0 5)} {28751#(<= ~counter~0 5)} #94#return; {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {28751#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28751#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:21,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {28751#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {28776#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,661 INFO L272 TraceCheckUtils]: 59: Hoare triple {28776#(<= ~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)); {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {28776#(<= ~counter~0 6)} ~cond := #in~cond; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {28776#(<= ~counter~0 6)} assume !(0 == ~cond); {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {28776#(<= ~counter~0 6)} assume true; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,662 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28776#(<= ~counter~0 6)} {28776#(<= ~counter~0 6)} #96#return; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {28776#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28776#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:21,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {28776#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {28801#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,663 INFO L272 TraceCheckUtils]: 67: Hoare triple {28801#(<= ~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)); {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {28801#(<= ~counter~0 7)} ~cond := #in~cond; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {28801#(<= ~counter~0 7)} assume !(0 == ~cond); {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {28801#(<= ~counter~0 7)} assume true; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,665 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28801#(<= ~counter~0 7)} {28801#(<= ~counter~0 7)} #96#return; {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {28801#(<= ~counter~0 7)} assume !(~r~0 > 0); {28801#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:21,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {28801#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {28826#(<= ~counter~0 8)} assume !!(#t~post8 < 50);havoc #t~post8; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,666 INFO L272 TraceCheckUtils]: 75: Hoare triple {28826#(<= ~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)); {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {28826#(<= ~counter~0 8)} ~cond := #in~cond; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {28826#(<= ~counter~0 8)} assume !(0 == ~cond); {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {28826#(<= ~counter~0 8)} assume true; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,667 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28826#(<= ~counter~0 8)} {28826#(<= ~counter~0 8)} #98#return; {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {28826#(<= ~counter~0 8)} assume !(~r~0 < 0); {28826#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:21,668 INFO L290 TraceCheckUtils]: 81: Hoare triple {28826#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28851#(<= |main_#t~post6| 8)} is VALID [2022-04-15 09:03:21,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {28851#(<= |main_#t~post6| 8)} assume !(#t~post6 < 50);havoc #t~post6; {28595#false} is VALID [2022-04-15 09:03:21,668 INFO L272 TraceCheckUtils]: 83: Hoare triple {28595#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)); {28595#false} is VALID [2022-04-15 09:03:21,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {28595#false} ~cond := #in~cond; {28595#false} is VALID [2022-04-15 09:03:21,668 INFO L290 TraceCheckUtils]: 85: Hoare triple {28595#false} assume 0 == ~cond; {28595#false} is VALID [2022-04-15 09:03:21,668 INFO L290 TraceCheckUtils]: 86: Hoare triple {28595#false} assume !false; {28595#false} is VALID [2022-04-15 09:03:21,668 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-15 09:03:21,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:03:22,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {28595#false} assume !false; {28595#false} is VALID [2022-04-15 09:03:22,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {28595#false} assume 0 == ~cond; {28595#false} is VALID [2022-04-15 09:03:22,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {28595#false} ~cond := #in~cond; {28595#false} is VALID [2022-04-15 09:03:22,081 INFO L272 TraceCheckUtils]: 83: Hoare triple {28595#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)); {28595#false} is VALID [2022-04-15 09:03:22,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {28879#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {28595#false} is VALID [2022-04-15 09:03:22,082 INFO L290 TraceCheckUtils]: 81: Hoare triple {28883#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28879#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:03:22,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {28883#(< ~counter~0 50)} assume !(~r~0 < 0); {28883#(< ~counter~0 50)} is VALID [2022-04-15 09:03:22,082 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28594#true} {28883#(< ~counter~0 50)} #98#return; {28883#(< ~counter~0 50)} is VALID [2022-04-15 09:03:22,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,083 INFO L272 TraceCheckUtils]: 75: Hoare triple {28883#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,083 INFO L290 TraceCheckUtils]: 74: Hoare triple {28883#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {28883#(< ~counter~0 50)} is VALID [2022-04-15 09:03:22,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {28908#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28883#(< ~counter~0 50)} is VALID [2022-04-15 09:03:22,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {28908#(< ~counter~0 49)} assume !(~r~0 > 0); {28908#(< ~counter~0 49)} is VALID [2022-04-15 09:03:22,084 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28594#true} {28908#(< ~counter~0 49)} #96#return; {28908#(< ~counter~0 49)} is VALID [2022-04-15 09:03:22,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,085 INFO L272 TraceCheckUtils]: 67: Hoare triple {28908#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {28908#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {28908#(< ~counter~0 49)} is VALID [2022-04-15 09:03:22,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {28933#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28908#(< ~counter~0 49)} is VALID [2022-04-15 09:03:22,085 INFO L290 TraceCheckUtils]: 64: Hoare triple {28933#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28933#(< ~counter~0 48)} is VALID [2022-04-15 09:03:22,086 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28594#true} {28933#(< ~counter~0 48)} #96#return; {28933#(< ~counter~0 48)} is VALID [2022-04-15 09:03:22,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,086 INFO L272 TraceCheckUtils]: 59: Hoare triple {28933#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {28933#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {28933#(< ~counter~0 48)} is VALID [2022-04-15 09:03:22,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {28958#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28933#(< ~counter~0 48)} is VALID [2022-04-15 09:03:22,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {28958#(< ~counter~0 47)} assume !!(0 != ~r~0); {28958#(< ~counter~0 47)} is VALID [2022-04-15 09:03:22,087 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28594#true} {28958#(< ~counter~0 47)} #94#return; {28958#(< ~counter~0 47)} is VALID [2022-04-15 09:03:22,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,088 INFO L272 TraceCheckUtils]: 51: Hoare triple {28958#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {28958#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {28958#(< ~counter~0 47)} is VALID [2022-04-15 09:03:22,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {28983#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28958#(< ~counter~0 47)} is VALID [2022-04-15 09:03:22,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {28983#(< ~counter~0 46)} assume !(~r~0 < 0); {28983#(< ~counter~0 46)} is VALID [2022-04-15 09:03:22,089 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28594#true} {28983#(< ~counter~0 46)} #98#return; {28983#(< ~counter~0 46)} is VALID [2022-04-15 09:03:22,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,089 INFO L272 TraceCheckUtils]: 43: Hoare triple {28983#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {28983#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {28983#(< ~counter~0 46)} is VALID [2022-04-15 09:03:22,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {29008#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28983#(< ~counter~0 46)} is VALID [2022-04-15 09:03:22,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {29008#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29008#(< ~counter~0 45)} is VALID [2022-04-15 09:03:22,113 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28594#true} {29008#(< ~counter~0 45)} #98#return; {29008#(< ~counter~0 45)} is VALID [2022-04-15 09:03:22,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,114 INFO L272 TraceCheckUtils]: 35: Hoare triple {29008#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {29008#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {29008#(< ~counter~0 45)} is VALID [2022-04-15 09:03:22,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {29033#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29008#(< ~counter~0 45)} is VALID [2022-04-15 09:03:22,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {29033#(< ~counter~0 44)} assume !(~r~0 > 0); {29033#(< ~counter~0 44)} is VALID [2022-04-15 09:03:22,115 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28594#true} {29033#(< ~counter~0 44)} #96#return; {29033#(< ~counter~0 44)} is VALID [2022-04-15 09:03:22,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,115 INFO L272 TraceCheckUtils]: 27: Hoare triple {29033#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {29033#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {29033#(< ~counter~0 44)} is VALID [2022-04-15 09:03:22,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {29058#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29033#(< ~counter~0 44)} is VALID [2022-04-15 09:03:22,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {29058#(< ~counter~0 43)} assume !!(0 != ~r~0); {29058#(< ~counter~0 43)} is VALID [2022-04-15 09:03:22,116 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28594#true} {29058#(< ~counter~0 43)} #94#return; {29058#(< ~counter~0 43)} is VALID [2022-04-15 09:03:22,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,117 INFO L272 TraceCheckUtils]: 19: Hoare triple {29058#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {29058#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {29058#(< ~counter~0 43)} is VALID [2022-04-15 09:03:22,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {29083#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29058#(< ~counter~0 43)} is VALID [2022-04-15 09:03:22,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {29083#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,121 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28594#true} {29083#(< ~counter~0 42)} #92#return; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,121 INFO L272 TraceCheckUtils]: 11: Hoare triple {29083#(< ~counter~0 42)} 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)); {28594#true} is VALID [2022-04-15 09:03:22,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28594#true} {29083#(< ~counter~0 42)} #90#return; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {28594#true} assume true; {28594#true} is VALID [2022-04-15 09:03:22,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {28594#true} assume !(0 == ~cond); {28594#true} is VALID [2022-04-15 09:03:22,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {28594#true} ~cond := #in~cond; {28594#true} is VALID [2022-04-15 09:03:22,122 INFO L272 TraceCheckUtils]: 6: Hoare triple {29083#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28594#true} is VALID [2022-04-15 09:03:22,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {29083#(< ~counter~0 42)} 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; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {29083#(< ~counter~0 42)} call #t~ret9 := main(); {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29083#(< ~counter~0 42)} {28594#true} #102#return; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {29083#(< ~counter~0 42)} assume true; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {28594#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; {29083#(< ~counter~0 42)} is VALID [2022-04-15 09:03:22,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {28594#true} call ULTIMATE.init(); {28594#true} is VALID [2022-04-15 09:03:22,123 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-15 09:03:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:03:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201601982] [2022-04-15 09:03:22,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:03:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937906179] [2022-04-15 09:03:22,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937906179] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:03:22,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:03:22,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 09:03:22,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:03:22,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012522827] [2022-04-15 09:03:22,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012522827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:03:22,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:03:22,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 09:03:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784596293] [2022-04-15 09:03:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:03:22,125 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-15 09:03:22,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:03:22,126 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-15 09:03:22,192 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-15 09:03:22,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 09:03:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 09:03:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:03:22,193 INFO L87 Difference]: Start difference. First operand 253 states and 319 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-15 09:03:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:22,767 INFO L93 Difference]: Finished difference Result 287 states and 361 transitions. [2022-04-15 09:03:22,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 09:03:22,767 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-15 09:03:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:03:22,767 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-15 09:03:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 09:03:22,769 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-15 09:03:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 09:03:22,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-15 09:03:22,896 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-15 09:03:22,900 INFO L225 Difference]: With dead ends: 287 [2022-04-15 09:03:22,900 INFO L226 Difference]: Without dead ends: 282 [2022-04-15 09:03:22,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-15 09:03:22,901 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 93 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:03:22,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 220 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:03:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-15 09:03:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 273. [2022-04-15 09:03:23,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:03:23,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 09:03:23,210 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 09:03:23,210 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 09:03:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:23,214 INFO L93 Difference]: Finished difference Result 282 states and 355 transitions. [2022-04-15 09:03:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 355 transitions. [2022-04-15 09:03:23,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:23,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:23,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) Second operand 282 states. [2022-04-15 09:03:23,215 INFO L87 Difference]: Start difference. First operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) Second operand 282 states. [2022-04-15 09:03:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:23,219 INFO L93 Difference]: Finished difference Result 282 states and 355 transitions. [2022-04-15 09:03:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 355 transitions. [2022-04-15 09:03:23,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:23,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:23,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:03:23,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:03:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 201 states have (on average 1.199004975124378) internal successors, (241), 208 states have internal predecessors, (241), 53 states have call successors, (53), 20 states have call predecessors, (53), 18 states have return successors, (51), 44 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-15 09:03:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 345 transitions. [2022-04-15 09:03:23,224 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 345 transitions. Word has length 87 [2022-04-15 09:03:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:03:23,224 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 345 transitions. [2022-04-15 09:03:23,224 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-15 09:03:23,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 345 transitions. [2022-04-15 09:03:35,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 342 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:03:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 345 transitions. [2022-04-15 09:03:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 09:03:35,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:03:35,455 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-15 09:03:35,471 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-15 09:03:35,655 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-15 09:03:35,655 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:03:35,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:03:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-15 09:03:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:35,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715197602] [2022-04-15 09:03:35,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:03:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-15 09:03:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:03:35,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895317815] [2022-04-15 09:03:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:03:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:03:35,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:03:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683296101] [2022-04-15 09:03:35,666 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:03:35,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:03:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:03:35,674 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-15 09:03:35,675 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-15 09:03:35,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:03:35,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:03:35,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 09:03:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:03:35,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:03:35,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {30831#true} call ULTIMATE.init(); {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {30831#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; {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30831#true} {30831#true} #102#return; {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {30831#true} call #t~ret9 := main(); {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {30831#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; {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {30831#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30831#true} {30831#true} #90#return; {30831#true} is VALID [2022-04-15 09:03:35,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {30831#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)); {30831#true} is VALID [2022-04-15 09:03:35,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,913 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30831#true} {30831#true} #92#return; {30831#true} is VALID [2022-04-15 09:03:35,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {30831#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,914 INFO L272 TraceCheckUtils]: 19: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:35,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,914 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,915 INFO L272 TraceCheckUtils]: 27: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:35,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,916 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 > 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,917 INFO L272 TraceCheckUtils]: 35: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:35,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,917 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,918 INFO L272 TraceCheckUtils]: 43: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:35,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,918 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 < 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,919 INFO L272 TraceCheckUtils]: 51: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:35,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,920 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,921 INFO L272 TraceCheckUtils]: 59: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:35,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,921 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:35,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,922 INFO L272 TraceCheckUtils]: 67: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 09:03:35,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,923 INFO L290 TraceCheckUtils]: 70: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,923 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #96#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,923 INFO L290 TraceCheckUtils]: 72: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,923 INFO L290 TraceCheckUtils]: 73: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,924 INFO L290 TraceCheckUtils]: 74: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,924 INFO L272 TraceCheckUtils]: 75: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 09:03:35,924 INFO L290 TraceCheckUtils]: 76: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:35,924 INFO L290 TraceCheckUtils]: 77: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:35,924 INFO L290 TraceCheckUtils]: 78: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:35,924 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #98#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:35,925 INFO L290 TraceCheckUtils]: 80: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30832#false} is VALID [2022-04-15 09:03:35,925 INFO L290 TraceCheckUtils]: 81: Hoare triple {30832#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30832#false} is VALID [2022-04-15 09:03:35,925 INFO L290 TraceCheckUtils]: 82: Hoare triple {30832#false} assume !(#t~post8 < 50);havoc #t~post8; {30832#false} is VALID [2022-04-15 09:03:35,925 INFO L290 TraceCheckUtils]: 83: Hoare triple {30832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30832#false} is VALID [2022-04-15 09:03:35,925 INFO L290 TraceCheckUtils]: 84: Hoare triple {30832#false} assume !(#t~post6 < 50);havoc #t~post6; {30832#false} is VALID [2022-04-15 09:03:35,926 INFO L272 TraceCheckUtils]: 85: Hoare triple {30832#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)); {30832#false} is VALID [2022-04-15 09:03:35,926 INFO L290 TraceCheckUtils]: 86: Hoare triple {30832#false} ~cond := #in~cond; {30832#false} is VALID [2022-04-15 09:03:35,926 INFO L290 TraceCheckUtils]: 87: Hoare triple {30832#false} assume 0 == ~cond; {30832#false} is VALID [2022-04-15 09:03:35,926 INFO L290 TraceCheckUtils]: 88: Hoare triple {30832#false} assume !false; {30832#false} is VALID [2022-04-15 09:03:35,926 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-15 09:03:35,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:03:36,130 INFO L290 TraceCheckUtils]: 88: Hoare triple {30832#false} assume !false; {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L290 TraceCheckUtils]: 87: Hoare triple {30832#false} assume 0 == ~cond; {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L290 TraceCheckUtils]: 86: Hoare triple {30832#false} ~cond := #in~cond; {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L272 TraceCheckUtils]: 85: Hoare triple {30832#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)); {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L290 TraceCheckUtils]: 84: Hoare triple {30832#false} assume !(#t~post6 < 50);havoc #t~post6; {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L290 TraceCheckUtils]: 83: Hoare triple {30832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L290 TraceCheckUtils]: 82: Hoare triple {30832#false} assume !(#t~post8 < 50);havoc #t~post8; {30832#false} is VALID [2022-04-15 09:03:36,131 INFO L290 TraceCheckUtils]: 81: Hoare triple {30832#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30832#false} is VALID [2022-04-15 09:03:36,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30832#false} is VALID [2022-04-15 09:03:36,132 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #98#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,133 INFO L290 TraceCheckUtils]: 76: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,133 INFO L272 TraceCheckUtils]: 75: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 09:03:36,133 INFO L290 TraceCheckUtils]: 74: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 50);havoc #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,133 INFO L290 TraceCheckUtils]: 73: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,133 INFO L290 TraceCheckUtils]: 72: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,134 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {30831#true} {31029#(< 0 (+ main_~r~0 1))} #96#return; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,134 INFO L290 TraceCheckUtils]: 70: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,134 INFO L272 TraceCheckUtils]: 67: Hoare triple {31029#(< 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)); {30831#true} is VALID [2022-04-15 09:03:36,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {31029#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 50);havoc #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {31029#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,135 INFO L290 TraceCheckUtils]: 64: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31029#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 09:03:36,135 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,135 INFO L290 TraceCheckUtils]: 62: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,136 INFO L272 TraceCheckUtils]: 59: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:36,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,146 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,146 INFO L272 TraceCheckUtils]: 51: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:36,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 < 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,147 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,148 INFO L290 TraceCheckUtils]: 44: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,148 INFO L272 TraceCheckUtils]: 43: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:36,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {30884#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,149 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #98#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,149 INFO L290 TraceCheckUtils]: 38: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,149 INFO L290 TraceCheckUtils]: 36: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,149 INFO L272 TraceCheckUtils]: 35: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:36,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post8 < 50);havoc #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {30884#(<= main_~v~0 1)} assume !(~r~0 > 0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,151 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #96#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,151 INFO L272 TraceCheckUtils]: 27: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:36,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post7 < 50);havoc #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {30884#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {30884#(<= main_~v~0 1)} assume !!(0 != ~r~0); {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,153 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {30831#true} {30884#(<= main_~v~0 1)} #94#return; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,153 INFO L272 TraceCheckUtils]: 19: Hoare triple {30884#(<= 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)); {30831#true} is VALID [2022-04-15 09:03:36,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {30884#(<= main_~v~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {30884#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {30831#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30884#(<= main_~v~0 1)} is VALID [2022-04-15 09:03:36,154 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30831#true} {30831#true} #92#return; {30831#true} is VALID [2022-04-15 09:03:36,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,154 INFO L272 TraceCheckUtils]: 11: Hoare triple {30831#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)); {30831#true} is VALID [2022-04-15 09:03:36,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30831#true} {30831#true} #90#return; {30831#true} is VALID [2022-04-15 09:03:36,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {30831#true} assume !(0 == ~cond); {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {30831#true} ~cond := #in~cond; {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {30831#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {30831#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; {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {30831#true} call #t~ret9 := main(); {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30831#true} {30831#true} #102#return; {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {30831#true} assume true; {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {30831#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; {30831#true} is VALID [2022-04-15 09:03:36,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {30831#true} call ULTIMATE.init(); {30831#true} is VALID [2022-04-15 09:03:36,155 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-15 09:03:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:03:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895317815] [2022-04-15 09:03:36,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:03:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683296101] [2022-04-15 09:03:36,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683296101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:03:36,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:03:36,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-15 09:03:36,156 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:03:36,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715197602] [2022-04-15 09:03:36,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715197602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:03:36,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:03:36,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:03:36,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646454908] [2022-04-15 09:03:36,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:03:36,157 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-15 09:03:36,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:03:36,157 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-15 09:03:36,196 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-15 09:03:36,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:03:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:36,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:03:36,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:03:36,197 INFO L87 Difference]: Start difference. First operand 273 states and 345 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-15 09:03:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:36,774 INFO L93 Difference]: Finished difference Result 435 states and 564 transitions. [2022-04-15 09:03:36,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:03:36,774 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-15 09:03:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:03:36,774 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-15 09:03:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 09:03:36,775 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-15 09:03:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 09:03:36,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-15 09:03:36,884 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-15 09:03:36,890 INFO L225 Difference]: With dead ends: 435 [2022-04-15 09:03:36,890 INFO L226 Difference]: Without dead ends: 329 [2022-04-15 09:03:36,890 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-15 09:03:36,890 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 145 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-15 09:03:36,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 145 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:03:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-15 09:03:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 324. [2022-04-15 09:03:37,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:03:37,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 09:03:37,369 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 09:03:37,369 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 09:03:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:37,374 INFO L93 Difference]: Finished difference Result 329 states and 422 transitions. [2022-04-15 09:03:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 422 transitions. [2022-04-15 09:03:37,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:37,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:37,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 329 states. [2022-04-15 09:03:37,375 INFO L87 Difference]: Start difference. First operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 329 states. [2022-04-15 09:03:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:37,380 INFO L93 Difference]: Finished difference Result 329 states and 422 transitions. [2022-04-15 09:03:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 422 transitions. [2022-04-15 09:03:37,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:37,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:37,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:03:37,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:03:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 240 states have (on average 1.2) internal successors, (288), 246 states have internal predecessors, (288), 65 states have call successors, (65), 20 states have call predecessors, (65), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 09:03:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 416 transitions. [2022-04-15 09:03:37,387 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 416 transitions. Word has length 89 [2022-04-15 09:03:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:03:37,387 INFO L478 AbstractCegarLoop]: Abstraction has 324 states and 416 transitions. [2022-04-15 09:03:37,387 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-15 09:03:37,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 324 states and 416 transitions. [2022-04-15 09:03:47,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 413 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:03:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 416 transitions. [2022-04-15 09:03:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 09:03:47,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:03:47,854 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-15 09:03:47,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 09:03:48,054 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-15 09:03:48,055 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:03:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:03:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-15 09:03:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:48,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589175802] [2022-04-15 09:03:48,056 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:03:48,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-15 09:03:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:03:48,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865608161] [2022-04-15 09:03:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:03:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:03:48,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:03:48,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508436711] [2022-04-15 09:03:48,067 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:03:48,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:03:48,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:03:48,068 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-15 09:03:48,069 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-15 09:03:48,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 09:03:48,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:03:48,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 09:03:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:03:48,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:03:48,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {33546#true} call ULTIMATE.init(); {33546#true} is VALID [2022-04-15 09:03:48,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {33546#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; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {33554#(<= ~counter~0 0)} assume true; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33554#(<= ~counter~0 0)} {33546#true} #102#return; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {33554#(<= ~counter~0 0)} call #t~ret9 := main(); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {33554#(<= ~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; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {33554#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {33554#(<= ~counter~0 0)} ~cond := #in~cond; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {33554#(<= ~counter~0 0)} assume !(0 == ~cond); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {33554#(<= ~counter~0 0)} assume true; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,666 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33554#(<= ~counter~0 0)} {33554#(<= ~counter~0 0)} #90#return; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,666 INFO L272 TraceCheckUtils]: 11: Hoare triple {33554#(<= ~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)); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {33554#(<= ~counter~0 0)} ~cond := #in~cond; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {33554#(<= ~counter~0 0)} assume !(0 == ~cond); {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {33554#(<= ~counter~0 0)} assume true; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,668 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33554#(<= ~counter~0 0)} {33554#(<= ~counter~0 0)} #92#return; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {33554#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {33554#(<= ~counter~0 0)} is VALID [2022-04-15 09:03:48,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {33554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {33603#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,670 INFO L272 TraceCheckUtils]: 19: Hoare triple {33603#(<= ~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)); {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {33603#(<= ~counter~0 1)} ~cond := #in~cond; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {33603#(<= ~counter~0 1)} assume !(0 == ~cond); {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {33603#(<= ~counter~0 1)} assume true; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,671 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33603#(<= ~counter~0 1)} {33603#(<= ~counter~0 1)} #94#return; {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {33603#(<= ~counter~0 1)} assume !!(0 != ~r~0); {33603#(<= ~counter~0 1)} is VALID [2022-04-15 09:03:48,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {33603#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {33628#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,673 INFO L272 TraceCheckUtils]: 27: Hoare triple {33628#(<= ~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)); {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {33628#(<= ~counter~0 2)} ~cond := #in~cond; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {33628#(<= ~counter~0 2)} assume !(0 == ~cond); {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {33628#(<= ~counter~0 2)} assume true; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,674 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33628#(<= ~counter~0 2)} {33628#(<= ~counter~0 2)} #96#return; {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {33628#(<= ~counter~0 2)} assume !(~r~0 > 0); {33628#(<= ~counter~0 2)} is VALID [2022-04-15 09:03:48,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {33628#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,675 INFO L290 TraceCheckUtils]: 34: Hoare triple {33653#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,675 INFO L272 TraceCheckUtils]: 35: Hoare triple {33653#(<= ~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)); {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {33653#(<= ~counter~0 3)} ~cond := #in~cond; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {33653#(<= ~counter~0 3)} assume !(0 == ~cond); {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {33653#(<= ~counter~0 3)} assume true; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,677 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33653#(<= ~counter~0 3)} {33653#(<= ~counter~0 3)} #98#return; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {33653#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {33653#(<= ~counter~0 3)} is VALID [2022-04-15 09:03:48,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {33653#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {33678#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {33678#(<= ~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)); {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {33678#(<= ~counter~0 4)} ~cond := #in~cond; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {33678#(<= ~counter~0 4)} assume !(0 == ~cond); {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,679 INFO L290 TraceCheckUtils]: 46: Hoare triple {33678#(<= ~counter~0 4)} assume true; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,680 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33678#(<= ~counter~0 4)} {33678#(<= ~counter~0 4)} #98#return; {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {33678#(<= ~counter~0 4)} assume !(~r~0 < 0); {33678#(<= ~counter~0 4)} is VALID [2022-04-15 09:03:48,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {33678#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {33703#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,681 INFO L272 TraceCheckUtils]: 51: Hoare triple {33703#(<= ~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)); {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {33703#(<= ~counter~0 5)} ~cond := #in~cond; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,682 INFO L290 TraceCheckUtils]: 53: Hoare triple {33703#(<= ~counter~0 5)} assume !(0 == ~cond); {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,682 INFO L290 TraceCheckUtils]: 54: Hoare triple {33703#(<= ~counter~0 5)} assume true; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,683 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33703#(<= ~counter~0 5)} {33703#(<= ~counter~0 5)} #94#return; {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,683 INFO L290 TraceCheckUtils]: 56: Hoare triple {33703#(<= ~counter~0 5)} assume !!(0 != ~r~0); {33703#(<= ~counter~0 5)} is VALID [2022-04-15 09:03:48,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {33703#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,684 INFO L290 TraceCheckUtils]: 58: Hoare triple {33728#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,684 INFO L272 TraceCheckUtils]: 59: Hoare triple {33728#(<= ~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)); {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,684 INFO L290 TraceCheckUtils]: 60: Hoare triple {33728#(<= ~counter~0 6)} ~cond := #in~cond; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {33728#(<= ~counter~0 6)} assume !(0 == ~cond); {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {33728#(<= ~counter~0 6)} assume true; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,685 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33728#(<= ~counter~0 6)} {33728#(<= ~counter~0 6)} #96#return; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {33728#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33728#(<= ~counter~0 6)} is VALID [2022-04-15 09:03:48,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {33728#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {33753#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,687 INFO L272 TraceCheckUtils]: 67: Hoare triple {33753#(<= ~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)); {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {33753#(<= ~counter~0 7)} ~cond := #in~cond; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,688 INFO L290 TraceCheckUtils]: 69: Hoare triple {33753#(<= ~counter~0 7)} assume !(0 == ~cond); {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,688 INFO L290 TraceCheckUtils]: 70: Hoare triple {33753#(<= ~counter~0 7)} assume true; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,688 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33753#(<= ~counter~0 7)} {33753#(<= ~counter~0 7)} #96#return; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,689 INFO L290 TraceCheckUtils]: 72: Hoare triple {33753#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33753#(<= ~counter~0 7)} is VALID [2022-04-15 09:03:48,689 INFO L290 TraceCheckUtils]: 73: Hoare triple {33753#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,690 INFO L290 TraceCheckUtils]: 74: Hoare triple {33778#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,690 INFO L272 TraceCheckUtils]: 75: Hoare triple {33778#(<= ~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)); {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,690 INFO L290 TraceCheckUtils]: 76: Hoare triple {33778#(<= ~counter~0 8)} ~cond := #in~cond; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,691 INFO L290 TraceCheckUtils]: 77: Hoare triple {33778#(<= ~counter~0 8)} assume !(0 == ~cond); {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,691 INFO L290 TraceCheckUtils]: 78: Hoare triple {33778#(<= ~counter~0 8)} assume true; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,691 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33778#(<= ~counter~0 8)} {33778#(<= ~counter~0 8)} #96#return; {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {33778#(<= ~counter~0 8)} assume !(~r~0 > 0); {33778#(<= ~counter~0 8)} is VALID [2022-04-15 09:03:48,692 INFO L290 TraceCheckUtils]: 81: Hoare triple {33778#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33803#(<= ~counter~0 9)} is VALID [2022-04-15 09:03:48,692 INFO L290 TraceCheckUtils]: 82: Hoare triple {33803#(<= ~counter~0 9)} assume !(#t~post8 < 50);havoc #t~post8; {33803#(<= ~counter~0 9)} is VALID [2022-04-15 09:03:48,693 INFO L290 TraceCheckUtils]: 83: Hoare triple {33803#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33810#(<= |main_#t~post6| 9)} is VALID [2022-04-15 09:03:48,693 INFO L290 TraceCheckUtils]: 84: Hoare triple {33810#(<= |main_#t~post6| 9)} assume !(#t~post6 < 50);havoc #t~post6; {33547#false} is VALID [2022-04-15 09:03:48,693 INFO L272 TraceCheckUtils]: 85: Hoare triple {33547#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)); {33547#false} is VALID [2022-04-15 09:03:48,693 INFO L290 TraceCheckUtils]: 86: Hoare triple {33547#false} ~cond := #in~cond; {33547#false} is VALID [2022-04-15 09:03:48,693 INFO L290 TraceCheckUtils]: 87: Hoare triple {33547#false} assume 0 == ~cond; {33547#false} is VALID [2022-04-15 09:03:48,693 INFO L290 TraceCheckUtils]: 88: Hoare triple {33547#false} assume !false; {33547#false} is VALID [2022-04-15 09:03:48,694 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-15 09:03:48,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:03:49,191 INFO L290 TraceCheckUtils]: 88: Hoare triple {33547#false} assume !false; {33547#false} is VALID [2022-04-15 09:03:49,192 INFO L290 TraceCheckUtils]: 87: Hoare triple {33547#false} assume 0 == ~cond; {33547#false} is VALID [2022-04-15 09:03:49,192 INFO L290 TraceCheckUtils]: 86: Hoare triple {33547#false} ~cond := #in~cond; {33547#false} is VALID [2022-04-15 09:03:49,192 INFO L272 TraceCheckUtils]: 85: Hoare triple {33547#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)); {33547#false} is VALID [2022-04-15 09:03:49,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {33838#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {33547#false} is VALID [2022-04-15 09:03:49,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {33842#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33838#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:03:49,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {33842#(< ~counter~0 50)} assume !(#t~post8 < 50);havoc #t~post8; {33842#(< ~counter~0 50)} is VALID [2022-04-15 09:03:49,193 INFO L290 TraceCheckUtils]: 81: Hoare triple {33849#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33842#(< ~counter~0 50)} is VALID [2022-04-15 09:03:49,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {33849#(< ~counter~0 49)} assume !(~r~0 > 0); {33849#(< ~counter~0 49)} is VALID [2022-04-15 09:03:49,194 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {33546#true} {33849#(< ~counter~0 49)} #96#return; {33849#(< ~counter~0 49)} is VALID [2022-04-15 09:03:49,194 INFO L290 TraceCheckUtils]: 78: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,194 INFO L290 TraceCheckUtils]: 77: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,195 INFO L290 TraceCheckUtils]: 76: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,195 INFO L272 TraceCheckUtils]: 75: Hoare triple {33849#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {33849#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {33849#(< ~counter~0 49)} is VALID [2022-04-15 09:03:49,195 INFO L290 TraceCheckUtils]: 73: Hoare triple {33874#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33849#(< ~counter~0 49)} is VALID [2022-04-15 09:03:49,196 INFO L290 TraceCheckUtils]: 72: Hoare triple {33874#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33874#(< ~counter~0 48)} is VALID [2022-04-15 09:03:49,196 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {33546#true} {33874#(< ~counter~0 48)} #96#return; {33874#(< ~counter~0 48)} is VALID [2022-04-15 09:03:49,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,196 INFO L272 TraceCheckUtils]: 67: Hoare triple {33874#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,197 INFO L290 TraceCheckUtils]: 66: Hoare triple {33874#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {33874#(< ~counter~0 48)} is VALID [2022-04-15 09:03:49,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {33899#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33874#(< ~counter~0 48)} is VALID [2022-04-15 09:03:49,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {33899#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {33899#(< ~counter~0 47)} is VALID [2022-04-15 09:03:49,198 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33546#true} {33899#(< ~counter~0 47)} #96#return; {33899#(< ~counter~0 47)} is VALID [2022-04-15 09:03:49,198 INFO L290 TraceCheckUtils]: 62: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,198 INFO L290 TraceCheckUtils]: 61: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,198 INFO L272 TraceCheckUtils]: 59: Hoare triple {33899#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {33899#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {33899#(< ~counter~0 47)} is VALID [2022-04-15 09:03:49,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {33924#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33899#(< ~counter~0 47)} is VALID [2022-04-15 09:03:49,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {33924#(< ~counter~0 46)} assume !!(0 != ~r~0); {33924#(< ~counter~0 46)} is VALID [2022-04-15 09:03:49,200 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {33546#true} {33924#(< ~counter~0 46)} #94#return; {33924#(< ~counter~0 46)} is VALID [2022-04-15 09:03:49,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,200 INFO L290 TraceCheckUtils]: 53: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,200 INFO L272 TraceCheckUtils]: 51: Hoare triple {33924#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {33924#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {33924#(< ~counter~0 46)} is VALID [2022-04-15 09:03:49,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {33949#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33924#(< ~counter~0 46)} is VALID [2022-04-15 09:03:49,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {33949#(< ~counter~0 45)} assume !(~r~0 < 0); {33949#(< ~counter~0 45)} is VALID [2022-04-15 09:03:49,202 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {33546#true} {33949#(< ~counter~0 45)} #98#return; {33949#(< ~counter~0 45)} is VALID [2022-04-15 09:03:49,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,202 INFO L272 TraceCheckUtils]: 43: Hoare triple {33949#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {33949#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {33949#(< ~counter~0 45)} is VALID [2022-04-15 09:03:49,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {33974#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33949#(< ~counter~0 45)} is VALID [2022-04-15 09:03:49,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {33974#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {33974#(< ~counter~0 44)} is VALID [2022-04-15 09:03:49,204 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {33546#true} {33974#(< ~counter~0 44)} #98#return; {33974#(< ~counter~0 44)} is VALID [2022-04-15 09:03:49,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,204 INFO L272 TraceCheckUtils]: 35: Hoare triple {33974#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {33974#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {33974#(< ~counter~0 44)} is VALID [2022-04-15 09:03:49,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {33999#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {33974#(< ~counter~0 44)} is VALID [2022-04-15 09:03:49,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {33999#(< ~counter~0 43)} assume !(~r~0 > 0); {33999#(< ~counter~0 43)} is VALID [2022-04-15 09:03:49,205 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {33546#true} {33999#(< ~counter~0 43)} #96#return; {33999#(< ~counter~0 43)} is VALID [2022-04-15 09:03:49,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,206 INFO L272 TraceCheckUtils]: 27: Hoare triple {33999#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {33999#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {33999#(< ~counter~0 43)} is VALID [2022-04-15 09:03:49,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {34024#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33999#(< ~counter~0 43)} is VALID [2022-04-15 09:03:49,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {34024#(< ~counter~0 42)} assume !!(0 != ~r~0); {34024#(< ~counter~0 42)} is VALID [2022-04-15 09:03:49,207 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33546#true} {34024#(< ~counter~0 42)} #94#return; {34024#(< ~counter~0 42)} is VALID [2022-04-15 09:03:49,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,208 INFO L272 TraceCheckUtils]: 19: Hoare triple {34024#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {34024#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {34024#(< ~counter~0 42)} is VALID [2022-04-15 09:03:49,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {34049#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34024#(< ~counter~0 42)} is VALID [2022-04-15 09:03:49,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {34049#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,209 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33546#true} {34049#(< ~counter~0 41)} #92#return; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,209 INFO L272 TraceCheckUtils]: 11: Hoare triple {34049#(< ~counter~0 41)} 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)); {33546#true} is VALID [2022-04-15 09:03:49,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33546#true} {34049#(< ~counter~0 41)} #90#return; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {33546#true} assume true; {33546#true} is VALID [2022-04-15 09:03:49,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {33546#true} assume !(0 == ~cond); {33546#true} is VALID [2022-04-15 09:03:49,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {33546#true} ~cond := #in~cond; {33546#true} is VALID [2022-04-15 09:03:49,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {34049#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33546#true} is VALID [2022-04-15 09:03:49,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {34049#(< ~counter~0 41)} 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; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {34049#(< ~counter~0 41)} call #t~ret9 := main(); {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34049#(< ~counter~0 41)} {33546#true} #102#return; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {34049#(< ~counter~0 41)} assume true; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {33546#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; {34049#(< ~counter~0 41)} is VALID [2022-04-15 09:03:49,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {33546#true} call ULTIMATE.init(); {33546#true} is VALID [2022-04-15 09:03:49,212 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-15 09:03:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:03:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865608161] [2022-04-15 09:03:49,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:03:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508436711] [2022-04-15 09:03:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508436711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:03:49,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:03:49,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 09:03:49,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:03:49,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589175802] [2022-04-15 09:03:49,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589175802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:03:49,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:03:49,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 09:03:49,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76036689] [2022-04-15 09:03:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:03:49,213 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-15 09:03:49,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:03:49,214 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-15 09:03:49,273 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-15 09:03:49,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 09:03:49,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:03:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 09:03:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:03:49,274 INFO L87 Difference]: Start difference. First operand 324 states and 416 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-15 09:03:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:50,426 INFO L93 Difference]: Finished difference Result 394 states and 510 transitions. [2022-04-15 09:03:50,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 09:03:50,426 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-15 09:03:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:03:50,427 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-15 09:03:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 09:03:50,428 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-15 09:03:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 09:03:50,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 09:03:50,568 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-15 09:03:50,576 INFO L225 Difference]: With dead ends: 394 [2022-04-15 09:03:50,576 INFO L226 Difference]: Without dead ends: 389 [2022-04-15 09:03:50,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-15 09:03:50,577 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 201 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:03:50,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 219 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:03:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-15 09:03:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 374. [2022-04-15 09:03:50,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:03:50,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:03:50,988 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:03:51,015 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:03:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:51,022 INFO L93 Difference]: Finished difference Result 389 states and 501 transitions. [2022-04-15 09:03:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2022-04-15 09:03:51,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:51,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:51,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 389 states. [2022-04-15 09:03:51,024 INFO L87 Difference]: Start difference. First operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 389 states. [2022-04-15 09:03:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:03:51,030 INFO L93 Difference]: Finished difference Result 389 states and 501 transitions. [2022-04-15 09:03:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2022-04-15 09:03:51,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:03:51,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:03:51,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:03:51,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:03:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 279 states have (on average 1.2114695340501793) internal successors, (338), 285 states have internal predecessors, (338), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:03:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 484 transitions. [2022-04-15 09:03:51,039 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 484 transitions. Word has length 89 [2022-04-15 09:03:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:03:51,039 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 484 transitions. [2022-04-15 09:03:51,039 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-15 09:03:51,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 484 transitions. [2022-04-15 09:04:02,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 482 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:04:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 484 transitions. [2022-04-15 09:04:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 09:04:02,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:04:02,341 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-15 09:04:02,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-15 09:04:02,542 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-15 09:04:02,542 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:04:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:04:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-15 09:04:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:02,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [451109984] [2022-04-15 09:04:02,543 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:04:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-15 09:04:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:04:02,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13768687] [2022-04-15 09:04:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:04:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:04:02,553 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:04:02,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455376246] [2022-04-15 09:04:02,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:04:02,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:04:02,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:04:02,554 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-15 09:04:02,555 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-15 09:04:02,696 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 09:04:02,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:04:02,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 09:04:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:04:02,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:04:03,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {36429#true} call ULTIMATE.init(); {36429#true} is VALID [2022-04-15 09:04:03,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {36429#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; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {36437#(<= ~counter~0 0)} assume true; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36437#(<= ~counter~0 0)} {36429#true} #102#return; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {36437#(<= ~counter~0 0)} call #t~ret9 := main(); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {36437#(<= ~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; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {36437#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {36437#(<= ~counter~0 0)} ~cond := #in~cond; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {36437#(<= ~counter~0 0)} assume !(0 == ~cond); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {36437#(<= ~counter~0 0)} assume true; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,136 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36437#(<= ~counter~0 0)} {36437#(<= ~counter~0 0)} #90#return; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,137 INFO L272 TraceCheckUtils]: 11: Hoare triple {36437#(<= ~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)); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {36437#(<= ~counter~0 0)} ~cond := #in~cond; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {36437#(<= ~counter~0 0)} assume !(0 == ~cond); {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {36437#(<= ~counter~0 0)} assume true; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36437#(<= ~counter~0 0)} {36437#(<= ~counter~0 0)} #92#return; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {36437#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36437#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:03,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {36437#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {36486#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {36486#(<= ~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)); {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {36486#(<= ~counter~0 1)} ~cond := #in~cond; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {36486#(<= ~counter~0 1)} assume !(0 == ~cond); {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {36486#(<= ~counter~0 1)} assume true; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,141 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {36486#(<= ~counter~0 1)} {36486#(<= ~counter~0 1)} #94#return; {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {36486#(<= ~counter~0 1)} assume !!(0 != ~r~0); {36486#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:03,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {36486#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {36511#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,143 INFO L272 TraceCheckUtils]: 27: Hoare triple {36511#(<= ~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)); {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {36511#(<= ~counter~0 2)} ~cond := #in~cond; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {36511#(<= ~counter~0 2)} assume !(0 == ~cond); {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {36511#(<= ~counter~0 2)} assume true; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,144 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36511#(<= ~counter~0 2)} {36511#(<= ~counter~0 2)} #96#return; {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {36511#(<= ~counter~0 2)} assume !(~r~0 > 0); {36511#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:03,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {36511#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {36536#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,145 INFO L272 TraceCheckUtils]: 35: Hoare triple {36536#(<= ~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)); {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {36536#(<= ~counter~0 3)} ~cond := #in~cond; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {36536#(<= ~counter~0 3)} assume !(0 == ~cond); {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {36536#(<= ~counter~0 3)} assume true; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,147 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36536#(<= ~counter~0 3)} {36536#(<= ~counter~0 3)} #98#return; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {36536#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {36536#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:03,148 INFO L290 TraceCheckUtils]: 41: Hoare triple {36536#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,148 INFO L290 TraceCheckUtils]: 42: Hoare triple {36561#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,148 INFO L272 TraceCheckUtils]: 43: Hoare triple {36561#(<= ~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)); {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,149 INFO L290 TraceCheckUtils]: 44: Hoare triple {36561#(<= ~counter~0 4)} ~cond := #in~cond; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,149 INFO L290 TraceCheckUtils]: 45: Hoare triple {36561#(<= ~counter~0 4)} assume !(0 == ~cond); {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,149 INFO L290 TraceCheckUtils]: 46: Hoare triple {36561#(<= ~counter~0 4)} assume true; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,150 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36561#(<= ~counter~0 4)} {36561#(<= ~counter~0 4)} #98#return; {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,150 INFO L290 TraceCheckUtils]: 48: Hoare triple {36561#(<= ~counter~0 4)} assume !(~r~0 < 0); {36561#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:03,150 INFO L290 TraceCheckUtils]: 49: Hoare triple {36561#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {36586#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,151 INFO L272 TraceCheckUtils]: 51: Hoare triple {36586#(<= ~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)); {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,151 INFO L290 TraceCheckUtils]: 52: Hoare triple {36586#(<= ~counter~0 5)} ~cond := #in~cond; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {36586#(<= ~counter~0 5)} assume !(0 == ~cond); {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {36586#(<= ~counter~0 5)} assume true; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,152 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {36586#(<= ~counter~0 5)} {36586#(<= ~counter~0 5)} #94#return; {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {36586#(<= ~counter~0 5)} assume !!(0 != ~r~0); {36586#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:03,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {36586#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {36611#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,154 INFO L272 TraceCheckUtils]: 59: Hoare triple {36611#(<= ~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)); {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {36611#(<= ~counter~0 6)} ~cond := #in~cond; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {36611#(<= ~counter~0 6)} assume !(0 == ~cond); {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {36611#(<= ~counter~0 6)} assume true; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,155 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36611#(<= ~counter~0 6)} {36611#(<= ~counter~0 6)} #96#return; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {36611#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36611#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:03,156 INFO L290 TraceCheckUtils]: 65: Hoare triple {36611#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {36636#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,157 INFO L272 TraceCheckUtils]: 67: Hoare triple {36636#(<= ~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)); {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,157 INFO L290 TraceCheckUtils]: 68: Hoare triple {36636#(<= ~counter~0 7)} ~cond := #in~cond; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,157 INFO L290 TraceCheckUtils]: 69: Hoare triple {36636#(<= ~counter~0 7)} assume !(0 == ~cond); {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {36636#(<= ~counter~0 7)} assume true; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,158 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {36636#(<= ~counter~0 7)} {36636#(<= ~counter~0 7)} #96#return; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,159 INFO L290 TraceCheckUtils]: 72: Hoare triple {36636#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36636#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:03,159 INFO L290 TraceCheckUtils]: 73: Hoare triple {36636#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,159 INFO L290 TraceCheckUtils]: 74: Hoare triple {36661#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,160 INFO L272 TraceCheckUtils]: 75: Hoare triple {36661#(<= ~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)); {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,160 INFO L290 TraceCheckUtils]: 76: Hoare triple {36661#(<= ~counter~0 8)} ~cond := #in~cond; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,160 INFO L290 TraceCheckUtils]: 77: Hoare triple {36661#(<= ~counter~0 8)} assume !(0 == ~cond); {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,161 INFO L290 TraceCheckUtils]: 78: Hoare triple {36661#(<= ~counter~0 8)} assume true; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,161 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {36661#(<= ~counter~0 8)} {36661#(<= ~counter~0 8)} #96#return; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,161 INFO L290 TraceCheckUtils]: 80: Hoare triple {36661#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36661#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:03,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {36661#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36686#(<= |main_#t~post7| 8)} is VALID [2022-04-15 09:04:03,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {36686#(<= |main_#t~post7| 8)} assume !(#t~post7 < 50);havoc #t~post7; {36430#false} is VALID [2022-04-15 09:04:03,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {36430#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36430#false} is VALID [2022-04-15 09:04:03,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {36430#false} assume !(#t~post8 < 50);havoc #t~post8; {36430#false} is VALID [2022-04-15 09:04:03,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {36430#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36430#false} is VALID [2022-04-15 09:04:03,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {36430#false} assume !(#t~post6 < 50);havoc #t~post6; {36430#false} is VALID [2022-04-15 09:04:03,162 INFO L272 TraceCheckUtils]: 87: Hoare triple {36430#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)); {36430#false} is VALID [2022-04-15 09:04:03,163 INFO L290 TraceCheckUtils]: 88: Hoare triple {36430#false} ~cond := #in~cond; {36430#false} is VALID [2022-04-15 09:04:03,163 INFO L290 TraceCheckUtils]: 89: Hoare triple {36430#false} assume 0 == ~cond; {36430#false} is VALID [2022-04-15 09:04:03,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {36430#false} assume !false; {36430#false} is VALID [2022-04-15 09:04:03,163 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-15 09:04:03,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 90: Hoare triple {36430#false} assume !false; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 89: Hoare triple {36430#false} assume 0 == ~cond; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 88: Hoare triple {36430#false} ~cond := #in~cond; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L272 TraceCheckUtils]: 87: Hoare triple {36430#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)); {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 86: Hoare triple {36430#false} assume !(#t~post6 < 50);havoc #t~post6; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 85: Hoare triple {36430#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 84: Hoare triple {36430#false} assume !(#t~post8 < 50);havoc #t~post8; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 83: Hoare triple {36430#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36430#false} is VALID [2022-04-15 09:04:03,617 INFO L290 TraceCheckUtils]: 82: Hoare triple {36738#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {36430#false} is VALID [2022-04-15 09:04:03,618 INFO L290 TraceCheckUtils]: 81: Hoare triple {36742#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36738#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:04:03,618 INFO L290 TraceCheckUtils]: 80: Hoare triple {36742#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36742#(< ~counter~0 50)} is VALID [2022-04-15 09:04:03,619 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {36429#true} {36742#(< ~counter~0 50)} #96#return; {36742#(< ~counter~0 50)} is VALID [2022-04-15 09:04:03,619 INFO L290 TraceCheckUtils]: 78: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,619 INFO L290 TraceCheckUtils]: 77: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,619 INFO L290 TraceCheckUtils]: 76: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,619 INFO L272 TraceCheckUtils]: 75: Hoare triple {36742#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,619 INFO L290 TraceCheckUtils]: 74: Hoare triple {36742#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {36742#(< ~counter~0 50)} is VALID [2022-04-15 09:04:03,620 INFO L290 TraceCheckUtils]: 73: Hoare triple {36767#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36742#(< ~counter~0 50)} is VALID [2022-04-15 09:04:03,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {36767#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36767#(< ~counter~0 49)} is VALID [2022-04-15 09:04:03,621 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {36429#true} {36767#(< ~counter~0 49)} #96#return; {36767#(< ~counter~0 49)} is VALID [2022-04-15 09:04:03,621 INFO L290 TraceCheckUtils]: 70: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,621 INFO L290 TraceCheckUtils]: 69: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,621 INFO L272 TraceCheckUtils]: 67: Hoare triple {36767#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {36767#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {36767#(< ~counter~0 49)} is VALID [2022-04-15 09:04:03,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {36792#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36767#(< ~counter~0 49)} is VALID [2022-04-15 09:04:03,622 INFO L290 TraceCheckUtils]: 64: Hoare triple {36792#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {36792#(< ~counter~0 48)} is VALID [2022-04-15 09:04:03,623 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36429#true} {36792#(< ~counter~0 48)} #96#return; {36792#(< ~counter~0 48)} is VALID [2022-04-15 09:04:03,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,623 INFO L290 TraceCheckUtils]: 60: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,623 INFO L272 TraceCheckUtils]: 59: Hoare triple {36792#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {36792#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {36792#(< ~counter~0 48)} is VALID [2022-04-15 09:04:03,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {36817#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36792#(< ~counter~0 48)} is VALID [2022-04-15 09:04:03,624 INFO L290 TraceCheckUtils]: 56: Hoare triple {36817#(< ~counter~0 47)} assume !!(0 != ~r~0); {36817#(< ~counter~0 47)} is VALID [2022-04-15 09:04:03,625 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {36429#true} {36817#(< ~counter~0 47)} #94#return; {36817#(< ~counter~0 47)} is VALID [2022-04-15 09:04:03,625 INFO L290 TraceCheckUtils]: 54: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,625 INFO L290 TraceCheckUtils]: 52: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,625 INFO L272 TraceCheckUtils]: 51: Hoare triple {36817#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,625 INFO L290 TraceCheckUtils]: 50: Hoare triple {36817#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {36817#(< ~counter~0 47)} is VALID [2022-04-15 09:04:03,626 INFO L290 TraceCheckUtils]: 49: Hoare triple {36842#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36817#(< ~counter~0 47)} is VALID [2022-04-15 09:04:03,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {36842#(< ~counter~0 46)} assume !(~r~0 < 0); {36842#(< ~counter~0 46)} is VALID [2022-04-15 09:04:03,626 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {36429#true} {36842#(< ~counter~0 46)} #98#return; {36842#(< ~counter~0 46)} is VALID [2022-04-15 09:04:03,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,627 INFO L272 TraceCheckUtils]: 43: Hoare triple {36842#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {36842#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {36842#(< ~counter~0 46)} is VALID [2022-04-15 09:04:03,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {36867#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36842#(< ~counter~0 46)} is VALID [2022-04-15 09:04:03,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {36867#(< ~counter~0 45)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {36867#(< ~counter~0 45)} is VALID [2022-04-15 09:04:03,628 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {36429#true} {36867#(< ~counter~0 45)} #98#return; {36867#(< ~counter~0 45)} is VALID [2022-04-15 09:04:03,628 INFO L290 TraceCheckUtils]: 38: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,629 INFO L272 TraceCheckUtils]: 35: Hoare triple {36867#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {36867#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {36867#(< ~counter~0 45)} is VALID [2022-04-15 09:04:03,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {36892#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {36867#(< ~counter~0 45)} is VALID [2022-04-15 09:04:03,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {36892#(< ~counter~0 44)} assume !(~r~0 > 0); {36892#(< ~counter~0 44)} is VALID [2022-04-15 09:04:03,630 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {36429#true} {36892#(< ~counter~0 44)} #96#return; {36892#(< ~counter~0 44)} is VALID [2022-04-15 09:04:03,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,630 INFO L272 TraceCheckUtils]: 27: Hoare triple {36892#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {36892#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {36892#(< ~counter~0 44)} is VALID [2022-04-15 09:04:03,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {36917#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36892#(< ~counter~0 44)} is VALID [2022-04-15 09:04:03,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {36917#(< ~counter~0 43)} assume !!(0 != ~r~0); {36917#(< ~counter~0 43)} is VALID [2022-04-15 09:04:03,632 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {36429#true} {36917#(< ~counter~0 43)} #94#return; {36917#(< ~counter~0 43)} is VALID [2022-04-15 09:04:03,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,632 INFO L272 TraceCheckUtils]: 19: Hoare triple {36917#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {36917#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {36917#(< ~counter~0 43)} is VALID [2022-04-15 09:04:03,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {36942#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36917#(< ~counter~0 43)} is VALID [2022-04-15 09:04:03,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {36942#(< ~counter~0 42)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,634 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36429#true} {36942#(< ~counter~0 42)} #92#return; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,634 INFO L272 TraceCheckUtils]: 11: Hoare triple {36942#(< ~counter~0 42)} 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)); {36429#true} is VALID [2022-04-15 09:04:03,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36429#true} {36942#(< ~counter~0 42)} #90#return; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {36429#true} assume true; {36429#true} is VALID [2022-04-15 09:04:03,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {36429#true} assume !(0 == ~cond); {36429#true} is VALID [2022-04-15 09:04:03,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {36429#true} ~cond := #in~cond; {36429#true} is VALID [2022-04-15 09:04:03,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {36942#(< ~counter~0 42)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {36429#true} is VALID [2022-04-15 09:04:03,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {36942#(< ~counter~0 42)} 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; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {36942#(< ~counter~0 42)} call #t~ret9 := main(); {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36942#(< ~counter~0 42)} {36429#true} #102#return; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {36942#(< ~counter~0 42)} assume true; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {36429#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; {36942#(< ~counter~0 42)} is VALID [2022-04-15 09:04:03,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {36429#true} call ULTIMATE.init(); {36429#true} is VALID [2022-04-15 09:04:03,637 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-15 09:04:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:04:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13768687] [2022-04-15 09:04:03,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:04:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455376246] [2022-04-15 09:04:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455376246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:04:03,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:04:03,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 09:04:03,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:04:03,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [451109984] [2022-04-15 09:04:03,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [451109984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:04:03,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:04:03,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 09:04:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121963538] [2022-04-15 09:04:03,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:04:03,639 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-15 09:04:03,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:04:03,639 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-15 09:04:03,699 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-15 09:04:03,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 09:04:03,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:03,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 09:04:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:04:03,700 INFO L87 Difference]: Start difference. First operand 374 states and 484 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-15 09:04:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:04,679 INFO L93 Difference]: Finished difference Result 463 states and 612 transitions. [2022-04-15 09:04:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 09:04:04,680 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-15 09:04:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:04:04,680 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-15 09:04:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 09:04:04,681 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-15 09:04:04,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 09:04:04,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 09:04:04,822 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-15 09:04:04,829 INFO L225 Difference]: With dead ends: 463 [2022-04-15 09:04:04,829 INFO L226 Difference]: Without dead ends: 374 [2022-04-15 09:04:04,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-15 09:04:04,830 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 98 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:04:04,830 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 224 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:04:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-04-15 09:04:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-04-15 09:04:05,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:04:05,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:05,375 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:05,376 INFO L87 Difference]: Start difference. First operand 374 states. Second operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:05,381 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2022-04-15 09:04:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2022-04-15 09:04:05,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:05,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:05,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 374 states. [2022-04-15 09:04:05,383 INFO L87 Difference]: Start difference. First operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 374 states. [2022-04-15 09:04:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:05,388 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2022-04-15 09:04:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2022-04-15 09:04:05,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:05,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:05,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:04:05,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:04:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 279 states have (on average 1.1971326164874552) internal successors, (334), 285 states have internal predecessors, (334), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 480 transitions. [2022-04-15 09:04:05,396 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 480 transitions. Word has length 91 [2022-04-15 09:04:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:04:05,396 INFO L478 AbstractCegarLoop]: Abstraction has 374 states and 480 transitions. [2022-04-15 09:04:05,396 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-15 09:04:05,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 374 states and 480 transitions. [2022-04-15 09:04:20,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 475 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 09:04:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 480 transitions. [2022-04-15 09:04:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 09:04:20,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:04:20,074 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-15 09:04:20,078 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-15 09:04:20,274 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-15 09:04:20,274 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:04:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:04:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-15 09:04:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [768940703] [2022-04-15 09:04:20,275 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:04:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-15 09:04:20,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:04:20,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626031498] [2022-04-15 09:04:20,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:04:20,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:04:20,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:04:20,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876267056] [2022-04-15 09:04:20,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:04:20,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:04:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:04:20,292 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-15 09:04:20,293 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-15 09:04:20,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:04:20,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:04:20,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 09:04:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:04:20,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:04:20,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {39432#true} call ULTIMATE.init(); {39432#true} is VALID [2022-04-15 09:04:20,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {39432#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; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {39440#(<= ~counter~0 0)} assume true; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39440#(<= ~counter~0 0)} {39432#true} #102#return; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {39440#(<= ~counter~0 0)} call #t~ret9 := main(); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {39440#(<= ~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; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {39440#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {39440#(<= ~counter~0 0)} ~cond := #in~cond; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {39440#(<= ~counter~0 0)} assume !(0 == ~cond); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {39440#(<= ~counter~0 0)} assume true; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39440#(<= ~counter~0 0)} {39440#(<= ~counter~0 0)} #90#return; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,794 INFO L272 TraceCheckUtils]: 11: Hoare triple {39440#(<= ~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)); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {39440#(<= ~counter~0 0)} ~cond := #in~cond; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {39440#(<= ~counter~0 0)} assume !(0 == ~cond); {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {39440#(<= ~counter~0 0)} assume true; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39440#(<= ~counter~0 0)} {39440#(<= ~counter~0 0)} #92#return; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {39440#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {39440#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:20,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {39440#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {39489#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,797 INFO L272 TraceCheckUtils]: 19: Hoare triple {39489#(<= ~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)); {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {39489#(<= ~counter~0 1)} ~cond := #in~cond; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {39489#(<= ~counter~0 1)} assume !(0 == ~cond); {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {39489#(<= ~counter~0 1)} assume true; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,798 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {39489#(<= ~counter~0 1)} {39489#(<= ~counter~0 1)} #94#return; {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {39489#(<= ~counter~0 1)} assume !!(0 != ~r~0); {39489#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:20,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {39489#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {39514#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,800 INFO L272 TraceCheckUtils]: 27: Hoare triple {39514#(<= ~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)); {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {39514#(<= ~counter~0 2)} ~cond := #in~cond; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {39514#(<= ~counter~0 2)} assume !(0 == ~cond); {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {39514#(<= ~counter~0 2)} assume true; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,801 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {39514#(<= ~counter~0 2)} {39514#(<= ~counter~0 2)} #96#return; {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {39514#(<= ~counter~0 2)} assume !(~r~0 > 0); {39514#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:20,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {39514#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,803 INFO L290 TraceCheckUtils]: 34: Hoare triple {39539#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,803 INFO L272 TraceCheckUtils]: 35: Hoare triple {39539#(<= ~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)); {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {39539#(<= ~counter~0 3)} ~cond := #in~cond; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {39539#(<= ~counter~0 3)} assume !(0 == ~cond); {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {39539#(<= ~counter~0 3)} assume true; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,804 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39539#(<= ~counter~0 3)} {39539#(<= ~counter~0 3)} #98#return; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {39539#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39539#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:20,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {39539#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,806 INFO L290 TraceCheckUtils]: 42: Hoare triple {39564#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,806 INFO L272 TraceCheckUtils]: 43: Hoare triple {39564#(<= ~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)); {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,806 INFO L290 TraceCheckUtils]: 44: Hoare triple {39564#(<= ~counter~0 4)} ~cond := #in~cond; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,807 INFO L290 TraceCheckUtils]: 45: Hoare triple {39564#(<= ~counter~0 4)} assume !(0 == ~cond); {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,807 INFO L290 TraceCheckUtils]: 46: Hoare triple {39564#(<= ~counter~0 4)} assume true; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,807 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {39564#(<= ~counter~0 4)} {39564#(<= ~counter~0 4)} #98#return; {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {39564#(<= ~counter~0 4)} assume !(~r~0 < 0); {39564#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:20,808 INFO L290 TraceCheckUtils]: 49: Hoare triple {39564#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {39589#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,809 INFO L272 TraceCheckUtils]: 51: Hoare triple {39589#(<= ~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)); {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {39589#(<= ~counter~0 5)} ~cond := #in~cond; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {39589#(<= ~counter~0 5)} assume !(0 == ~cond); {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {39589#(<= ~counter~0 5)} assume true; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,810 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {39589#(<= ~counter~0 5)} {39589#(<= ~counter~0 5)} #94#return; {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,811 INFO L290 TraceCheckUtils]: 56: Hoare triple {39589#(<= ~counter~0 5)} assume !!(0 != ~r~0); {39589#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:20,811 INFO L290 TraceCheckUtils]: 57: Hoare triple {39589#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {39614#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,812 INFO L272 TraceCheckUtils]: 59: Hoare triple {39614#(<= ~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)); {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {39614#(<= ~counter~0 6)} ~cond := #in~cond; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {39614#(<= ~counter~0 6)} assume !(0 == ~cond); {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {39614#(<= ~counter~0 6)} assume true; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,813 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {39614#(<= ~counter~0 6)} {39614#(<= ~counter~0 6)} #96#return; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,813 INFO L290 TraceCheckUtils]: 64: Hoare triple {39614#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39614#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:20,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {39614#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,814 INFO L290 TraceCheckUtils]: 66: Hoare triple {39639#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,815 INFO L272 TraceCheckUtils]: 67: Hoare triple {39639#(<= ~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)); {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {39639#(<= ~counter~0 7)} ~cond := #in~cond; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {39639#(<= ~counter~0 7)} assume !(0 == ~cond); {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,816 INFO L290 TraceCheckUtils]: 70: Hoare triple {39639#(<= ~counter~0 7)} assume true; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,816 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39639#(<= ~counter~0 7)} {39639#(<= ~counter~0 7)} #96#return; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,816 INFO L290 TraceCheckUtils]: 72: Hoare triple {39639#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39639#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:20,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {39639#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {39664#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,818 INFO L272 TraceCheckUtils]: 75: Hoare triple {39664#(<= ~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)); {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {39664#(<= ~counter~0 8)} ~cond := #in~cond; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,818 INFO L290 TraceCheckUtils]: 77: Hoare triple {39664#(<= ~counter~0 8)} assume !(0 == ~cond); {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,819 INFO L290 TraceCheckUtils]: 78: Hoare triple {39664#(<= ~counter~0 8)} assume true; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,819 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {39664#(<= ~counter~0 8)} {39664#(<= ~counter~0 8)} #96#return; {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,819 INFO L290 TraceCheckUtils]: 80: Hoare triple {39664#(<= ~counter~0 8)} assume !(~r~0 > 0); {39664#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:20,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {39664#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,820 INFO L290 TraceCheckUtils]: 82: Hoare triple {39689#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,821 INFO L272 TraceCheckUtils]: 83: Hoare triple {39689#(<= ~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)); {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,821 INFO L290 TraceCheckUtils]: 84: Hoare triple {39689#(<= ~counter~0 9)} ~cond := #in~cond; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,821 INFO L290 TraceCheckUtils]: 85: Hoare triple {39689#(<= ~counter~0 9)} assume !(0 == ~cond); {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,821 INFO L290 TraceCheckUtils]: 86: Hoare triple {39689#(<= ~counter~0 9)} assume true; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,822 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {39689#(<= ~counter~0 9)} {39689#(<= ~counter~0 9)} #98#return; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,822 INFO L290 TraceCheckUtils]: 88: Hoare triple {39689#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39689#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:20,822 INFO L290 TraceCheckUtils]: 89: Hoare triple {39689#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39714#(<= |main_#t~post8| 9)} is VALID [2022-04-15 09:04:20,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {39714#(<= |main_#t~post8| 9)} assume !(#t~post8 < 50);havoc #t~post8; {39433#false} is VALID [2022-04-15 09:04:20,823 INFO L290 TraceCheckUtils]: 91: Hoare triple {39433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39433#false} is VALID [2022-04-15 09:04:20,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {39433#false} assume !(#t~post6 < 50);havoc #t~post6; {39433#false} is VALID [2022-04-15 09:04:20,823 INFO L272 TraceCheckUtils]: 93: Hoare triple {39433#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)); {39433#false} is VALID [2022-04-15 09:04:20,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {39433#false} ~cond := #in~cond; {39433#false} is VALID [2022-04-15 09:04:20,823 INFO L290 TraceCheckUtils]: 95: Hoare triple {39433#false} assume 0 == ~cond; {39433#false} is VALID [2022-04-15 09:04:20,823 INFO L290 TraceCheckUtils]: 96: Hoare triple {39433#false} assume !false; {39433#false} is VALID [2022-04-15 09:04:20,824 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-15 09:04:20,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:04:21,324 INFO L290 TraceCheckUtils]: 96: Hoare triple {39433#false} assume !false; {39433#false} is VALID [2022-04-15 09:04:21,325 INFO L290 TraceCheckUtils]: 95: Hoare triple {39433#false} assume 0 == ~cond; {39433#false} is VALID [2022-04-15 09:04:21,325 INFO L290 TraceCheckUtils]: 94: Hoare triple {39433#false} ~cond := #in~cond; {39433#false} is VALID [2022-04-15 09:04:21,325 INFO L272 TraceCheckUtils]: 93: Hoare triple {39433#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)); {39433#false} is VALID [2022-04-15 09:04:21,325 INFO L290 TraceCheckUtils]: 92: Hoare triple {39433#false} assume !(#t~post6 < 50);havoc #t~post6; {39433#false} is VALID [2022-04-15 09:04:21,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {39433#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39433#false} is VALID [2022-04-15 09:04:21,325 INFO L290 TraceCheckUtils]: 90: Hoare triple {39754#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {39433#false} is VALID [2022-04-15 09:04:21,326 INFO L290 TraceCheckUtils]: 89: Hoare triple {39758#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39754#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:04:21,326 INFO L290 TraceCheckUtils]: 88: Hoare triple {39758#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39758#(< ~counter~0 50)} is VALID [2022-04-15 09:04:21,326 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {39432#true} {39758#(< ~counter~0 50)} #98#return; {39758#(< ~counter~0 50)} is VALID [2022-04-15 09:04:21,326 INFO L290 TraceCheckUtils]: 86: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,327 INFO L272 TraceCheckUtils]: 83: Hoare triple {39758#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,327 INFO L290 TraceCheckUtils]: 82: Hoare triple {39758#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {39758#(< ~counter~0 50)} is VALID [2022-04-15 09:04:21,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {39783#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39758#(< ~counter~0 50)} is VALID [2022-04-15 09:04:21,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {39783#(< ~counter~0 49)} assume !(~r~0 > 0); {39783#(< ~counter~0 49)} is VALID [2022-04-15 09:04:21,328 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {39432#true} {39783#(< ~counter~0 49)} #96#return; {39783#(< ~counter~0 49)} is VALID [2022-04-15 09:04:21,329 INFO L290 TraceCheckUtils]: 78: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,329 INFO L290 TraceCheckUtils]: 77: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,329 INFO L272 TraceCheckUtils]: 75: Hoare triple {39783#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {39783#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {39783#(< ~counter~0 49)} is VALID [2022-04-15 09:04:21,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {39808#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39783#(< ~counter~0 49)} is VALID [2022-04-15 09:04:21,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {39808#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39808#(< ~counter~0 48)} is VALID [2022-04-15 09:04:21,330 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {39432#true} {39808#(< ~counter~0 48)} #96#return; {39808#(< ~counter~0 48)} is VALID [2022-04-15 09:04:21,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,331 INFO L272 TraceCheckUtils]: 67: Hoare triple {39808#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,331 INFO L290 TraceCheckUtils]: 66: Hoare triple {39808#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {39808#(< ~counter~0 48)} is VALID [2022-04-15 09:04:21,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {39833#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39808#(< ~counter~0 48)} is VALID [2022-04-15 09:04:21,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {39833#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {39833#(< ~counter~0 47)} is VALID [2022-04-15 09:04:21,332 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {39432#true} {39833#(< ~counter~0 47)} #96#return; {39833#(< ~counter~0 47)} is VALID [2022-04-15 09:04:21,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,332 INFO L290 TraceCheckUtils]: 60: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,332 INFO L272 TraceCheckUtils]: 59: Hoare triple {39833#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {39833#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {39833#(< ~counter~0 47)} is VALID [2022-04-15 09:04:21,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {39858#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39833#(< ~counter~0 47)} is VALID [2022-04-15 09:04:21,334 INFO L290 TraceCheckUtils]: 56: Hoare triple {39858#(< ~counter~0 46)} assume !!(0 != ~r~0); {39858#(< ~counter~0 46)} is VALID [2022-04-15 09:04:21,334 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {39432#true} {39858#(< ~counter~0 46)} #94#return; {39858#(< ~counter~0 46)} is VALID [2022-04-15 09:04:21,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,334 INFO L272 TraceCheckUtils]: 51: Hoare triple {39858#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {39858#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {39858#(< ~counter~0 46)} is VALID [2022-04-15 09:04:21,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {39883#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39858#(< ~counter~0 46)} is VALID [2022-04-15 09:04:21,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {39883#(< ~counter~0 45)} assume !(~r~0 < 0); {39883#(< ~counter~0 45)} is VALID [2022-04-15 09:04:21,336 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {39432#true} {39883#(< ~counter~0 45)} #98#return; {39883#(< ~counter~0 45)} is VALID [2022-04-15 09:04:21,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,336 INFO L272 TraceCheckUtils]: 43: Hoare triple {39883#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {39883#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {39883#(< ~counter~0 45)} is VALID [2022-04-15 09:04:21,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {39908#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39883#(< ~counter~0 45)} is VALID [2022-04-15 09:04:21,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {39908#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {39908#(< ~counter~0 44)} is VALID [2022-04-15 09:04:21,338 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {39432#true} {39908#(< ~counter~0 44)} #98#return; {39908#(< ~counter~0 44)} is VALID [2022-04-15 09:04:21,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,338 INFO L272 TraceCheckUtils]: 35: Hoare triple {39908#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {39908#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {39908#(< ~counter~0 44)} is VALID [2022-04-15 09:04:21,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {39933#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39908#(< ~counter~0 44)} is VALID [2022-04-15 09:04:21,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {39933#(< ~counter~0 43)} assume !(~r~0 > 0); {39933#(< ~counter~0 43)} is VALID [2022-04-15 09:04:21,340 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {39432#true} {39933#(< ~counter~0 43)} #96#return; {39933#(< ~counter~0 43)} is VALID [2022-04-15 09:04:21,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,340 INFO L272 TraceCheckUtils]: 27: Hoare triple {39933#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {39933#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {39933#(< ~counter~0 43)} is VALID [2022-04-15 09:04:21,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {39958#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {39933#(< ~counter~0 43)} is VALID [2022-04-15 09:04:21,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {39958#(< ~counter~0 42)} assume !!(0 != ~r~0); {39958#(< ~counter~0 42)} is VALID [2022-04-15 09:04:21,341 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {39432#true} {39958#(< ~counter~0 42)} #94#return; {39958#(< ~counter~0 42)} is VALID [2022-04-15 09:04:21,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,342 INFO L272 TraceCheckUtils]: 19: Hoare triple {39958#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {39958#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {39958#(< ~counter~0 42)} is VALID [2022-04-15 09:04:21,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {39983#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39958#(< ~counter~0 42)} is VALID [2022-04-15 09:04:21,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {39983#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39432#true} {39983#(< ~counter~0 41)} #92#return; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,343 INFO L272 TraceCheckUtils]: 11: Hoare triple {39983#(< ~counter~0 41)} 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)); {39432#true} is VALID [2022-04-15 09:04:21,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39432#true} {39983#(< ~counter~0 41)} #90#return; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {39432#true} assume true; {39432#true} is VALID [2022-04-15 09:04:21,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {39432#true} assume !(0 == ~cond); {39432#true} is VALID [2022-04-15 09:04:21,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {39432#true} ~cond := #in~cond; {39432#true} is VALID [2022-04-15 09:04:21,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {39983#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {39432#true} is VALID [2022-04-15 09:04:21,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {39983#(< ~counter~0 41)} 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; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {39983#(< ~counter~0 41)} call #t~ret9 := main(); {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39983#(< ~counter~0 41)} {39432#true} #102#return; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {39983#(< ~counter~0 41)} assume true; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {39432#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; {39983#(< ~counter~0 41)} is VALID [2022-04-15 09:04:21,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {39432#true} call ULTIMATE.init(); {39432#true} is VALID [2022-04-15 09:04:21,346 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-15 09:04:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:04:21,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626031498] [2022-04-15 09:04:21,346 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:04:21,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876267056] [2022-04-15 09:04:21,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876267056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:04:21,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:04:21,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 09:04:21,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:04:21,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [768940703] [2022-04-15 09:04:21,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [768940703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:04:21,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:04:21,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 09:04:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421676491] [2022-04-15 09:04:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:04:21,347 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-15 09:04:21,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:04:21,348 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-15 09:04:21,411 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-15 09:04:21,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 09:04:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 09:04:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:04:21,411 INFO L87 Difference]: Start difference. First operand 374 states and 480 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-15 09:04:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:22,513 INFO L93 Difference]: Finished difference Result 503 states and 667 transitions. [2022-04-15 09:04:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 09:04:22,513 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-15 09:04:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:04:22,513 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-15 09:04:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 09:04:22,515 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-15 09:04:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 09:04:22,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-15 09:04:22,665 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-15 09:04:22,672 INFO L225 Difference]: With dead ends: 503 [2022-04-15 09:04:22,672 INFO L226 Difference]: Without dead ends: 384 [2022-04-15 09:04:22,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-15 09:04:22,673 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 124 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:04:22,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 252 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:04:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-15 09:04:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 376. [2022-04-15 09:04:23,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:04:23,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:23,145 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:23,145 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:23,164 INFO L93 Difference]: Finished difference Result 384 states and 489 transitions. [2022-04-15 09:04:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 489 transitions. [2022-04-15 09:04:23,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:23,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:23,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 384 states. [2022-04-15 09:04:23,165 INFO L87 Difference]: Start difference. First operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 384 states. [2022-04-15 09:04:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:23,171 INFO L93 Difference]: Finished difference Result 384 states and 489 transitions. [2022-04-15 09:04:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 489 transitions. [2022-04-15 09:04:23,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:23,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:23,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:04:23,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:04:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 285 states have internal predecessors, (335), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 481 transitions. [2022-04-15 09:04:23,179 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 481 transitions. Word has length 97 [2022-04-15 09:04:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:04:23,180 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 481 transitions. [2022-04-15 09:04:23,180 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-15 09:04:23,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 376 states and 481 transitions. [2022-04-15 09:04:33,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 481 edges. 479 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:04:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 481 transitions. [2022-04-15 09:04:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 09:04:33,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:04:33,577 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-15 09:04:33,597 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-15 09:04:33,777 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-15 09:04:33,777 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:04:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:04:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-15 09:04:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:33,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1431459680] [2022-04-15 09:04:33,778 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:04:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-15 09:04:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:04:33,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911882287] [2022-04-15 09:04:33,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:04:33,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:04:33,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:04:33,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417753025] [2022-04-15 09:04:33,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:04:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:04:33,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:04:33,789 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-15 09:04:33,791 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-15 09:04:33,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:04:33,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:04:33,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 09:04:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:04:33,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:04:34,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {42577#true} call ULTIMATE.init(); {42577#true} is VALID [2022-04-15 09:04:34,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {42577#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; {42577#true} is VALID [2022-04-15 09:04:34,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42577#true} {42577#true} #102#return; {42577#true} is VALID [2022-04-15 09:04:34,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {42577#true} call #t~ret9 := main(); {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {42577#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; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {42577#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42577#true} {42577#true} #90#return; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L272 TraceCheckUtils]: 11: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42577#true} {42577#true} #92#return; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {42577#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {42577#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {42577#true} assume !!(#t~post6 < 50);havoc #t~post6; {42577#true} is VALID [2022-04-15 09:04:34,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42577#true} {42577#true} #94#return; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {42577#true} assume !!(0 != ~r~0); {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {42577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {42577#true} assume !!(#t~post7 < 50);havoc #t~post7; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L272 TraceCheckUtils]: 27: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42577#true} {42577#true} #96#return; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {42577#true} assume !(~r~0 > 0); {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {42577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42577#true} is VALID [2022-04-15 09:04:34,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {42577#true} assume !!(#t~post8 < 50);havoc #t~post8; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L272 TraceCheckUtils]: 35: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 37: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 38: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42577#true} {42577#true} #98#return; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {42577#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 41: Hoare triple {42577#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {42577#true} assume !!(#t~post8 < 50);havoc #t~post8; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42577#true} {42577#true} #98#return; {42577#true} is VALID [2022-04-15 09:04:34,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {42577#true} assume !(~r~0 < 0); {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {42577#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {42577#true} assume !!(#t~post6 < 50);havoc #t~post6; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L272 TraceCheckUtils]: 51: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42577#true} {42577#true} #94#return; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {42577#true} assume !!(0 != ~r~0); {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {42577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {42577#true} assume !!(#t~post7 < 50);havoc #t~post7; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L272 TraceCheckUtils]: 59: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L290 TraceCheckUtils]: 62: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,068 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42577#true} {42577#true} #96#return; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 64: Hoare triple {42577#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 65: Hoare triple {42577#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 66: Hoare triple {42577#true} assume !!(#t~post7 < 50);havoc #t~post7; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L272 TraceCheckUtils]: 67: Hoare triple {42577#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)); {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 68: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42577#true} {42577#true} #96#return; {42577#true} is VALID [2022-04-15 09:04:34,069 INFO L290 TraceCheckUtils]: 72: Hoare triple {42577#true} assume !(~r~0 > 0); {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:04:34,070 INFO L290 TraceCheckUtils]: 73: Hoare triple {42798#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:04:34,070 INFO L290 TraceCheckUtils]: 74: Hoare triple {42798#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:04:34,070 INFO L272 TraceCheckUtils]: 75: Hoare triple {42798#(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)); {42577#true} is VALID [2022-04-15 09:04:34,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,070 INFO L290 TraceCheckUtils]: 78: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,071 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {42577#true} {42798#(not (< 0 main_~r~0))} #98#return; {42798#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:04:34,071 INFO L290 TraceCheckUtils]: 80: Hoare triple {42798#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:04:34,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:04:34,072 INFO L290 TraceCheckUtils]: 82: Hoare triple {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 50);havoc #t~post6; {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:04:34,072 INFO L272 TraceCheckUtils]: 83: Hoare triple {42823#(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)); {42577#true} is VALID [2022-04-15 09:04:34,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {42577#true} ~cond := #in~cond; {42577#true} is VALID [2022-04-15 09:04:34,072 INFO L290 TraceCheckUtils]: 85: Hoare triple {42577#true} assume !(0 == ~cond); {42577#true} is VALID [2022-04-15 09:04:34,072 INFO L290 TraceCheckUtils]: 86: Hoare triple {42577#true} assume true; {42577#true} is VALID [2022-04-15 09:04:34,072 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {42577#true} {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {42823#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 89: Hoare triple {42578#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {42578#false} assume !(#t~post7 < 50);havoc #t~post7; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 91: Hoare triple {42578#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 92: Hoare triple {42578#false} assume !(#t~post8 < 50);havoc #t~post8; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 93: Hoare triple {42578#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 94: Hoare triple {42578#false} assume !(#t~post6 < 50);havoc #t~post6; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L272 TraceCheckUtils]: 95: Hoare triple {42578#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)); {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {42578#false} ~cond := #in~cond; {42578#false} is VALID [2022-04-15 09:04:34,073 INFO L290 TraceCheckUtils]: 97: Hoare triple {42578#false} assume 0 == ~cond; {42578#false} is VALID [2022-04-15 09:04:34,074 INFO L290 TraceCheckUtils]: 98: Hoare triple {42578#false} assume !false; {42578#false} is VALID [2022-04-15 09:04:34,074 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-15 09:04:34,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:04:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:04:34,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911882287] [2022-04-15 09:04:34,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:04:34,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417753025] [2022-04-15 09:04:34,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417753025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:04:34,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:04:34,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:04:34,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:04:34,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1431459680] [2022-04-15 09:04:34,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1431459680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:04:34,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:04:34,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:04:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860015555] [2022-04-15 09:04:34,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:04:34,075 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-15 09:04:34,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:04:34,075 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-15 09:04:34,115 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-15 09:04:34,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:04:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:34,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:04:34,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:04:34,116 INFO L87 Difference]: Start difference. First operand 376 states and 481 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-15 09:04:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:34,830 INFO L93 Difference]: Finished difference Result 536 states and 699 transitions. [2022-04-15 09:04:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:04:34,830 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-15 09:04:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:04:34,830 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-15 09:04:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 09:04:34,831 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-15 09:04:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 09:04:34,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 09:04:34,901 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-15 09:04:34,909 INFO L225 Difference]: With dead ends: 536 [2022-04-15 09:04:34,909 INFO L226 Difference]: Without dead ends: 394 [2022-04-15 09:04:34,909 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-15 09:04:34,910 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:04:34,910 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:04:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-15 09:04:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 384. [2022-04-15 09:04:35,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:04:35,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:35,528 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:35,529 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:35,535 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2022-04-15 09:04:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2022-04-15 09:04:35,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:35,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:35,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 394 states. [2022-04-15 09:04:35,537 INFO L87 Difference]: Start difference. First operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 394 states. [2022-04-15 09:04:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:35,543 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2022-04-15 09:04:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2022-04-15 09:04:35,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:35,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:35,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:04:35,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:04:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 289 states have (on average 1.1972318339100345) internal successors, (346), 293 states have internal predecessors, (346), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 492 transitions. [2022-04-15 09:04:35,552 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 492 transitions. Word has length 99 [2022-04-15 09:04:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:04:35,552 INFO L478 AbstractCegarLoop]: Abstraction has 384 states and 492 transitions. [2022-04-15 09:04:35,552 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-15 09:04:35,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 384 states and 492 transitions. [2022-04-15 09:04:46,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 490 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:04:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 492 transitions. [2022-04-15 09:04:46,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 09:04:46,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:04:46,200 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-15 09:04:46,215 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-15 09:04:46,400 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-15 09:04:46,400 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:04:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:04:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-15 09:04:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256595605] [2022-04-15 09:04:46,401 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:04:46,401 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-15 09:04:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:04:46,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613660669] [2022-04-15 09:04:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:04:46,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:04:46,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:04:46,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974445019] [2022-04-15 09:04:46,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:04:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:04:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:04:46,420 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-15 09:04:46,421 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-15 09:04:46,564 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:04:46,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:04:46,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 09:04:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:04:46,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:04:47,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {45505#true} call ULTIMATE.init(); {45505#true} is VALID [2022-04-15 09:04:47,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {45505#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; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {45513#(<= ~counter~0 0)} assume true; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45513#(<= ~counter~0 0)} {45505#true} #102#return; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {45513#(<= ~counter~0 0)} call #t~ret9 := main(); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {45513#(<= ~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; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {45513#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {45513#(<= ~counter~0 0)} ~cond := #in~cond; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {45513#(<= ~counter~0 0)} assume !(0 == ~cond); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {45513#(<= ~counter~0 0)} assume true; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45513#(<= ~counter~0 0)} {45513#(<= ~counter~0 0)} #90#return; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,051 INFO L272 TraceCheckUtils]: 11: Hoare triple {45513#(<= ~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)); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {45513#(<= ~counter~0 0)} ~cond := #in~cond; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {45513#(<= ~counter~0 0)} assume !(0 == ~cond); {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {45513#(<= ~counter~0 0)} assume true; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45513#(<= ~counter~0 0)} {45513#(<= ~counter~0 0)} #92#return; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {45513#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {45513#(<= ~counter~0 0)} is VALID [2022-04-15 09:04:47,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {45513#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {45562#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,054 INFO L272 TraceCheckUtils]: 19: Hoare triple {45562#(<= ~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)); {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {45562#(<= ~counter~0 1)} ~cond := #in~cond; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {45562#(<= ~counter~0 1)} assume !(0 == ~cond); {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {45562#(<= ~counter~0 1)} assume true; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,055 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45562#(<= ~counter~0 1)} {45562#(<= ~counter~0 1)} #94#return; {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {45562#(<= ~counter~0 1)} assume !!(0 != ~r~0); {45562#(<= ~counter~0 1)} is VALID [2022-04-15 09:04:47,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {45562#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {45587#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,057 INFO L272 TraceCheckUtils]: 27: Hoare triple {45587#(<= ~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)); {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {45587#(<= ~counter~0 2)} ~cond := #in~cond; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {45587#(<= ~counter~0 2)} assume !(0 == ~cond); {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {45587#(<= ~counter~0 2)} assume true; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,058 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {45587#(<= ~counter~0 2)} {45587#(<= ~counter~0 2)} #96#return; {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {45587#(<= ~counter~0 2)} assume !(~r~0 > 0); {45587#(<= ~counter~0 2)} is VALID [2022-04-15 09:04:47,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {45587#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {45612#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,060 INFO L272 TraceCheckUtils]: 35: Hoare triple {45612#(<= ~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)); {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {45612#(<= ~counter~0 3)} ~cond := #in~cond; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {45612#(<= ~counter~0 3)} assume !(0 == ~cond); {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {45612#(<= ~counter~0 3)} assume true; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,061 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45612#(<= ~counter~0 3)} {45612#(<= ~counter~0 3)} #98#return; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,062 INFO L290 TraceCheckUtils]: 40: Hoare triple {45612#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {45612#(<= ~counter~0 3)} is VALID [2022-04-15 09:04:47,062 INFO L290 TraceCheckUtils]: 41: Hoare triple {45612#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {45637#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,063 INFO L272 TraceCheckUtils]: 43: Hoare triple {45637#(<= ~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)); {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {45637#(<= ~counter~0 4)} ~cond := #in~cond; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,064 INFO L290 TraceCheckUtils]: 45: Hoare triple {45637#(<= ~counter~0 4)} assume !(0 == ~cond); {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,064 INFO L290 TraceCheckUtils]: 46: Hoare triple {45637#(<= ~counter~0 4)} assume true; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,064 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {45637#(<= ~counter~0 4)} {45637#(<= ~counter~0 4)} #98#return; {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {45637#(<= ~counter~0 4)} assume !(~r~0 < 0); {45637#(<= ~counter~0 4)} is VALID [2022-04-15 09:04:47,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {45637#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {45662#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,066 INFO L272 TraceCheckUtils]: 51: Hoare triple {45662#(<= ~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)); {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {45662#(<= ~counter~0 5)} ~cond := #in~cond; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {45662#(<= ~counter~0 5)} assume !(0 == ~cond); {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {45662#(<= ~counter~0 5)} assume true; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,067 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {45662#(<= ~counter~0 5)} {45662#(<= ~counter~0 5)} #94#return; {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {45662#(<= ~counter~0 5)} assume !!(0 != ~r~0); {45662#(<= ~counter~0 5)} is VALID [2022-04-15 09:04:47,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {45662#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {45687#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,069 INFO L272 TraceCheckUtils]: 59: Hoare triple {45687#(<= ~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)); {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {45687#(<= ~counter~0 6)} ~cond := #in~cond; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {45687#(<= ~counter~0 6)} assume !(0 == ~cond); {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {45687#(<= ~counter~0 6)} assume true; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,077 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {45687#(<= ~counter~0 6)} {45687#(<= ~counter~0 6)} #96#return; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {45687#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45687#(<= ~counter~0 6)} is VALID [2022-04-15 09:04:47,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {45687#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {45712#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,078 INFO L272 TraceCheckUtils]: 67: Hoare triple {45712#(<= ~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)); {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {45712#(<= ~counter~0 7)} ~cond := #in~cond; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {45712#(<= ~counter~0 7)} assume !(0 == ~cond); {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {45712#(<= ~counter~0 7)} assume true; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,080 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {45712#(<= ~counter~0 7)} {45712#(<= ~counter~0 7)} #96#return; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {45712#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45712#(<= ~counter~0 7)} is VALID [2022-04-15 09:04:47,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {45712#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {45737#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,081 INFO L272 TraceCheckUtils]: 75: Hoare triple {45737#(<= ~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)); {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {45737#(<= ~counter~0 8)} ~cond := #in~cond; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {45737#(<= ~counter~0 8)} assume !(0 == ~cond); {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {45737#(<= ~counter~0 8)} assume true; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,083 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {45737#(<= ~counter~0 8)} {45737#(<= ~counter~0 8)} #96#return; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {45737#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45737#(<= ~counter~0 8)} is VALID [2022-04-15 09:04:47,084 INFO L290 TraceCheckUtils]: 81: Hoare triple {45737#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,084 INFO L290 TraceCheckUtils]: 82: Hoare triple {45762#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,084 INFO L272 TraceCheckUtils]: 83: Hoare triple {45762#(<= ~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)); {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {45762#(<= ~counter~0 9)} ~cond := #in~cond; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {45762#(<= ~counter~0 9)} assume !(0 == ~cond); {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,085 INFO L290 TraceCheckUtils]: 86: Hoare triple {45762#(<= ~counter~0 9)} assume true; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,086 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45762#(<= ~counter~0 9)} {45762#(<= ~counter~0 9)} #96#return; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,086 INFO L290 TraceCheckUtils]: 88: Hoare triple {45762#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45762#(<= ~counter~0 9)} is VALID [2022-04-15 09:04:47,086 INFO L290 TraceCheckUtils]: 89: Hoare triple {45762#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45787#(<= |main_#t~post7| 9)} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 90: Hoare triple {45787#(<= |main_#t~post7| 9)} assume !(#t~post7 < 50);havoc #t~post7; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 91: Hoare triple {45506#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 92: Hoare triple {45506#false} assume !(#t~post8 < 50);havoc #t~post8; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 93: Hoare triple {45506#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 94: Hoare triple {45506#false} assume !(#t~post6 < 50);havoc #t~post6; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L272 TraceCheckUtils]: 95: Hoare triple {45506#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)); {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {45506#false} ~cond := #in~cond; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {45506#false} assume 0 == ~cond; {45506#false} is VALID [2022-04-15 09:04:47,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {45506#false} assume !false; {45506#false} is VALID [2022-04-15 09:04:47,087 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-15 09:04:47,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:04:47,520 INFO L290 TraceCheckUtils]: 98: Hoare triple {45506#false} assume !false; {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L290 TraceCheckUtils]: 97: Hoare triple {45506#false} assume 0 == ~cond; {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L290 TraceCheckUtils]: 96: Hoare triple {45506#false} ~cond := #in~cond; {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L272 TraceCheckUtils]: 95: Hoare triple {45506#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)); {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L290 TraceCheckUtils]: 94: Hoare triple {45506#false} assume !(#t~post6 < 50);havoc #t~post6; {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {45506#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L290 TraceCheckUtils]: 92: Hoare triple {45506#false} assume !(#t~post8 < 50);havoc #t~post8; {45506#false} is VALID [2022-04-15 09:04:47,521 INFO L290 TraceCheckUtils]: 91: Hoare triple {45506#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45506#false} is VALID [2022-04-15 09:04:47,531 INFO L290 TraceCheckUtils]: 90: Hoare triple {45839#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {45506#false} is VALID [2022-04-15 09:04:47,531 INFO L290 TraceCheckUtils]: 89: Hoare triple {45843#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45839#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:04:47,531 INFO L290 TraceCheckUtils]: 88: Hoare triple {45843#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45843#(< ~counter~0 50)} is VALID [2022-04-15 09:04:47,532 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45505#true} {45843#(< ~counter~0 50)} #96#return; {45843#(< ~counter~0 50)} is VALID [2022-04-15 09:04:47,532 INFO L290 TraceCheckUtils]: 86: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,532 INFO L272 TraceCheckUtils]: 83: Hoare triple {45843#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {45843#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {45843#(< ~counter~0 50)} is VALID [2022-04-15 09:04:47,533 INFO L290 TraceCheckUtils]: 81: Hoare triple {45868#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45843#(< ~counter~0 50)} is VALID [2022-04-15 09:04:47,533 INFO L290 TraceCheckUtils]: 80: Hoare triple {45868#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45868#(< ~counter~0 49)} is VALID [2022-04-15 09:04:47,534 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {45505#true} {45868#(< ~counter~0 49)} #96#return; {45868#(< ~counter~0 49)} is VALID [2022-04-15 09:04:47,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,534 INFO L272 TraceCheckUtils]: 75: Hoare triple {45868#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {45868#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {45868#(< ~counter~0 49)} is VALID [2022-04-15 09:04:47,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {45893#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45868#(< ~counter~0 49)} is VALID [2022-04-15 09:04:47,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {45893#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45893#(< ~counter~0 48)} is VALID [2022-04-15 09:04:47,535 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {45505#true} {45893#(< ~counter~0 48)} #96#return; {45893#(< ~counter~0 48)} is VALID [2022-04-15 09:04:47,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,536 INFO L272 TraceCheckUtils]: 67: Hoare triple {45893#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {45893#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {45893#(< ~counter~0 48)} is VALID [2022-04-15 09:04:47,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {45918#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45893#(< ~counter~0 48)} is VALID [2022-04-15 09:04:47,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {45918#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {45918#(< ~counter~0 47)} is VALID [2022-04-15 09:04:47,537 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {45505#true} {45918#(< ~counter~0 47)} #96#return; {45918#(< ~counter~0 47)} is VALID [2022-04-15 09:04:47,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,537 INFO L290 TraceCheckUtils]: 60: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,537 INFO L272 TraceCheckUtils]: 59: Hoare triple {45918#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {45918#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {45918#(< ~counter~0 47)} is VALID [2022-04-15 09:04:47,538 INFO L290 TraceCheckUtils]: 57: Hoare triple {45943#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45918#(< ~counter~0 47)} is VALID [2022-04-15 09:04:47,538 INFO L290 TraceCheckUtils]: 56: Hoare triple {45943#(< ~counter~0 46)} assume !!(0 != ~r~0); {45943#(< ~counter~0 46)} is VALID [2022-04-15 09:04:47,538 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {45505#true} {45943#(< ~counter~0 46)} #94#return; {45943#(< ~counter~0 46)} is VALID [2022-04-15 09:04:47,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,539 INFO L272 TraceCheckUtils]: 51: Hoare triple {45943#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {45943#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {45943#(< ~counter~0 46)} is VALID [2022-04-15 09:04:47,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {45968#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45943#(< ~counter~0 46)} is VALID [2022-04-15 09:04:47,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {45968#(< ~counter~0 45)} assume !(~r~0 < 0); {45968#(< ~counter~0 45)} is VALID [2022-04-15 09:04:47,540 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {45505#true} {45968#(< ~counter~0 45)} #98#return; {45968#(< ~counter~0 45)} is VALID [2022-04-15 09:04:47,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,540 INFO L272 TraceCheckUtils]: 43: Hoare triple {45968#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {45968#(< ~counter~0 45)} assume !!(#t~post8 < 50);havoc #t~post8; {45968#(< ~counter~0 45)} is VALID [2022-04-15 09:04:47,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {45993#(< ~counter~0 44)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45968#(< ~counter~0 45)} is VALID [2022-04-15 09:04:47,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {45993#(< ~counter~0 44)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {45993#(< ~counter~0 44)} is VALID [2022-04-15 09:04:47,547 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {45505#true} {45993#(< ~counter~0 44)} #98#return; {45993#(< ~counter~0 44)} is VALID [2022-04-15 09:04:47,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,548 INFO L272 TraceCheckUtils]: 35: Hoare triple {45993#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {45993#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {45993#(< ~counter~0 44)} is VALID [2022-04-15 09:04:47,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {46018#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {45993#(< ~counter~0 44)} is VALID [2022-04-15 09:04:47,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {46018#(< ~counter~0 43)} assume !(~r~0 > 0); {46018#(< ~counter~0 43)} is VALID [2022-04-15 09:04:47,549 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {45505#true} {46018#(< ~counter~0 43)} #96#return; {46018#(< ~counter~0 43)} is VALID [2022-04-15 09:04:47,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,549 INFO L272 TraceCheckUtils]: 27: Hoare triple {46018#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {46018#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {46018#(< ~counter~0 43)} is VALID [2022-04-15 09:04:47,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {46043#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {46018#(< ~counter~0 43)} is VALID [2022-04-15 09:04:47,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {46043#(< ~counter~0 42)} assume !!(0 != ~r~0); {46043#(< ~counter~0 42)} is VALID [2022-04-15 09:04:47,551 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {45505#true} {46043#(< ~counter~0 42)} #94#return; {46043#(< ~counter~0 42)} is VALID [2022-04-15 09:04:47,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,551 INFO L272 TraceCheckUtils]: 19: Hoare triple {46043#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {46043#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {46043#(< ~counter~0 42)} is VALID [2022-04-15 09:04:47,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {46068#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {46043#(< ~counter~0 42)} is VALID [2022-04-15 09:04:47,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {46068#(< ~counter~0 41)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,552 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45505#true} {46068#(< ~counter~0 41)} #92#return; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,552 INFO L272 TraceCheckUtils]: 11: Hoare triple {46068#(< ~counter~0 41)} 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)); {45505#true} is VALID [2022-04-15 09:04:47,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45505#true} {46068#(< ~counter~0 41)} #90#return; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {45505#true} assume true; {45505#true} is VALID [2022-04-15 09:04:47,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {45505#true} assume !(0 == ~cond); {45505#true} is VALID [2022-04-15 09:04:47,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {45505#true} ~cond := #in~cond; {45505#true} is VALID [2022-04-15 09:04:47,553 INFO L272 TraceCheckUtils]: 6: Hoare triple {46068#(< ~counter~0 41)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {45505#true} is VALID [2022-04-15 09:04:47,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {46068#(< ~counter~0 41)} 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; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {46068#(< ~counter~0 41)} call #t~ret9 := main(); {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46068#(< ~counter~0 41)} {45505#true} #102#return; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {46068#(< ~counter~0 41)} assume true; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {45505#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; {46068#(< ~counter~0 41)} is VALID [2022-04-15 09:04:47,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {45505#true} call ULTIMATE.init(); {45505#true} is VALID [2022-04-15 09:04:47,555 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-15 09:04:47,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:04:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613660669] [2022-04-15 09:04:47,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:04:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974445019] [2022-04-15 09:04:47,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974445019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:04:47,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:04:47,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 09:04:47,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:04:47,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256595605] [2022-04-15 09:04:47,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256595605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:04:47,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:04:47,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 09:04:47,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471852643] [2022-04-15 09:04:47,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:04:47,556 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-15 09:04:47,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:04:47,556 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-15 09:04:47,604 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-15 09:04:47,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 09:04:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:04:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 09:04:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 09:04:47,605 INFO L87 Difference]: Start difference. First operand 384 states and 492 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-15 09:04:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:48,373 INFO L93 Difference]: Finished difference Result 507 states and 669 transitions. [2022-04-15 09:04:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 09:04:48,373 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-15 09:04:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:04:48,379 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-15 09:04:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 09:04:48,380 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-15 09:04:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 09:04:48,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-15 09:04:48,544 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-15 09:04:48,558 INFO L225 Difference]: With dead ends: 507 [2022-04-15 09:04:48,558 INFO L226 Difference]: Without dead ends: 396 [2022-04-15 09:04:48,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-15 09:04:48,559 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:04:48,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 234 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:04:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-04-15 09:04:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2022-04-15 09:04:48,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:04:48,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:48,935 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:48,936 INFO L87 Difference]: Start difference. First operand 396 states. Second operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:48,942 INFO L93 Difference]: Finished difference Result 396 states and 504 transitions. [2022-04-15 09:04:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2022-04-15 09:04:48,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:48,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:48,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 396 states. [2022-04-15 09:04:48,944 INFO L87 Difference]: Start difference. First operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 396 states. [2022-04-15 09:04:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:04:48,960 INFO L93 Difference]: Finished difference Result 396 states and 504 transitions. [2022-04-15 09:04:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2022-04-15 09:04:48,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:04:48,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:04:48,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:04:48,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:04:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 301 states have (on average 1.1893687707641196) internal successors, (358), 301 states have internal predecessors, (358), 74 states have call successors, (74), 22 states have call predecessors, (74), 20 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 09:04:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 504 transitions. [2022-04-15 09:04:48,970 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 504 transitions. Word has length 99 [2022-04-15 09:04:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:04:48,970 INFO L478 AbstractCegarLoop]: Abstraction has 396 states and 504 transitions. [2022-04-15 09:04:48,970 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-15 09:04:48,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 396 states and 504 transitions. [2022-04-15 09:05:02,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 501 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 504 transitions. [2022-04-15 09:05:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 09:05:02,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:02,156 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-15 09:05:02,172 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-15 09:05:02,356 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-15 09:05:02,356 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-15 09:05:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:02,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298731814] [2022-04-15 09:05:02,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-15 09:05:02,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:02,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335968650] [2022-04-15 09:05:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:02,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:02,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386673189] [2022-04-15 09:05:02,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:05:02,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:02,371 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-15 09:05:02,372 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-15 09:05:02,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:05:02,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:02,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:05:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:02,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:02,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {48736#true} call ULTIMATE.init(); {48736#true} is VALID [2022-04-15 09:05:02,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {48736#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; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {48744#(<= ~counter~0 0)} assume true; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48744#(<= ~counter~0 0)} {48736#true} #102#return; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {48744#(<= ~counter~0 0)} call #t~ret9 := main(); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {48744#(<= ~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; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {48744#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {48744#(<= ~counter~0 0)} ~cond := #in~cond; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {48744#(<= ~counter~0 0)} assume !(0 == ~cond); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {48744#(<= ~counter~0 0)} assume true; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48744#(<= ~counter~0 0)} {48744#(<= ~counter~0 0)} #90#return; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,971 INFO L272 TraceCheckUtils]: 11: Hoare triple {48744#(<= ~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)); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {48744#(<= ~counter~0 0)} ~cond := #in~cond; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {48744#(<= ~counter~0 0)} assume !(0 == ~cond); {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {48744#(<= ~counter~0 0)} assume true; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,972 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48744#(<= ~counter~0 0)} {48744#(<= ~counter~0 0)} #92#return; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {48744#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48744#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:02,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {48744#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {48793#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,974 INFO L272 TraceCheckUtils]: 19: Hoare triple {48793#(<= ~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)); {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {48793#(<= ~counter~0 1)} ~cond := #in~cond; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {48793#(<= ~counter~0 1)} assume !(0 == ~cond); {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {48793#(<= ~counter~0 1)} assume true; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,976 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48793#(<= ~counter~0 1)} {48793#(<= ~counter~0 1)} #94#return; {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {48793#(<= ~counter~0 1)} assume !!(0 != ~r~0); {48793#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:02,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {48793#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {48818#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,978 INFO L272 TraceCheckUtils]: 27: Hoare triple {48818#(<= ~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)); {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {48818#(<= ~counter~0 2)} ~cond := #in~cond; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {48818#(<= ~counter~0 2)} assume !(0 == ~cond); {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {48818#(<= ~counter~0 2)} assume true; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,979 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48818#(<= ~counter~0 2)} {48818#(<= ~counter~0 2)} #96#return; {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {48818#(<= ~counter~0 2)} assume !(~r~0 > 0); {48818#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:02,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {48818#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {48843#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,981 INFO L272 TraceCheckUtils]: 35: Hoare triple {48843#(<= ~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)); {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {48843#(<= ~counter~0 3)} ~cond := #in~cond; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {48843#(<= ~counter~0 3)} assume !(0 == ~cond); {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {48843#(<= ~counter~0 3)} assume true; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,983 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48843#(<= ~counter~0 3)} {48843#(<= ~counter~0 3)} #98#return; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {48843#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48843#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:02,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {48843#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {48868#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,985 INFO L272 TraceCheckUtils]: 43: Hoare triple {48868#(<= ~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)); {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,985 INFO L290 TraceCheckUtils]: 44: Hoare triple {48868#(<= ~counter~0 4)} ~cond := #in~cond; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {48868#(<= ~counter~0 4)} assume !(0 == ~cond); {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {48868#(<= ~counter~0 4)} assume true; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,986 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48868#(<= ~counter~0 4)} {48868#(<= ~counter~0 4)} #98#return; {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {48868#(<= ~counter~0 4)} assume !(~r~0 < 0); {48868#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:02,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {48868#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {48893#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,988 INFO L272 TraceCheckUtils]: 51: Hoare triple {48893#(<= ~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)); {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {48893#(<= ~counter~0 5)} ~cond := #in~cond; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {48893#(<= ~counter~0 5)} assume !(0 == ~cond); {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,989 INFO L290 TraceCheckUtils]: 54: Hoare triple {48893#(<= ~counter~0 5)} assume true; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,990 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48893#(<= ~counter~0 5)} {48893#(<= ~counter~0 5)} #94#return; {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {48893#(<= ~counter~0 5)} assume !!(0 != ~r~0); {48893#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:02,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {48893#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {48918#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,991 INFO L272 TraceCheckUtils]: 59: Hoare triple {48918#(<= ~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)); {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {48918#(<= ~counter~0 6)} ~cond := #in~cond; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {48918#(<= ~counter~0 6)} assume !(0 == ~cond); {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {48918#(<= ~counter~0 6)} assume true; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,993 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48918#(<= ~counter~0 6)} {48918#(<= ~counter~0 6)} #96#return; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {48918#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48918#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:02,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {48918#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {48943#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,995 INFO L272 TraceCheckUtils]: 67: Hoare triple {48943#(<= ~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)); {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {48943#(<= ~counter~0 7)} ~cond := #in~cond; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {48943#(<= ~counter~0 7)} assume !(0 == ~cond); {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {48943#(<= ~counter~0 7)} assume true; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,996 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48943#(<= ~counter~0 7)} {48943#(<= ~counter~0 7)} #96#return; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {48943#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48943#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:02,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {48943#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:02,998 INFO L290 TraceCheckUtils]: 74: Hoare triple {48968#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:02,998 INFO L272 TraceCheckUtils]: 75: Hoare triple {48968#(<= ~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)); {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:02,999 INFO L290 TraceCheckUtils]: 76: Hoare triple {48968#(<= ~counter~0 8)} ~cond := #in~cond; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:02,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {48968#(<= ~counter~0 8)} assume !(0 == ~cond); {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:02,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {48968#(<= ~counter~0 8)} assume true; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:03,000 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48968#(<= ~counter~0 8)} {48968#(<= ~counter~0 8)} #96#return; {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:03,000 INFO L290 TraceCheckUtils]: 80: Hoare triple {48968#(<= ~counter~0 8)} assume !(~r~0 > 0); {48968#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:03,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {48968#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {48993#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,002 INFO L272 TraceCheckUtils]: 83: Hoare triple {48993#(<= ~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)); {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {48993#(<= ~counter~0 9)} ~cond := #in~cond; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {48993#(<= ~counter~0 9)} assume !(0 == ~cond); {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,003 INFO L290 TraceCheckUtils]: 86: Hoare triple {48993#(<= ~counter~0 9)} assume true; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,003 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48993#(<= ~counter~0 9)} {48993#(<= ~counter~0 9)} #98#return; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,004 INFO L290 TraceCheckUtils]: 88: Hoare triple {48993#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48993#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:03,004 INFO L290 TraceCheckUtils]: 89: Hoare triple {48993#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,005 INFO L290 TraceCheckUtils]: 90: Hoare triple {49018#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,005 INFO L272 TraceCheckUtils]: 91: Hoare triple {49018#(<= ~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)); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {49018#(<= ~counter~0 10)} ~cond := #in~cond; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,006 INFO L290 TraceCheckUtils]: 93: Hoare triple {49018#(<= ~counter~0 10)} assume !(0 == ~cond); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,006 INFO L290 TraceCheckUtils]: 94: Hoare triple {49018#(<= ~counter~0 10)} assume true; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,007 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {49018#(<= ~counter~0 10)} {49018#(<= ~counter~0 10)} #98#return; {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,007 INFO L290 TraceCheckUtils]: 96: Hoare triple {49018#(<= ~counter~0 10)} assume !(~r~0 < 0); {49018#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:03,007 INFO L290 TraceCheckUtils]: 97: Hoare triple {49018#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49043#(<= |main_#t~post6| 10)} is VALID [2022-04-15 09:05:03,007 INFO L290 TraceCheckUtils]: 98: Hoare triple {49043#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {48737#false} is VALID [2022-04-15 09:05:03,008 INFO L272 TraceCheckUtils]: 99: Hoare triple {48737#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)); {48737#false} is VALID [2022-04-15 09:05:03,008 INFO L290 TraceCheckUtils]: 100: Hoare triple {48737#false} ~cond := #in~cond; {48737#false} is VALID [2022-04-15 09:05:03,008 INFO L290 TraceCheckUtils]: 101: Hoare triple {48737#false} assume 0 == ~cond; {48737#false} is VALID [2022-04-15 09:05:03,008 INFO L290 TraceCheckUtils]: 102: Hoare triple {48737#false} assume !false; {48737#false} is VALID [2022-04-15 09:05:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:05:03,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:05:03,575 INFO L290 TraceCheckUtils]: 102: Hoare triple {48737#false} assume !false; {48737#false} is VALID [2022-04-15 09:05:03,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {48737#false} assume 0 == ~cond; {48737#false} is VALID [2022-04-15 09:05:03,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {48737#false} ~cond := #in~cond; {48737#false} is VALID [2022-04-15 09:05:03,575 INFO L272 TraceCheckUtils]: 99: Hoare triple {48737#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)); {48737#false} is VALID [2022-04-15 09:05:03,575 INFO L290 TraceCheckUtils]: 98: Hoare triple {49071#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {48737#false} is VALID [2022-04-15 09:05:03,576 INFO L290 TraceCheckUtils]: 97: Hoare triple {49075#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49071#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:05:03,576 INFO L290 TraceCheckUtils]: 96: Hoare triple {49075#(< ~counter~0 50)} assume !(~r~0 < 0); {49075#(< ~counter~0 50)} is VALID [2022-04-15 09:05:03,576 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48736#true} {49075#(< ~counter~0 50)} #98#return; {49075#(< ~counter~0 50)} is VALID [2022-04-15 09:05:03,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,577 INFO L290 TraceCheckUtils]: 93: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,577 INFO L272 TraceCheckUtils]: 91: Hoare triple {49075#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,577 INFO L290 TraceCheckUtils]: 90: Hoare triple {49075#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {49075#(< ~counter~0 50)} is VALID [2022-04-15 09:05:03,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {49100#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49075#(< ~counter~0 50)} is VALID [2022-04-15 09:05:03,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {49100#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {49100#(< ~counter~0 49)} is VALID [2022-04-15 09:05:03,579 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48736#true} {49100#(< ~counter~0 49)} #98#return; {49100#(< ~counter~0 49)} is VALID [2022-04-15 09:05:03,579 INFO L290 TraceCheckUtils]: 86: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,579 INFO L290 TraceCheckUtils]: 85: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,579 INFO L290 TraceCheckUtils]: 84: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,579 INFO L272 TraceCheckUtils]: 83: Hoare triple {49100#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,579 INFO L290 TraceCheckUtils]: 82: Hoare triple {49100#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {49100#(< ~counter~0 49)} is VALID [2022-04-15 09:05:03,580 INFO L290 TraceCheckUtils]: 81: Hoare triple {49125#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49100#(< ~counter~0 49)} is VALID [2022-04-15 09:05:03,580 INFO L290 TraceCheckUtils]: 80: Hoare triple {49125#(< ~counter~0 48)} assume !(~r~0 > 0); {49125#(< ~counter~0 48)} is VALID [2022-04-15 09:05:03,581 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48736#true} {49125#(< ~counter~0 48)} #96#return; {49125#(< ~counter~0 48)} is VALID [2022-04-15 09:05:03,581 INFO L290 TraceCheckUtils]: 78: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,581 INFO L290 TraceCheckUtils]: 77: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,581 INFO L290 TraceCheckUtils]: 76: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,581 INFO L272 TraceCheckUtils]: 75: Hoare triple {49125#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,581 INFO L290 TraceCheckUtils]: 74: Hoare triple {49125#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {49125#(< ~counter~0 48)} is VALID [2022-04-15 09:05:03,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {49150#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49125#(< ~counter~0 48)} is VALID [2022-04-15 09:05:03,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {49150#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {49150#(< ~counter~0 47)} is VALID [2022-04-15 09:05:03,583 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48736#true} {49150#(< ~counter~0 47)} #96#return; {49150#(< ~counter~0 47)} is VALID [2022-04-15 09:05:03,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,583 INFO L272 TraceCheckUtils]: 67: Hoare triple {49150#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,583 INFO L290 TraceCheckUtils]: 66: Hoare triple {49150#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {49150#(< ~counter~0 47)} is VALID [2022-04-15 09:05:03,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {49175#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49150#(< ~counter~0 47)} is VALID [2022-04-15 09:05:03,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {49175#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {49175#(< ~counter~0 46)} is VALID [2022-04-15 09:05:03,585 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48736#true} {49175#(< ~counter~0 46)} #96#return; {49175#(< ~counter~0 46)} is VALID [2022-04-15 09:05:03,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,585 INFO L290 TraceCheckUtils]: 60: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,585 INFO L272 TraceCheckUtils]: 59: Hoare triple {49175#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {49175#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {49175#(< ~counter~0 46)} is VALID [2022-04-15 09:05:03,586 INFO L290 TraceCheckUtils]: 57: Hoare triple {49200#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49175#(< ~counter~0 46)} is VALID [2022-04-15 09:05:03,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {49200#(< ~counter~0 45)} assume !!(0 != ~r~0); {49200#(< ~counter~0 45)} is VALID [2022-04-15 09:05:03,586 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48736#true} {49200#(< ~counter~0 45)} #94#return; {49200#(< ~counter~0 45)} is VALID [2022-04-15 09:05:03,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,587 INFO L272 TraceCheckUtils]: 51: Hoare triple {49200#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {49200#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {49200#(< ~counter~0 45)} is VALID [2022-04-15 09:05:03,588 INFO L290 TraceCheckUtils]: 49: Hoare triple {49225#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49200#(< ~counter~0 45)} is VALID [2022-04-15 09:05:03,588 INFO L290 TraceCheckUtils]: 48: Hoare triple {49225#(< ~counter~0 44)} assume !(~r~0 < 0); {49225#(< ~counter~0 44)} is VALID [2022-04-15 09:05:03,588 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48736#true} {49225#(< ~counter~0 44)} #98#return; {49225#(< ~counter~0 44)} is VALID [2022-04-15 09:05:03,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,589 INFO L272 TraceCheckUtils]: 43: Hoare triple {49225#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {49225#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {49225#(< ~counter~0 44)} is VALID [2022-04-15 09:05:03,590 INFO L290 TraceCheckUtils]: 41: Hoare triple {49250#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49225#(< ~counter~0 44)} is VALID [2022-04-15 09:05:03,590 INFO L290 TraceCheckUtils]: 40: Hoare triple {49250#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {49250#(< ~counter~0 43)} is VALID [2022-04-15 09:05:03,590 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48736#true} {49250#(< ~counter~0 43)} #98#return; {49250#(< ~counter~0 43)} is VALID [2022-04-15 09:05:03,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,591 INFO L272 TraceCheckUtils]: 35: Hoare triple {49250#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {49250#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {49250#(< ~counter~0 43)} is VALID [2022-04-15 09:05:03,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {49275#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {49250#(< ~counter~0 43)} is VALID [2022-04-15 09:05:03,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {49275#(< ~counter~0 42)} assume !(~r~0 > 0); {49275#(< ~counter~0 42)} is VALID [2022-04-15 09:05:03,592 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48736#true} {49275#(< ~counter~0 42)} #96#return; {49275#(< ~counter~0 42)} is VALID [2022-04-15 09:05:03,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,593 INFO L272 TraceCheckUtils]: 27: Hoare triple {49275#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {49275#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {49275#(< ~counter~0 42)} is VALID [2022-04-15 09:05:03,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {49300#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49275#(< ~counter~0 42)} is VALID [2022-04-15 09:05:03,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {49300#(< ~counter~0 41)} assume !!(0 != ~r~0); {49300#(< ~counter~0 41)} is VALID [2022-04-15 09:05:03,594 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48736#true} {49300#(< ~counter~0 41)} #94#return; {49300#(< ~counter~0 41)} is VALID [2022-04-15 09:05:03,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,594 INFO L272 TraceCheckUtils]: 19: Hoare triple {49300#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {49300#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {49300#(< ~counter~0 41)} is VALID [2022-04-15 09:05:03,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {49325#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49300#(< ~counter~0 41)} is VALID [2022-04-15 09:05:03,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {49325#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,596 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48736#true} {49325#(< ~counter~0 40)} #92#return; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {49325#(< ~counter~0 40)} 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)); {48736#true} is VALID [2022-04-15 09:05:03,597 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48736#true} {49325#(< ~counter~0 40)} #90#return; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {48736#true} assume true; {48736#true} is VALID [2022-04-15 09:05:03,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {48736#true} assume !(0 == ~cond); {48736#true} is VALID [2022-04-15 09:05:03,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {48736#true} ~cond := #in~cond; {48736#true} is VALID [2022-04-15 09:05:03,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {49325#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48736#true} is VALID [2022-04-15 09:05:03,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {49325#(< ~counter~0 40)} 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; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {49325#(< ~counter~0 40)} call #t~ret9 := main(); {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49325#(< ~counter~0 40)} {48736#true} #102#return; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {49325#(< ~counter~0 40)} assume true; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {48736#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; {49325#(< ~counter~0 40)} is VALID [2022-04-15 09:05:03,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {48736#true} call ULTIMATE.init(); {48736#true} is VALID [2022-04-15 09:05:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 09:05:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:05:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335968650] [2022-04-15 09:05:03,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:05:03,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386673189] [2022-04-15 09:05:03,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386673189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:05:03,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:05:03,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 09:05:03,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:05:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298731814] [2022-04-15 09:05:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298731814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:03,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:03,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 09:05:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971221605] [2022-04-15 09:05:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:05:03,600 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-15 09:05:03,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:05:03,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:03,671 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-15 09:05:03,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 09:05:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:03,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 09:05:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 09:05:03,672 INFO L87 Difference]: Start difference. First operand 396 states and 504 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:04,919 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-15 09:05:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 09:05:04,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 103 [2022-04-15 09:05:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:05:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 09:05:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 09:05:04,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-15 09:05:05,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:05,074 INFO L225 Difference]: With dead ends: 443 [2022-04-15 09:05:05,075 INFO L226 Difference]: Without dead ends: 432 [2022-04-15 09:05:05,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=438, Invalid=618, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 09:05:05,097 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:05:05,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 256 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:05:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-04-15 09:05:05,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2022-04-15 09:05:05,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:05:05,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 432 states. Second operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 09:05:05,743 INFO L74 IsIncluded]: Start isIncluded. First operand 432 states. Second operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 09:05:05,744 INFO L87 Difference]: Start difference. First operand 432 states. Second operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 09:05:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:05,751 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-15 09:05:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 550 transitions. [2022-04-15 09:05:05,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:05,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:05,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 432 states. [2022-04-15 09:05:05,752 INFO L87 Difference]: Start difference. First operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 432 states. [2022-04-15 09:05:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:05,760 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-15 09:05:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 550 transitions. [2022-04-15 09:05:05,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:05,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:05,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:05:05,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:05:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 308 states have (on average 1.1883116883116882) internal successors, (366), 315 states have internal predecessors, (366), 82 states have call successors, (82), 24 states have call predecessors, (82), 22 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 09:05:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 528 transitions. [2022-04-15 09:05:05,770 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 528 transitions. Word has length 103 [2022-04-15 09:05:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:05:05,770 INFO L478 AbstractCegarLoop]: Abstraction has 413 states and 528 transitions. [2022-04-15 09:05:05,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:05,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 413 states and 528 transitions. [2022-04-15 09:05:18,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 526 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 528 transitions. [2022-04-15 09:05:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 09:05:18,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:18,318 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 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-15 09:05:18,336 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-15 09:05:18,519 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-15 09:05:18,519 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-15 09:05:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661087114] [2022-04-15 09:05:18,520 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-15 09:05:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518050234] [2022-04-15 09:05:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:18,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:18,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [271675228] [2022-04-15 09:05:18,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:05:18,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:18,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:18,535 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:05:18,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 09:05:18,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:05:18,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:18,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:05:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:18,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:19,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {51969#true} call ULTIMATE.init(); {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {51969#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; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51969#true} {51969#true} #102#return; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {51969#true} call #t~ret9 := main(); {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {51969#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; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {51969#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51969#true} {51969#true} #90#return; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L272 TraceCheckUtils]: 11: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51969#true} {51969#true} #92#return; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {51969#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {51969#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {51969#true} assume !!(#t~post6 < 50);havoc #t~post6; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51969#true} {51969#true} #94#return; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {51969#true} assume !!(0 != ~r~0); {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {51969#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {51969#true} assume !!(#t~post7 < 50);havoc #t~post7; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L272 TraceCheckUtils]: 27: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51969#true} {51969#true} #96#return; {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {51969#true} assume !(~r~0 > 0); {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {51969#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {51969#true} assume !!(#t~post8 < 50);havoc #t~post8; {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L272 TraceCheckUtils]: 35: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,327 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51969#true} {51969#true} #98#return; {51969#true} is VALID [2022-04-15 09:05:19,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {51969#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,329 INFO L272 TraceCheckUtils]: 43: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,330 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51969#true} {52094#(< (+ main_~r~0 2) main_~u~0)} #98#return; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,331 INFO L272 TraceCheckUtils]: 51: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,331 INFO L290 TraceCheckUtils]: 53: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,331 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51969#true} {52094#(< (+ main_~r~0 2) main_~u~0)} #94#return; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,332 INFO L272 TraceCheckUtils]: 59: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,332 INFO L290 TraceCheckUtils]: 60: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,333 INFO L290 TraceCheckUtils]: 62: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,333 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51969#true} {52094#(< (+ main_~r~0 2) main_~u~0)} #96#return; {52094#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 09:05:19,334 INFO L290 TraceCheckUtils]: 64: Hoare triple {52094#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 09:05:19,334 INFO L290 TraceCheckUtils]: 65: Hoare triple {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 09:05:19,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 09:05:19,334 INFO L272 TraceCheckUtils]: 67: Hoare triple {52167#(< (+ main_~v~0 main_~r~0) main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,334 INFO L290 TraceCheckUtils]: 70: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,335 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51969#true} {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 09:05:19,336 INFO L290 TraceCheckUtils]: 72: Hoare triple {52167#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,336 INFO L272 TraceCheckUtils]: 75: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~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)); {51969#true} is VALID [2022-04-15 09:05:19,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,337 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51969#true} {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,338 INFO L290 TraceCheckUtils]: 82: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,338 INFO L272 TraceCheckUtils]: 83: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~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)); {51969#true} is VALID [2022-04-15 09:05:19,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,338 INFO L290 TraceCheckUtils]: 86: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,338 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51969#true} {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:05:19,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {52192#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 09:05:19,339 INFO L290 TraceCheckUtils]: 89: Hoare triple {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 09:05:19,340 INFO L290 TraceCheckUtils]: 90: Hoare triple {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 09:05:19,340 INFO L272 TraceCheckUtils]: 91: Hoare triple {52241#(< 0 (div (+ (- 1) main_~r~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)); {51969#true} is VALID [2022-04-15 09:05:19,340 INFO L290 TraceCheckUtils]: 92: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,340 INFO L290 TraceCheckUtils]: 93: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,340 INFO L290 TraceCheckUtils]: 94: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,340 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51969#true} {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 09:05:19,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {52241#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51970#false} is VALID [2022-04-15 09:05:19,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {51970#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51970#false} is VALID [2022-04-15 09:05:19,341 INFO L290 TraceCheckUtils]: 98: Hoare triple {51970#false} assume !(#t~post8 < 50);havoc #t~post8; {51970#false} is VALID [2022-04-15 09:05:19,341 INFO L290 TraceCheckUtils]: 99: Hoare triple {51970#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51970#false} is VALID [2022-04-15 09:05:19,341 INFO L290 TraceCheckUtils]: 100: Hoare triple {51970#false} assume !(#t~post6 < 50);havoc #t~post6; {51970#false} is VALID [2022-04-15 09:05:19,342 INFO L272 TraceCheckUtils]: 101: Hoare triple {51970#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)); {51970#false} is VALID [2022-04-15 09:05:19,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {51970#false} ~cond := #in~cond; {51970#false} is VALID [2022-04-15 09:05:19,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {51970#false} assume 0 == ~cond; {51970#false} is VALID [2022-04-15 09:05:19,342 INFO L290 TraceCheckUtils]: 104: Hoare triple {51970#false} assume !false; {51970#false} is VALID [2022-04-15 09:05:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 09:05:19,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 104: Hoare triple {51970#false} assume !false; {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 103: Hoare triple {51970#false} assume 0 == ~cond; {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {51970#false} ~cond := #in~cond; {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L272 TraceCheckUtils]: 101: Hoare triple {51970#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)); {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 100: Hoare triple {51970#false} assume !(#t~post6 < 50);havoc #t~post6; {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 99: Hoare triple {51970#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 98: Hoare triple {51970#false} assume !(#t~post8 < 50);havoc #t~post8; {51970#false} is VALID [2022-04-15 09:05:19,700 INFO L290 TraceCheckUtils]: 97: Hoare triple {51970#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51970#false} is VALID [2022-04-15 09:05:19,701 INFO L290 TraceCheckUtils]: 96: Hoare triple {52314#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51970#false} is VALID [2022-04-15 09:05:19,701 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51969#true} {52314#(not (< main_~r~0 0))} #98#return; {52314#(not (< main_~r~0 0))} is VALID [2022-04-15 09:05:19,701 INFO L290 TraceCheckUtils]: 94: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,701 INFO L290 TraceCheckUtils]: 93: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,701 INFO L290 TraceCheckUtils]: 92: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,701 INFO L272 TraceCheckUtils]: 91: Hoare triple {52314#(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)); {51969#true} is VALID [2022-04-15 09:05:19,702 INFO L290 TraceCheckUtils]: 90: Hoare triple {52314#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {52314#(not (< main_~r~0 0))} is VALID [2022-04-15 09:05:19,702 INFO L290 TraceCheckUtils]: 89: Hoare triple {52314#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52314#(not (< main_~r~0 0))} is VALID [2022-04-15 09:05:19,703 INFO L290 TraceCheckUtils]: 88: Hoare triple {52339#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52314#(not (< main_~r~0 0))} is VALID [2022-04-15 09:05:19,703 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51969#true} {52339#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,703 INFO L290 TraceCheckUtils]: 86: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,703 INFO L290 TraceCheckUtils]: 85: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,703 INFO L290 TraceCheckUtils]: 84: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,703 INFO L272 TraceCheckUtils]: 83: Hoare triple {52339#(<= 0 (+ main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,704 INFO L290 TraceCheckUtils]: 82: Hoare triple {52339#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,704 INFO L290 TraceCheckUtils]: 81: Hoare triple {52339#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,704 INFO L290 TraceCheckUtils]: 80: Hoare triple {52339#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,705 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51969#true} {52339#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,705 INFO L290 TraceCheckUtils]: 78: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,705 INFO L290 TraceCheckUtils]: 77: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,705 INFO L272 TraceCheckUtils]: 75: Hoare triple {52339#(<= 0 (+ main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {52339#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {52339#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,706 INFO L290 TraceCheckUtils]: 72: Hoare triple {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52339#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:05:19,707 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51969#true} {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:05:19,707 INFO L290 TraceCheckUtils]: 70: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,707 INFO L272 TraceCheckUtils]: 67: Hoare triple {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~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)); {51969#true} is VALID [2022-04-15 09:05:19,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:05:19,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:05:19,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {52413#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52388#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:05:19,709 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51969#true} {52413#(<= main_~r~0 main_~u~0)} #96#return; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,709 INFO L272 TraceCheckUtils]: 59: Hoare triple {52413#(<= main_~r~0 main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {52413#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {52413#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {52413#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,711 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51969#true} {52413#(<= main_~r~0 main_~u~0)} #94#return; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,711 INFO L290 TraceCheckUtils]: 54: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,711 INFO L290 TraceCheckUtils]: 53: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,711 INFO L272 TraceCheckUtils]: 51: Hoare triple {52413#(<= main_~r~0 main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {52413#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 50);havoc #t~post6; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {52413#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {52413#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,712 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51969#true} {52413#(<= main_~r~0 main_~u~0)} #98#return; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,712 INFO L272 TraceCheckUtils]: 43: Hoare triple {52413#(<= main_~r~0 main_~u~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)); {51969#true} is VALID [2022-04-15 09:05:19,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {52413#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 50);havoc #t~post8; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {52413#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {51969#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52413#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:05:19,714 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51969#true} {51969#true} #98#return; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {51969#true} assume !!(#t~post8 < 50);havoc #t~post8; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {51969#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {51969#true} assume !(~r~0 > 0); {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51969#true} {51969#true} #96#return; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L272 TraceCheckUtils]: 27: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {51969#true} assume !!(#t~post7 < 50);havoc #t~post7; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {51969#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {51969#true} assume !!(0 != ~r~0); {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51969#true} {51969#true} #94#return; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L272 TraceCheckUtils]: 19: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {51969#true} assume !!(#t~post6 < 50);havoc #t~post6; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {51969#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {51969#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51969#true} {51969#true} #92#return; {51969#true} is VALID [2022-04-15 09:05:19,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L272 TraceCheckUtils]: 11: Hoare triple {51969#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)); {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51969#true} {51969#true} #90#return; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {51969#true} assume !(0 == ~cond); {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {51969#true} ~cond := #in~cond; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {51969#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {51969#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; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {51969#true} call #t~ret9 := main(); {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51969#true} {51969#true} #102#return; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {51969#true} assume true; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {51969#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; {51969#true} is VALID [2022-04-15 09:05:19,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {51969#true} call ULTIMATE.init(); {51969#true} is VALID [2022-04-15 09:05:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 09:05:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:05:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518050234] [2022-04-15 09:05:19,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:05:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271675228] [2022-04-15 09:05:19,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271675228] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:05:19,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:05:19,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 09:05:19,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:05:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661087114] [2022-04-15 09:05:19,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661087114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:19,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:19,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:05:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38973679] [2022-04-15 09:05:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:05:19,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-15 09:05:19,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:05:19,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:05:19,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:19,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:05:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:19,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:05:19,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:05:19,778 INFO L87 Difference]: Start difference. First operand 413 states and 528 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:05:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:21,220 INFO L93 Difference]: Finished difference Result 685 states and 934 transitions. [2022-04-15 09:05:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 09:05:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-15 09:05:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:05:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:05:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 09:05:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:05:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 09:05:21,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-15 09:05:21,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:21,333 INFO L225 Difference]: With dead ends: 685 [2022-04-15 09:05:21,333 INFO L226 Difference]: Without dead ends: 624 [2022-04-15 09:05:21,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:05:21,333 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 41 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:05:21,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 271 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:05:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-04-15 09:05:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 540. [2022-04-15 09:05:22,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:05:22,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:22,003 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:22,003 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:22,018 INFO L93 Difference]: Finished difference Result 624 states and 843 transitions. [2022-04-15 09:05:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 843 transitions. [2022-04-15 09:05:22,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:22,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:22,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 624 states. [2022-04-15 09:05:22,024 INFO L87 Difference]: Start difference. First operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 624 states. [2022-04-15 09:05:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:22,038 INFO L93 Difference]: Finished difference Result 624 states and 843 transitions. [2022-04-15 09:05:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 843 transitions. [2022-04-15 09:05:22,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:22,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:22,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:05:22,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:05:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 403 states have (on average 1.2307692307692308) internal successors, (496), 413 states have internal predecessors, (496), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2022-04-15 09:05:22,054 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 105 [2022-04-15 09:05:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:05:22,054 INFO L478 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2022-04-15 09:05:22,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:05:22,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 540 states and 722 transitions. [2022-04-15 09:05:38,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 722 edges. 717 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2022-04-15 09:05:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 09:05:38,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:38,152 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 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-15 09:05:38,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 09:05:38,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:38,353 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-15 09:05:38,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:38,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497751263] [2022-04-15 09:05:38,354 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:38,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-15 09:05:38,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:38,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839876667] [2022-04-15 09:05:38,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:38,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:38,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:38,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375110958] [2022-04-15 09:05:38,365 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:05:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:38,366 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:05:38,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 09:05:38,482 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:05:38,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:38,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:05:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:38,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:38,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {56312#true} call ULTIMATE.init(); {56312#true} is VALID [2022-04-15 09:05:38,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {56312#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; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {56320#(<= ~counter~0 0)} assume true; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56320#(<= ~counter~0 0)} {56312#true} #102#return; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {56320#(<= ~counter~0 0)} call #t~ret9 := main(); {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {56320#(<= ~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; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,948 INFO L272 TraceCheckUtils]: 6: Hoare triple {56320#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {56320#(<= ~counter~0 0)} ~cond := #in~cond; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {56320#(<= ~counter~0 0)} assume !(0 == ~cond); {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {56320#(<= ~counter~0 0)} assume true; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56320#(<= ~counter~0 0)} {56320#(<= ~counter~0 0)} #90#return; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,949 INFO L272 TraceCheckUtils]: 11: Hoare triple {56320#(<= ~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)); {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {56320#(<= ~counter~0 0)} ~cond := #in~cond; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {56320#(<= ~counter~0 0)} assume !(0 == ~cond); {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {56320#(<= ~counter~0 0)} assume true; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,950 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56320#(<= ~counter~0 0)} {56320#(<= ~counter~0 0)} #92#return; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {56320#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56320#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:38,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {56320#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {56369#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,953 INFO L272 TraceCheckUtils]: 19: Hoare triple {56369#(<= ~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)); {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {56369#(<= ~counter~0 1)} ~cond := #in~cond; {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {56369#(<= ~counter~0 1)} assume !(0 == ~cond); {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {56369#(<= ~counter~0 1)} assume true; {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,954 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56369#(<= ~counter~0 1)} {56369#(<= ~counter~0 1)} #94#return; {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {56369#(<= ~counter~0 1)} assume !!(0 != ~r~0); {56369#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:38,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {56369#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {56394#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,955 INFO L272 TraceCheckUtils]: 27: Hoare triple {56394#(<= ~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)); {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {56394#(<= ~counter~0 2)} ~cond := #in~cond; {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {56394#(<= ~counter~0 2)} assume !(0 == ~cond); {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {56394#(<= ~counter~0 2)} assume true; {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,956 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56394#(<= ~counter~0 2)} {56394#(<= ~counter~0 2)} #96#return; {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {56394#(<= ~counter~0 2)} assume !(~r~0 > 0); {56394#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:38,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {56394#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {56419#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,958 INFO L272 TraceCheckUtils]: 35: Hoare triple {56419#(<= ~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)); {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {56419#(<= ~counter~0 3)} ~cond := #in~cond; {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,958 INFO L290 TraceCheckUtils]: 37: Hoare triple {56419#(<= ~counter~0 3)} assume !(0 == ~cond); {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {56419#(<= ~counter~0 3)} assume true; {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,959 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56419#(<= ~counter~0 3)} {56419#(<= ~counter~0 3)} #98#return; {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {56419#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56419#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:38,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {56419#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {56444#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,961 INFO L272 TraceCheckUtils]: 43: Hoare triple {56444#(<= ~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)); {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {56444#(<= ~counter~0 4)} ~cond := #in~cond; {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {56444#(<= ~counter~0 4)} assume !(0 == ~cond); {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {56444#(<= ~counter~0 4)} assume true; {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,962 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56444#(<= ~counter~0 4)} {56444#(<= ~counter~0 4)} #98#return; {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,962 INFO L290 TraceCheckUtils]: 48: Hoare triple {56444#(<= ~counter~0 4)} assume !(~r~0 < 0); {56444#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:38,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {56444#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {56469#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,963 INFO L272 TraceCheckUtils]: 51: Hoare triple {56469#(<= ~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)); {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {56469#(<= ~counter~0 5)} ~cond := #in~cond; {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,964 INFO L290 TraceCheckUtils]: 53: Hoare triple {56469#(<= ~counter~0 5)} assume !(0 == ~cond); {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {56469#(<= ~counter~0 5)} assume true; {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,964 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56469#(<= ~counter~0 5)} {56469#(<= ~counter~0 5)} #94#return; {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {56469#(<= ~counter~0 5)} assume !!(0 != ~r~0); {56469#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:38,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {56469#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {56494#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,966 INFO L272 TraceCheckUtils]: 59: Hoare triple {56494#(<= ~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)); {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {56494#(<= ~counter~0 6)} ~cond := #in~cond; {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {56494#(<= ~counter~0 6)} assume !(0 == ~cond); {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {56494#(<= ~counter~0 6)} assume true; {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,967 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56494#(<= ~counter~0 6)} {56494#(<= ~counter~0 6)} #96#return; {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {56494#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56494#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:38,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {56494#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,968 INFO L290 TraceCheckUtils]: 66: Hoare triple {56519#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,968 INFO L272 TraceCheckUtils]: 67: Hoare triple {56519#(<= ~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)); {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {56519#(<= ~counter~0 7)} ~cond := #in~cond; {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {56519#(<= ~counter~0 7)} assume !(0 == ~cond); {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {56519#(<= ~counter~0 7)} assume true; {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,970 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56519#(<= ~counter~0 7)} {56519#(<= ~counter~0 7)} #96#return; {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {56519#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56519#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:38,970 INFO L290 TraceCheckUtils]: 73: Hoare triple {56519#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,971 INFO L290 TraceCheckUtils]: 74: Hoare triple {56544#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,971 INFO L272 TraceCheckUtils]: 75: Hoare triple {56544#(<= ~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)); {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,971 INFO L290 TraceCheckUtils]: 76: Hoare triple {56544#(<= ~counter~0 8)} ~cond := #in~cond; {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,972 INFO L290 TraceCheckUtils]: 77: Hoare triple {56544#(<= ~counter~0 8)} assume !(0 == ~cond); {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,972 INFO L290 TraceCheckUtils]: 78: Hoare triple {56544#(<= ~counter~0 8)} assume true; {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,972 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56544#(<= ~counter~0 8)} {56544#(<= ~counter~0 8)} #96#return; {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,973 INFO L290 TraceCheckUtils]: 80: Hoare triple {56544#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56544#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:38,973 INFO L290 TraceCheckUtils]: 81: Hoare triple {56544#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,973 INFO L290 TraceCheckUtils]: 82: Hoare triple {56569#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,974 INFO L272 TraceCheckUtils]: 83: Hoare triple {56569#(<= ~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)); {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,974 INFO L290 TraceCheckUtils]: 84: Hoare triple {56569#(<= ~counter~0 9)} ~cond := #in~cond; {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,974 INFO L290 TraceCheckUtils]: 85: Hoare triple {56569#(<= ~counter~0 9)} assume !(0 == ~cond); {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,975 INFO L290 TraceCheckUtils]: 86: Hoare triple {56569#(<= ~counter~0 9)} assume true; {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,975 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56569#(<= ~counter~0 9)} {56569#(<= ~counter~0 9)} #96#return; {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,975 INFO L290 TraceCheckUtils]: 88: Hoare triple {56569#(<= ~counter~0 9)} assume !(~r~0 > 0); {56569#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:38,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {56569#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {56594#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,977 INFO L272 TraceCheckUtils]: 91: Hoare triple {56594#(<= ~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)); {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,977 INFO L290 TraceCheckUtils]: 92: Hoare triple {56594#(<= ~counter~0 10)} ~cond := #in~cond; {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,977 INFO L290 TraceCheckUtils]: 93: Hoare triple {56594#(<= ~counter~0 10)} assume !(0 == ~cond); {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,977 INFO L290 TraceCheckUtils]: 94: Hoare triple {56594#(<= ~counter~0 10)} assume true; {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,978 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56594#(<= ~counter~0 10)} {56594#(<= ~counter~0 10)} #98#return; {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,978 INFO L290 TraceCheckUtils]: 96: Hoare triple {56594#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56594#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:38,978 INFO L290 TraceCheckUtils]: 97: Hoare triple {56594#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56619#(<= |main_#t~post8| 10)} is VALID [2022-04-15 09:05:38,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {56619#(<= |main_#t~post8| 10)} assume !(#t~post8 < 50);havoc #t~post8; {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {56313#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {56313#false} assume !(#t~post6 < 50);havoc #t~post6; {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L272 TraceCheckUtils]: 101: Hoare triple {56313#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)); {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L290 TraceCheckUtils]: 102: Hoare triple {56313#false} ~cond := #in~cond; {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L290 TraceCheckUtils]: 103: Hoare triple {56313#false} assume 0 == ~cond; {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L290 TraceCheckUtils]: 104: Hoare triple {56313#false} assume !false; {56313#false} is VALID [2022-04-15 09:05:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:05:38,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:05:39,502 INFO L290 TraceCheckUtils]: 104: Hoare triple {56313#false} assume !false; {56313#false} is VALID [2022-04-15 09:05:39,502 INFO L290 TraceCheckUtils]: 103: Hoare triple {56313#false} assume 0 == ~cond; {56313#false} is VALID [2022-04-15 09:05:39,502 INFO L290 TraceCheckUtils]: 102: Hoare triple {56313#false} ~cond := #in~cond; {56313#false} is VALID [2022-04-15 09:05:39,502 INFO L272 TraceCheckUtils]: 101: Hoare triple {56313#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)); {56313#false} is VALID [2022-04-15 09:05:39,503 INFO L290 TraceCheckUtils]: 100: Hoare triple {56313#false} assume !(#t~post6 < 50);havoc #t~post6; {56313#false} is VALID [2022-04-15 09:05:39,503 INFO L290 TraceCheckUtils]: 99: Hoare triple {56313#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56313#false} is VALID [2022-04-15 09:05:39,503 INFO L290 TraceCheckUtils]: 98: Hoare triple {56659#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {56313#false} is VALID [2022-04-15 09:05:39,503 INFO L290 TraceCheckUtils]: 97: Hoare triple {56663#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56659#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:05:39,503 INFO L290 TraceCheckUtils]: 96: Hoare triple {56663#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56663#(< ~counter~0 50)} is VALID [2022-04-15 09:05:39,504 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {56312#true} {56663#(< ~counter~0 50)} #98#return; {56663#(< ~counter~0 50)} is VALID [2022-04-15 09:05:39,504 INFO L290 TraceCheckUtils]: 94: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,504 INFO L290 TraceCheckUtils]: 93: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,504 INFO L272 TraceCheckUtils]: 91: Hoare triple {56663#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {56663#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {56663#(< ~counter~0 50)} is VALID [2022-04-15 09:05:39,506 INFO L290 TraceCheckUtils]: 89: Hoare triple {56688#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56663#(< ~counter~0 50)} is VALID [2022-04-15 09:05:39,506 INFO L290 TraceCheckUtils]: 88: Hoare triple {56688#(< ~counter~0 49)} assume !(~r~0 > 0); {56688#(< ~counter~0 49)} is VALID [2022-04-15 09:05:39,506 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {56312#true} {56688#(< ~counter~0 49)} #96#return; {56688#(< ~counter~0 49)} is VALID [2022-04-15 09:05:39,506 INFO L290 TraceCheckUtils]: 86: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,507 INFO L290 TraceCheckUtils]: 85: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,507 INFO L290 TraceCheckUtils]: 84: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,507 INFO L272 TraceCheckUtils]: 83: Hoare triple {56688#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,507 INFO L290 TraceCheckUtils]: 82: Hoare triple {56688#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {56688#(< ~counter~0 49)} is VALID [2022-04-15 09:05:39,508 INFO L290 TraceCheckUtils]: 81: Hoare triple {56713#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56688#(< ~counter~0 49)} is VALID [2022-04-15 09:05:39,508 INFO L290 TraceCheckUtils]: 80: Hoare triple {56713#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56713#(< ~counter~0 48)} is VALID [2022-04-15 09:05:39,508 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {56312#true} {56713#(< ~counter~0 48)} #96#return; {56713#(< ~counter~0 48)} is VALID [2022-04-15 09:05:39,508 INFO L290 TraceCheckUtils]: 78: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,509 INFO L272 TraceCheckUtils]: 75: Hoare triple {56713#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,509 INFO L290 TraceCheckUtils]: 74: Hoare triple {56713#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {56713#(< ~counter~0 48)} is VALID [2022-04-15 09:05:39,509 INFO L290 TraceCheckUtils]: 73: Hoare triple {56738#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56713#(< ~counter~0 48)} is VALID [2022-04-15 09:05:39,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {56738#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56738#(< ~counter~0 47)} is VALID [2022-04-15 09:05:39,510 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {56312#true} {56738#(< ~counter~0 47)} #96#return; {56738#(< ~counter~0 47)} is VALID [2022-04-15 09:05:39,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,510 INFO L290 TraceCheckUtils]: 69: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,510 INFO L290 TraceCheckUtils]: 68: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,511 INFO L272 TraceCheckUtils]: 67: Hoare triple {56738#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,511 INFO L290 TraceCheckUtils]: 66: Hoare triple {56738#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {56738#(< ~counter~0 47)} is VALID [2022-04-15 09:05:39,511 INFO L290 TraceCheckUtils]: 65: Hoare triple {56763#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56738#(< ~counter~0 47)} is VALID [2022-04-15 09:05:39,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {56763#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {56763#(< ~counter~0 46)} is VALID [2022-04-15 09:05:39,512 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {56312#true} {56763#(< ~counter~0 46)} #96#return; {56763#(< ~counter~0 46)} is VALID [2022-04-15 09:05:39,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,512 INFO L290 TraceCheckUtils]: 61: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,512 INFO L290 TraceCheckUtils]: 60: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,512 INFO L272 TraceCheckUtils]: 59: Hoare triple {56763#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {56763#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {56763#(< ~counter~0 46)} is VALID [2022-04-15 09:05:39,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {56788#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56763#(< ~counter~0 46)} is VALID [2022-04-15 09:05:39,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {56788#(< ~counter~0 45)} assume !!(0 != ~r~0); {56788#(< ~counter~0 45)} is VALID [2022-04-15 09:05:39,514 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56312#true} {56788#(< ~counter~0 45)} #94#return; {56788#(< ~counter~0 45)} is VALID [2022-04-15 09:05:39,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,514 INFO L272 TraceCheckUtils]: 51: Hoare triple {56788#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,515 INFO L290 TraceCheckUtils]: 50: Hoare triple {56788#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {56788#(< ~counter~0 45)} is VALID [2022-04-15 09:05:39,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {56813#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56788#(< ~counter~0 45)} is VALID [2022-04-15 09:05:39,515 INFO L290 TraceCheckUtils]: 48: Hoare triple {56813#(< ~counter~0 44)} assume !(~r~0 < 0); {56813#(< ~counter~0 44)} is VALID [2022-04-15 09:05:39,516 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {56312#true} {56813#(< ~counter~0 44)} #98#return; {56813#(< ~counter~0 44)} is VALID [2022-04-15 09:05:39,516 INFO L290 TraceCheckUtils]: 46: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,516 INFO L272 TraceCheckUtils]: 43: Hoare triple {56813#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {56813#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {56813#(< ~counter~0 44)} is VALID [2022-04-15 09:05:39,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {56838#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56813#(< ~counter~0 44)} is VALID [2022-04-15 09:05:39,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {56838#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {56838#(< ~counter~0 43)} is VALID [2022-04-15 09:05:39,518 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {56312#true} {56838#(< ~counter~0 43)} #98#return; {56838#(< ~counter~0 43)} is VALID [2022-04-15 09:05:39,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,518 INFO L272 TraceCheckUtils]: 35: Hoare triple {56838#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {56838#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {56838#(< ~counter~0 43)} is VALID [2022-04-15 09:05:39,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {56863#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {56838#(< ~counter~0 43)} is VALID [2022-04-15 09:05:39,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {56863#(< ~counter~0 42)} assume !(~r~0 > 0); {56863#(< ~counter~0 42)} is VALID [2022-04-15 09:05:39,520 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {56312#true} {56863#(< ~counter~0 42)} #96#return; {56863#(< ~counter~0 42)} is VALID [2022-04-15 09:05:39,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,520 INFO L272 TraceCheckUtils]: 27: Hoare triple {56863#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {56863#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {56863#(< ~counter~0 42)} is VALID [2022-04-15 09:05:39,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {56888#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {56863#(< ~counter~0 42)} is VALID [2022-04-15 09:05:39,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {56888#(< ~counter~0 41)} assume !!(0 != ~r~0); {56888#(< ~counter~0 41)} is VALID [2022-04-15 09:05:39,522 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {56312#true} {56888#(< ~counter~0 41)} #94#return; {56888#(< ~counter~0 41)} is VALID [2022-04-15 09:05:39,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,522 INFO L272 TraceCheckUtils]: 19: Hoare triple {56888#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {56888#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {56888#(< ~counter~0 41)} is VALID [2022-04-15 09:05:39,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {56913#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {56888#(< ~counter~0 41)} is VALID [2022-04-15 09:05:39,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {56913#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,523 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {56312#true} {56913#(< ~counter~0 40)} #92#return; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L272 TraceCheckUtils]: 11: Hoare triple {56913#(< ~counter~0 40)} 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)); {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {56312#true} {56913#(< ~counter~0 40)} #90#return; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {56312#true} assume true; {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {56312#true} assume !(0 == ~cond); {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {56312#true} ~cond := #in~cond; {56312#true} is VALID [2022-04-15 09:05:39,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {56913#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {56312#true} is VALID [2022-04-15 09:05:39,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {56913#(< ~counter~0 40)} 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; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {56913#(< ~counter~0 40)} call #t~ret9 := main(); {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56913#(< ~counter~0 40)} {56312#true} #102#return; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {56913#(< ~counter~0 40)} assume true; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {56312#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; {56913#(< ~counter~0 40)} is VALID [2022-04-15 09:05:39,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {56312#true} call ULTIMATE.init(); {56312#true} is VALID [2022-04-15 09:05:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 09:05:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:05:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839876667] [2022-04-15 09:05:39,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:05:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375110958] [2022-04-15 09:05:39,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375110958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:05:39,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:05:39,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 09:05:39,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:05:39,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497751263] [2022-04-15 09:05:39,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497751263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:39,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:39,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 09:05:39,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370791453] [2022-04-15 09:05:39,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:05:39,528 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-15 09:05:39,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:05:39,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:39,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:39,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 09:05:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:39,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 09:05:39,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 09:05:39,609 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:41,202 INFO L93 Difference]: Finished difference Result 793 states and 1103 transitions. [2022-04-15 09:05:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 09:05:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 105 [2022-04-15 09:05:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:05:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 09:05:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 09:05:41,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-15 09:05:41,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:41,355 INFO L225 Difference]: With dead ends: 793 [2022-04-15 09:05:41,356 INFO L226 Difference]: Without dead ends: 568 [2022-04-15 09:05:41,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=657, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 09:05:41,357 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:05:41,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 254 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:05:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-04-15 09:05:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 558. [2022-04-15 09:05:42,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:05:42,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 568 states. Second operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:42,311 INFO L74 IsIncluded]: Start isIncluded. First operand 568 states. Second operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:42,312 INFO L87 Difference]: Start difference. First operand 568 states. Second operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:42,323 INFO L93 Difference]: Finished difference Result 568 states and 754 transitions. [2022-04-15 09:05:42,323 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 754 transitions. [2022-04-15 09:05:42,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:42,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:42,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 568 states. [2022-04-15 09:05:42,325 INFO L87 Difference]: Start difference. First operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 568 states. [2022-04-15 09:05:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:42,337 INFO L93 Difference]: Finished difference Result 568 states and 754 transitions. [2022-04-15 09:05:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 754 transitions. [2022-04-15 09:05:42,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:42,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:42,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:05:42,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:05:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 421 states have (on average 1.2304038004750595) internal successors, (518), 425 states have internal predecessors, (518), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 744 transitions. [2022-04-15 09:05:42,353 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 744 transitions. Word has length 105 [2022-04-15 09:05:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:05:42,353 INFO L478 AbstractCegarLoop]: Abstraction has 558 states and 744 transitions. [2022-04-15 09:05:42,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:42,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 558 states and 744 transitions. [2022-04-15 09:05:55,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 744 edges. 741 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 744 transitions. [2022-04-15 09:05:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 09:05:55,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:05:55,232 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 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-15 09:05:55,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 09:05:55,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 09:05:55,432 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:05:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:05:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-15 09:05:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:55,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2070994043] [2022-04-15 09:05:55,433 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:05:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-15 09:05:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:05:55,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342751048] [2022-04-15 09:05:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:05:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:05:55,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:05:55,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442315420] [2022-04-15 09:05:55,444 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:05:55,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:05:55,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:05:55,451 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:05:55,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 09:05:55,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:05:55,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:05:55,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:05:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:05:55,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:05:56,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {60821#true} call ULTIMATE.init(); {60821#true} is VALID [2022-04-15 09:05:56,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {60821#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; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {60829#(<= ~counter~0 0)} assume true; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60829#(<= ~counter~0 0)} {60821#true} #102#return; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {60829#(<= ~counter~0 0)} call #t~ret9 := main(); {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {60829#(<= ~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; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {60829#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {60829#(<= ~counter~0 0)} ~cond := #in~cond; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {60829#(<= ~counter~0 0)} assume !(0 == ~cond); {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {60829#(<= ~counter~0 0)} assume true; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60829#(<= ~counter~0 0)} {60829#(<= ~counter~0 0)} #90#return; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {60829#(<= ~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)); {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {60829#(<= ~counter~0 0)} ~cond := #in~cond; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {60829#(<= ~counter~0 0)} assume !(0 == ~cond); {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {60829#(<= ~counter~0 0)} assume true; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60829#(<= ~counter~0 0)} {60829#(<= ~counter~0 0)} #92#return; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {60829#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {60829#(<= ~counter~0 0)} is VALID [2022-04-15 09:05:56,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {60829#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {60878#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,005 INFO L272 TraceCheckUtils]: 19: Hoare triple {60878#(<= ~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)); {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {60878#(<= ~counter~0 1)} ~cond := #in~cond; {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {60878#(<= ~counter~0 1)} assume !(0 == ~cond); {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {60878#(<= ~counter~0 1)} assume true; {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,006 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60878#(<= ~counter~0 1)} {60878#(<= ~counter~0 1)} #94#return; {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {60878#(<= ~counter~0 1)} assume !!(0 != ~r~0); {60878#(<= ~counter~0 1)} is VALID [2022-04-15 09:05:56,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {60878#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {60903#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,007 INFO L272 TraceCheckUtils]: 27: Hoare triple {60903#(<= ~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)); {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {60903#(<= ~counter~0 2)} ~cond := #in~cond; {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {60903#(<= ~counter~0 2)} assume !(0 == ~cond); {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {60903#(<= ~counter~0 2)} assume true; {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,008 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60903#(<= ~counter~0 2)} {60903#(<= ~counter~0 2)} #96#return; {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {60903#(<= ~counter~0 2)} assume !(~r~0 > 0); {60903#(<= ~counter~0 2)} is VALID [2022-04-15 09:05:56,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {60903#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {60928#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,009 INFO L272 TraceCheckUtils]: 35: Hoare triple {60928#(<= ~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)); {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {60928#(<= ~counter~0 3)} ~cond := #in~cond; {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {60928#(<= ~counter~0 3)} assume !(0 == ~cond); {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {60928#(<= ~counter~0 3)} assume true; {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,010 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60928#(<= ~counter~0 3)} {60928#(<= ~counter~0 3)} #98#return; {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,010 INFO L290 TraceCheckUtils]: 40: Hoare triple {60928#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {60928#(<= ~counter~0 3)} is VALID [2022-04-15 09:05:56,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {60928#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {60953#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,011 INFO L272 TraceCheckUtils]: 43: Hoare triple {60953#(<= ~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)); {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {60953#(<= ~counter~0 4)} ~cond := #in~cond; {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {60953#(<= ~counter~0 4)} assume !(0 == ~cond); {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {60953#(<= ~counter~0 4)} assume true; {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,012 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60953#(<= ~counter~0 4)} {60953#(<= ~counter~0 4)} #98#return; {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {60953#(<= ~counter~0 4)} assume !(~r~0 < 0); {60953#(<= ~counter~0 4)} is VALID [2022-04-15 09:05:56,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {60953#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {60978#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,013 INFO L272 TraceCheckUtils]: 51: Hoare triple {60978#(<= ~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)); {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {60978#(<= ~counter~0 5)} ~cond := #in~cond; {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {60978#(<= ~counter~0 5)} assume !(0 == ~cond); {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {60978#(<= ~counter~0 5)} assume true; {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,014 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60978#(<= ~counter~0 5)} {60978#(<= ~counter~0 5)} #94#return; {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {60978#(<= ~counter~0 5)} assume !!(0 != ~r~0); {60978#(<= ~counter~0 5)} is VALID [2022-04-15 09:05:56,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {60978#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {61003#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,015 INFO L272 TraceCheckUtils]: 59: Hoare triple {61003#(<= ~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)); {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {61003#(<= ~counter~0 6)} ~cond := #in~cond; {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {61003#(<= ~counter~0 6)} assume !(0 == ~cond); {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {61003#(<= ~counter~0 6)} assume true; {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,016 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61003#(<= ~counter~0 6)} {61003#(<= ~counter~0 6)} #96#return; {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {61003#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61003#(<= ~counter~0 6)} is VALID [2022-04-15 09:05:56,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {61003#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {61028#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,017 INFO L272 TraceCheckUtils]: 67: Hoare triple {61028#(<= ~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)); {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {61028#(<= ~counter~0 7)} ~cond := #in~cond; {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {61028#(<= ~counter~0 7)} assume !(0 == ~cond); {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {61028#(<= ~counter~0 7)} assume true; {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,018 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {61028#(<= ~counter~0 7)} {61028#(<= ~counter~0 7)} #96#return; {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,018 INFO L290 TraceCheckUtils]: 72: Hoare triple {61028#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61028#(<= ~counter~0 7)} is VALID [2022-04-15 09:05:56,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {61028#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,019 INFO L290 TraceCheckUtils]: 74: Hoare triple {61053#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,019 INFO L272 TraceCheckUtils]: 75: Hoare triple {61053#(<= ~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)); {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,019 INFO L290 TraceCheckUtils]: 76: Hoare triple {61053#(<= ~counter~0 8)} ~cond := #in~cond; {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,019 INFO L290 TraceCheckUtils]: 77: Hoare triple {61053#(<= ~counter~0 8)} assume !(0 == ~cond); {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,020 INFO L290 TraceCheckUtils]: 78: Hoare triple {61053#(<= ~counter~0 8)} assume true; {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,020 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {61053#(<= ~counter~0 8)} {61053#(<= ~counter~0 8)} #96#return; {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,020 INFO L290 TraceCheckUtils]: 80: Hoare triple {61053#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61053#(<= ~counter~0 8)} is VALID [2022-04-15 09:05:56,021 INFO L290 TraceCheckUtils]: 81: Hoare triple {61053#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,021 INFO L290 TraceCheckUtils]: 82: Hoare triple {61078#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,021 INFO L272 TraceCheckUtils]: 83: Hoare triple {61078#(<= ~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)); {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,021 INFO L290 TraceCheckUtils]: 84: Hoare triple {61078#(<= ~counter~0 9)} ~cond := #in~cond; {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,021 INFO L290 TraceCheckUtils]: 85: Hoare triple {61078#(<= ~counter~0 9)} assume !(0 == ~cond); {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,022 INFO L290 TraceCheckUtils]: 86: Hoare triple {61078#(<= ~counter~0 9)} assume true; {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,022 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {61078#(<= ~counter~0 9)} {61078#(<= ~counter~0 9)} #96#return; {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,022 INFO L290 TraceCheckUtils]: 88: Hoare triple {61078#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61078#(<= ~counter~0 9)} is VALID [2022-04-15 09:05:56,023 INFO L290 TraceCheckUtils]: 89: Hoare triple {61078#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,023 INFO L290 TraceCheckUtils]: 90: Hoare triple {61103#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,023 INFO L272 TraceCheckUtils]: 91: Hoare triple {61103#(<= ~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)); {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,023 INFO L290 TraceCheckUtils]: 92: Hoare triple {61103#(<= ~counter~0 10)} ~cond := #in~cond; {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,023 INFO L290 TraceCheckUtils]: 93: Hoare triple {61103#(<= ~counter~0 10)} assume !(0 == ~cond); {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,024 INFO L290 TraceCheckUtils]: 94: Hoare triple {61103#(<= ~counter~0 10)} assume true; {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,024 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {61103#(<= ~counter~0 10)} {61103#(<= ~counter~0 10)} #96#return; {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,024 INFO L290 TraceCheckUtils]: 96: Hoare triple {61103#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61103#(<= ~counter~0 10)} is VALID [2022-04-15 09:05:56,024 INFO L290 TraceCheckUtils]: 97: Hoare triple {61103#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61128#(<= |main_#t~post7| 10)} is VALID [2022-04-15 09:05:56,024 INFO L290 TraceCheckUtils]: 98: Hoare triple {61128#(<= |main_#t~post7| 10)} assume !(#t~post7 < 50);havoc #t~post7; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 99: Hoare triple {60822#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 100: Hoare triple {60822#false} assume !(#t~post8 < 50);havoc #t~post8; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 101: Hoare triple {60822#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 102: Hoare triple {60822#false} assume !(#t~post6 < 50);havoc #t~post6; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L272 TraceCheckUtils]: 103: Hoare triple {60822#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)); {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 104: Hoare triple {60822#false} ~cond := #in~cond; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 105: Hoare triple {60822#false} assume 0 == ~cond; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L290 TraceCheckUtils]: 106: Hoare triple {60822#false} assume !false; {60822#false} is VALID [2022-04-15 09:05:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:05:56,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 106: Hoare triple {60822#false} assume !false; {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 105: Hoare triple {60822#false} assume 0 == ~cond; {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 104: Hoare triple {60822#false} ~cond := #in~cond; {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L272 TraceCheckUtils]: 103: Hoare triple {60822#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)); {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 102: Hoare triple {60822#false} assume !(#t~post6 < 50);havoc #t~post6; {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 101: Hoare triple {60822#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 100: Hoare triple {60822#false} assume !(#t~post8 < 50);havoc #t~post8; {60822#false} is VALID [2022-04-15 09:05:56,364 INFO L290 TraceCheckUtils]: 99: Hoare triple {60822#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {60822#false} is VALID [2022-04-15 09:05:56,365 INFO L290 TraceCheckUtils]: 98: Hoare triple {61180#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {60822#false} is VALID [2022-04-15 09:05:56,365 INFO L290 TraceCheckUtils]: 97: Hoare triple {61184#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61180#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:05:56,365 INFO L290 TraceCheckUtils]: 96: Hoare triple {61184#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61184#(< ~counter~0 50)} is VALID [2022-04-15 09:05:56,365 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {60821#true} {61184#(< ~counter~0 50)} #96#return; {61184#(< ~counter~0 50)} is VALID [2022-04-15 09:05:56,365 INFO L290 TraceCheckUtils]: 94: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,366 INFO L290 TraceCheckUtils]: 93: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,366 INFO L290 TraceCheckUtils]: 92: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,366 INFO L272 TraceCheckUtils]: 91: Hoare triple {61184#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,366 INFO L290 TraceCheckUtils]: 90: Hoare triple {61184#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {61184#(< ~counter~0 50)} is VALID [2022-04-15 09:05:56,367 INFO L290 TraceCheckUtils]: 89: Hoare triple {61209#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61184#(< ~counter~0 50)} is VALID [2022-04-15 09:05:56,367 INFO L290 TraceCheckUtils]: 88: Hoare triple {61209#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61209#(< ~counter~0 49)} is VALID [2022-04-15 09:05:56,368 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {60821#true} {61209#(< ~counter~0 49)} #96#return; {61209#(< ~counter~0 49)} is VALID [2022-04-15 09:05:56,368 INFO L290 TraceCheckUtils]: 86: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,368 INFO L290 TraceCheckUtils]: 85: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,368 INFO L290 TraceCheckUtils]: 84: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,368 INFO L272 TraceCheckUtils]: 83: Hoare triple {61209#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,368 INFO L290 TraceCheckUtils]: 82: Hoare triple {61209#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {61209#(< ~counter~0 49)} is VALID [2022-04-15 09:05:56,369 INFO L290 TraceCheckUtils]: 81: Hoare triple {61234#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61209#(< ~counter~0 49)} is VALID [2022-04-15 09:05:56,369 INFO L290 TraceCheckUtils]: 80: Hoare triple {61234#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61234#(< ~counter~0 48)} is VALID [2022-04-15 09:05:56,369 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {60821#true} {61234#(< ~counter~0 48)} #96#return; {61234#(< ~counter~0 48)} is VALID [2022-04-15 09:05:56,369 INFO L290 TraceCheckUtils]: 78: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,369 INFO L290 TraceCheckUtils]: 77: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,369 INFO L290 TraceCheckUtils]: 76: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,369 INFO L272 TraceCheckUtils]: 75: Hoare triple {61234#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,369 INFO L290 TraceCheckUtils]: 74: Hoare triple {61234#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {61234#(< ~counter~0 48)} is VALID [2022-04-15 09:05:56,370 INFO L290 TraceCheckUtils]: 73: Hoare triple {61259#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61234#(< ~counter~0 48)} is VALID [2022-04-15 09:05:56,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {61259#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61259#(< ~counter~0 47)} is VALID [2022-04-15 09:05:56,371 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {60821#true} {61259#(< ~counter~0 47)} #96#return; {61259#(< ~counter~0 47)} is VALID [2022-04-15 09:05:56,371 INFO L290 TraceCheckUtils]: 70: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,371 INFO L290 TraceCheckUtils]: 69: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,371 INFO L290 TraceCheckUtils]: 68: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,371 INFO L272 TraceCheckUtils]: 67: Hoare triple {61259#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,371 INFO L290 TraceCheckUtils]: 66: Hoare triple {61259#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {61259#(< ~counter~0 47)} is VALID [2022-04-15 09:05:56,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {61284#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61259#(< ~counter~0 47)} is VALID [2022-04-15 09:05:56,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {61284#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61284#(< ~counter~0 46)} is VALID [2022-04-15 09:05:56,372 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {60821#true} {61284#(< ~counter~0 46)} #96#return; {61284#(< ~counter~0 46)} is VALID [2022-04-15 09:05:56,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,372 INFO L272 TraceCheckUtils]: 59: Hoare triple {61284#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {61284#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {61284#(< ~counter~0 46)} is VALID [2022-04-15 09:05:56,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {61309#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61284#(< ~counter~0 46)} is VALID [2022-04-15 09:05:56,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {61309#(< ~counter~0 45)} assume !!(0 != ~r~0); {61309#(< ~counter~0 45)} is VALID [2022-04-15 09:05:56,374 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {60821#true} {61309#(< ~counter~0 45)} #94#return; {61309#(< ~counter~0 45)} is VALID [2022-04-15 09:05:56,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,374 INFO L272 TraceCheckUtils]: 51: Hoare triple {61309#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {61309#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {61309#(< ~counter~0 45)} is VALID [2022-04-15 09:05:56,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {61334#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61309#(< ~counter~0 45)} is VALID [2022-04-15 09:05:56,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {61334#(< ~counter~0 44)} assume !(~r~0 < 0); {61334#(< ~counter~0 44)} is VALID [2022-04-15 09:05:56,375 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {60821#true} {61334#(< ~counter~0 44)} #98#return; {61334#(< ~counter~0 44)} is VALID [2022-04-15 09:05:56,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,375 INFO L272 TraceCheckUtils]: 43: Hoare triple {61334#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {61334#(< ~counter~0 44)} assume !!(#t~post8 < 50);havoc #t~post8; {61334#(< ~counter~0 44)} is VALID [2022-04-15 09:05:56,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {61359#(< ~counter~0 43)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61334#(< ~counter~0 44)} is VALID [2022-04-15 09:05:56,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {61359#(< ~counter~0 43)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61359#(< ~counter~0 43)} is VALID [2022-04-15 09:05:56,377 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {60821#true} {61359#(< ~counter~0 43)} #98#return; {61359#(< ~counter~0 43)} is VALID [2022-04-15 09:05:56,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,377 INFO L272 TraceCheckUtils]: 35: Hoare triple {61359#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {61359#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {61359#(< ~counter~0 43)} is VALID [2022-04-15 09:05:56,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {61384#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61359#(< ~counter~0 43)} is VALID [2022-04-15 09:05:56,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {61384#(< ~counter~0 42)} assume !(~r~0 > 0); {61384#(< ~counter~0 42)} is VALID [2022-04-15 09:05:56,378 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {60821#true} {61384#(< ~counter~0 42)} #96#return; {61384#(< ~counter~0 42)} is VALID [2022-04-15 09:05:56,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,378 INFO L290 TraceCheckUtils]: 28: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,378 INFO L272 TraceCheckUtils]: 27: Hoare triple {61384#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {61384#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {61384#(< ~counter~0 42)} is VALID [2022-04-15 09:05:56,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {61409#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61384#(< ~counter~0 42)} is VALID [2022-04-15 09:05:56,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {61409#(< ~counter~0 41)} assume !!(0 != ~r~0); {61409#(< ~counter~0 41)} is VALID [2022-04-15 09:05:56,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {60821#true} {61409#(< ~counter~0 41)} #94#return; {61409#(< ~counter~0 41)} is VALID [2022-04-15 09:05:56,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {61409#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {61409#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {61409#(< ~counter~0 41)} is VALID [2022-04-15 09:05:56,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {61434#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61409#(< ~counter~0 41)} is VALID [2022-04-15 09:05:56,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {61434#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,381 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {60821#true} {61434#(< ~counter~0 40)} #92#return; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,381 INFO L272 TraceCheckUtils]: 11: Hoare triple {61434#(< ~counter~0 40)} 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)); {60821#true} is VALID [2022-04-15 09:05:56,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {60821#true} {61434#(< ~counter~0 40)} #90#return; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {60821#true} assume true; {60821#true} is VALID [2022-04-15 09:05:56,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {60821#true} assume !(0 == ~cond); {60821#true} is VALID [2022-04-15 09:05:56,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {60821#true} ~cond := #in~cond; {60821#true} is VALID [2022-04-15 09:05:56,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {61434#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {60821#true} is VALID [2022-04-15 09:05:56,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {61434#(< ~counter~0 40)} 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; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {61434#(< ~counter~0 40)} call #t~ret9 := main(); {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61434#(< ~counter~0 40)} {60821#true} #102#return; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {61434#(< ~counter~0 40)} assume true; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {60821#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; {61434#(< ~counter~0 40)} is VALID [2022-04-15 09:05:56,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {60821#true} call ULTIMATE.init(); {60821#true} is VALID [2022-04-15 09:05:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 09:05:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:05:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342751048] [2022-04-15 09:05:56,383 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:05:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442315420] [2022-04-15 09:05:56,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442315420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:05:56,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:05:56,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 09:05:56,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:05:56,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2070994043] [2022-04-15 09:05:56,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2070994043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:05:56,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:05:56,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 09:05:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316928057] [2022-04-15 09:05:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:05:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-15 09:05:56,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:05:56,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:56,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:56,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 09:05:56,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:05:56,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 09:05:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 09:05:56,441 INFO L87 Difference]: Start difference. First operand 558 states and 744 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:57,754 INFO L93 Difference]: Finished difference Result 775 states and 1071 transitions. [2022-04-15 09:05:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 09:05:57,754 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 107 [2022-04-15 09:05:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:05:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 09:05:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 09:05:57,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-15 09:05:57,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:05:57,894 INFO L225 Difference]: With dead ends: 775 [2022-04-15 09:05:57,894 INFO L226 Difference]: Without dead ends: 574 [2022-04-15 09:05:57,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=497, Invalid=693, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 09:05:57,895 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 141 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:05:57,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 253 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:05:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-15 09:05:58,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-04-15 09:05:58,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:05:58,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:58,552 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:58,553 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:58,569 INFO L93 Difference]: Finished difference Result 574 states and 760 transitions. [2022-04-15 09:05:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 760 transitions. [2022-04-15 09:05:58,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:58,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:58,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 574 states. [2022-04-15 09:05:58,573 INFO L87 Difference]: Start difference. First operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 574 states. [2022-04-15 09:05:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:05:58,596 INFO L93 Difference]: Finished difference Result 574 states and 760 transitions. [2022-04-15 09:05:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 760 transitions. [2022-04-15 09:05:58,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:05:58,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:05:58,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:05:58,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:05:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 437 states have (on average 1.2219679633867278) internal successors, (534), 437 states have internal predecessors, (534), 114 states have call successors, (114), 24 states have call predecessors, (114), 22 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 09:05:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 760 transitions. [2022-04-15 09:05:58,613 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 760 transitions. Word has length 107 [2022-04-15 09:05:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:05:58,613 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 760 transitions. [2022-04-15 09:05:58,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 13 states have call successors, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-15 09:05:58,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 574 states and 760 transitions. [2022-04-15 09:06:16,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 754 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 760 transitions. [2022-04-15 09:06:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 09:06:16,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:16,909 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 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] [2022-04-15 09:06:16,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 09:06:17,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:17,109 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-15 09:06:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:17,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633394662] [2022-04-15 09:06:17,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-15 09:06:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:17,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094519166] [2022-04-15 09:06:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:17,144 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:17,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135086147] [2022-04-15 09:06:17,145 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:06:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:17,146 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:17,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 09:06:17,292 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 09:06:17,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:17,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 09:06:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:17,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:17,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {65352#true} call ULTIMATE.init(); {65352#true} is VALID [2022-04-15 09:06:17,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {65352#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; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {65360#(<= ~counter~0 0)} assume true; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65360#(<= ~counter~0 0)} {65352#true} #102#return; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {65360#(<= ~counter~0 0)} call #t~ret9 := main(); {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {65360#(<= ~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; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {65360#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {65360#(<= ~counter~0 0)} ~cond := #in~cond; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {65360#(<= ~counter~0 0)} assume !(0 == ~cond); {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {65360#(<= ~counter~0 0)} assume true; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65360#(<= ~counter~0 0)} {65360#(<= ~counter~0 0)} #90#return; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {65360#(<= ~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)); {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {65360#(<= ~counter~0 0)} ~cond := #in~cond; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {65360#(<= ~counter~0 0)} assume !(0 == ~cond); {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {65360#(<= ~counter~0 0)} assume true; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65360#(<= ~counter~0 0)} {65360#(<= ~counter~0 0)} #92#return; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {65360#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65360#(<= ~counter~0 0)} is VALID [2022-04-15 09:06:17,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {65360#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {65409#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {65409#(<= ~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)); {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {65409#(<= ~counter~0 1)} ~cond := #in~cond; {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {65409#(<= ~counter~0 1)} assume !(0 == ~cond); {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {65409#(<= ~counter~0 1)} assume true; {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,912 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65409#(<= ~counter~0 1)} {65409#(<= ~counter~0 1)} #94#return; {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {65409#(<= ~counter~0 1)} assume !!(0 != ~r~0); {65409#(<= ~counter~0 1)} is VALID [2022-04-15 09:06:17,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {65409#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {65434#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,914 INFO L272 TraceCheckUtils]: 27: Hoare triple {65434#(<= ~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)); {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {65434#(<= ~counter~0 2)} ~cond := #in~cond; {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {65434#(<= ~counter~0 2)} assume !(0 == ~cond); {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {65434#(<= ~counter~0 2)} assume true; {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,915 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65434#(<= ~counter~0 2)} {65434#(<= ~counter~0 2)} #96#return; {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {65434#(<= ~counter~0 2)} assume !(~r~0 > 0); {65434#(<= ~counter~0 2)} is VALID [2022-04-15 09:06:17,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {65434#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {65459#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,917 INFO L272 TraceCheckUtils]: 35: Hoare triple {65459#(<= ~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)); {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {65459#(<= ~counter~0 3)} ~cond := #in~cond; {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {65459#(<= ~counter~0 3)} assume !(0 == ~cond); {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {65459#(<= ~counter~0 3)} assume true; {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,918 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65459#(<= ~counter~0 3)} {65459#(<= ~counter~0 3)} #98#return; {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {65459#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65459#(<= ~counter~0 3)} is VALID [2022-04-15 09:06:17,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {65459#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {65484#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,919 INFO L272 TraceCheckUtils]: 43: Hoare triple {65484#(<= ~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)); {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {65484#(<= ~counter~0 4)} ~cond := #in~cond; {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {65484#(<= ~counter~0 4)} assume !(0 == ~cond); {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {65484#(<= ~counter~0 4)} assume true; {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,921 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65484#(<= ~counter~0 4)} {65484#(<= ~counter~0 4)} #98#return; {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {65484#(<= ~counter~0 4)} assume !(~r~0 < 0); {65484#(<= ~counter~0 4)} is VALID [2022-04-15 09:06:17,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {65484#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {65509#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,922 INFO L272 TraceCheckUtils]: 51: Hoare triple {65509#(<= ~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)); {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,922 INFO L290 TraceCheckUtils]: 52: Hoare triple {65509#(<= ~counter~0 5)} ~cond := #in~cond; {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {65509#(<= ~counter~0 5)} assume !(0 == ~cond); {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {65509#(<= ~counter~0 5)} assume true; {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,923 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65509#(<= ~counter~0 5)} {65509#(<= ~counter~0 5)} #94#return; {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {65509#(<= ~counter~0 5)} assume !!(0 != ~r~0); {65509#(<= ~counter~0 5)} is VALID [2022-04-15 09:06:17,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {65509#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,936 INFO L290 TraceCheckUtils]: 58: Hoare triple {65534#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,936 INFO L272 TraceCheckUtils]: 59: Hoare triple {65534#(<= ~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)); {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {65534#(<= ~counter~0 6)} ~cond := #in~cond; {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {65534#(<= ~counter~0 6)} assume !(0 == ~cond); {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {65534#(<= ~counter~0 6)} assume true; {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,937 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65534#(<= ~counter~0 6)} {65534#(<= ~counter~0 6)} #96#return; {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {65534#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65534#(<= ~counter~0 6)} is VALID [2022-04-15 09:06:17,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {65534#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {65559#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,939 INFO L272 TraceCheckUtils]: 67: Hoare triple {65559#(<= ~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)); {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {65559#(<= ~counter~0 7)} ~cond := #in~cond; {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {65559#(<= ~counter~0 7)} assume !(0 == ~cond); {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {65559#(<= ~counter~0 7)} assume true; {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,940 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65559#(<= ~counter~0 7)} {65559#(<= ~counter~0 7)} #96#return; {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {65559#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65559#(<= ~counter~0 7)} is VALID [2022-04-15 09:06:17,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {65559#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {65584#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,942 INFO L272 TraceCheckUtils]: 75: Hoare triple {65584#(<= ~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)); {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,942 INFO L290 TraceCheckUtils]: 76: Hoare triple {65584#(<= ~counter~0 8)} ~cond := #in~cond; {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {65584#(<= ~counter~0 8)} assume !(0 == ~cond); {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,943 INFO L290 TraceCheckUtils]: 78: Hoare triple {65584#(<= ~counter~0 8)} assume true; {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,943 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65584#(<= ~counter~0 8)} {65584#(<= ~counter~0 8)} #96#return; {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,943 INFO L290 TraceCheckUtils]: 80: Hoare triple {65584#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65584#(<= ~counter~0 8)} is VALID [2022-04-15 09:06:17,944 INFO L290 TraceCheckUtils]: 81: Hoare triple {65584#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {65609#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,945 INFO L272 TraceCheckUtils]: 83: Hoare triple {65609#(<= ~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)); {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,945 INFO L290 TraceCheckUtils]: 84: Hoare triple {65609#(<= ~counter~0 9)} ~cond := #in~cond; {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,945 INFO L290 TraceCheckUtils]: 85: Hoare triple {65609#(<= ~counter~0 9)} assume !(0 == ~cond); {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,946 INFO L290 TraceCheckUtils]: 86: Hoare triple {65609#(<= ~counter~0 9)} assume true; {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,946 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65609#(<= ~counter~0 9)} {65609#(<= ~counter~0 9)} #96#return; {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,946 INFO L290 TraceCheckUtils]: 88: Hoare triple {65609#(<= ~counter~0 9)} assume !(~r~0 > 0); {65609#(<= ~counter~0 9)} is VALID [2022-04-15 09:06:17,947 INFO L290 TraceCheckUtils]: 89: Hoare triple {65609#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,947 INFO L290 TraceCheckUtils]: 90: Hoare triple {65634#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,948 INFO L272 TraceCheckUtils]: 91: Hoare triple {65634#(<= ~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)); {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,948 INFO L290 TraceCheckUtils]: 92: Hoare triple {65634#(<= ~counter~0 10)} ~cond := #in~cond; {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,948 INFO L290 TraceCheckUtils]: 93: Hoare triple {65634#(<= ~counter~0 10)} assume !(0 == ~cond); {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,948 INFO L290 TraceCheckUtils]: 94: Hoare triple {65634#(<= ~counter~0 10)} assume true; {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,949 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65634#(<= ~counter~0 10)} {65634#(<= ~counter~0 10)} #98#return; {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {65634#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65634#(<= ~counter~0 10)} is VALID [2022-04-15 09:06:17,950 INFO L290 TraceCheckUtils]: 97: Hoare triple {65634#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,950 INFO L290 TraceCheckUtils]: 98: Hoare triple {65659#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,950 INFO L272 TraceCheckUtils]: 99: Hoare triple {65659#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,951 INFO L290 TraceCheckUtils]: 100: Hoare triple {65659#(<= ~counter~0 11)} ~cond := #in~cond; {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,951 INFO L290 TraceCheckUtils]: 101: Hoare triple {65659#(<= ~counter~0 11)} assume !(0 == ~cond); {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,951 INFO L290 TraceCheckUtils]: 102: Hoare triple {65659#(<= ~counter~0 11)} assume true; {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,951 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65659#(<= ~counter~0 11)} {65659#(<= ~counter~0 11)} #98#return; {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,952 INFO L290 TraceCheckUtils]: 104: Hoare triple {65659#(<= ~counter~0 11)} assume !(~r~0 < 0); {65659#(<= ~counter~0 11)} is VALID [2022-04-15 09:06:17,952 INFO L290 TraceCheckUtils]: 105: Hoare triple {65659#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65684#(<= |main_#t~post6| 11)} is VALID [2022-04-15 09:06:17,952 INFO L290 TraceCheckUtils]: 106: Hoare triple {65684#(<= |main_#t~post6| 11)} assume !(#t~post6 < 50);havoc #t~post6; {65353#false} is VALID [2022-04-15 09:06:17,952 INFO L272 TraceCheckUtils]: 107: Hoare triple {65353#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)); {65353#false} is VALID [2022-04-15 09:06:17,952 INFO L290 TraceCheckUtils]: 108: Hoare triple {65353#false} ~cond := #in~cond; {65353#false} is VALID [2022-04-15 09:06:17,953 INFO L290 TraceCheckUtils]: 109: Hoare triple {65353#false} assume 0 == ~cond; {65353#false} is VALID [2022-04-15 09:06:17,953 INFO L290 TraceCheckUtils]: 110: Hoare triple {65353#false} assume !false; {65353#false} is VALID [2022-04-15 09:06:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:06:17,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:18,553 INFO L290 TraceCheckUtils]: 110: Hoare triple {65353#false} assume !false; {65353#false} is VALID [2022-04-15 09:06:18,553 INFO L290 TraceCheckUtils]: 109: Hoare triple {65353#false} assume 0 == ~cond; {65353#false} is VALID [2022-04-15 09:06:18,553 INFO L290 TraceCheckUtils]: 108: Hoare triple {65353#false} ~cond := #in~cond; {65353#false} is VALID [2022-04-15 09:06:18,553 INFO L272 TraceCheckUtils]: 107: Hoare triple {65353#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)); {65353#false} is VALID [2022-04-15 09:06:18,553 INFO L290 TraceCheckUtils]: 106: Hoare triple {65712#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {65353#false} is VALID [2022-04-15 09:06:18,554 INFO L290 TraceCheckUtils]: 105: Hoare triple {65716#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65712#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:06:18,554 INFO L290 TraceCheckUtils]: 104: Hoare triple {65716#(< ~counter~0 50)} assume !(~r~0 < 0); {65716#(< ~counter~0 50)} is VALID [2022-04-15 09:06:18,555 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {65352#true} {65716#(< ~counter~0 50)} #98#return; {65716#(< ~counter~0 50)} is VALID [2022-04-15 09:06:18,555 INFO L290 TraceCheckUtils]: 102: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,555 INFO L290 TraceCheckUtils]: 101: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,555 INFO L290 TraceCheckUtils]: 100: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,555 INFO L272 TraceCheckUtils]: 99: Hoare triple {65716#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,555 INFO L290 TraceCheckUtils]: 98: Hoare triple {65716#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {65716#(< ~counter~0 50)} is VALID [2022-04-15 09:06:18,556 INFO L290 TraceCheckUtils]: 97: Hoare triple {65741#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65716#(< ~counter~0 50)} is VALID [2022-04-15 09:06:18,557 INFO L290 TraceCheckUtils]: 96: Hoare triple {65741#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65741#(< ~counter~0 49)} is VALID [2022-04-15 09:06:18,557 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {65352#true} {65741#(< ~counter~0 49)} #98#return; {65741#(< ~counter~0 49)} is VALID [2022-04-15 09:06:18,557 INFO L290 TraceCheckUtils]: 94: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,557 INFO L290 TraceCheckUtils]: 93: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,557 INFO L290 TraceCheckUtils]: 92: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,557 INFO L272 TraceCheckUtils]: 91: Hoare triple {65741#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,558 INFO L290 TraceCheckUtils]: 90: Hoare triple {65741#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {65741#(< ~counter~0 49)} is VALID [2022-04-15 09:06:18,558 INFO L290 TraceCheckUtils]: 89: Hoare triple {65766#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65741#(< ~counter~0 49)} is VALID [2022-04-15 09:06:18,559 INFO L290 TraceCheckUtils]: 88: Hoare triple {65766#(< ~counter~0 48)} assume !(~r~0 > 0); {65766#(< ~counter~0 48)} is VALID [2022-04-15 09:06:18,559 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {65352#true} {65766#(< ~counter~0 48)} #96#return; {65766#(< ~counter~0 48)} is VALID [2022-04-15 09:06:18,559 INFO L290 TraceCheckUtils]: 86: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,559 INFO L290 TraceCheckUtils]: 85: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,559 INFO L290 TraceCheckUtils]: 84: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,560 INFO L272 TraceCheckUtils]: 83: Hoare triple {65766#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,560 INFO L290 TraceCheckUtils]: 82: Hoare triple {65766#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {65766#(< ~counter~0 48)} is VALID [2022-04-15 09:06:18,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {65791#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65766#(< ~counter~0 48)} is VALID [2022-04-15 09:06:18,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {65791#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65791#(< ~counter~0 47)} is VALID [2022-04-15 09:06:18,561 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {65352#true} {65791#(< ~counter~0 47)} #96#return; {65791#(< ~counter~0 47)} is VALID [2022-04-15 09:06:18,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,561 INFO L290 TraceCheckUtils]: 77: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,561 INFO L290 TraceCheckUtils]: 76: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,562 INFO L272 TraceCheckUtils]: 75: Hoare triple {65791#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {65791#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {65791#(< ~counter~0 47)} is VALID [2022-04-15 09:06:18,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {65816#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65791#(< ~counter~0 47)} is VALID [2022-04-15 09:06:18,563 INFO L290 TraceCheckUtils]: 72: Hoare triple {65816#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65816#(< ~counter~0 46)} is VALID [2022-04-15 09:06:18,563 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {65352#true} {65816#(< ~counter~0 46)} #96#return; {65816#(< ~counter~0 46)} is VALID [2022-04-15 09:06:18,563 INFO L290 TraceCheckUtils]: 70: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,563 INFO L290 TraceCheckUtils]: 69: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,563 INFO L290 TraceCheckUtils]: 68: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,564 INFO L272 TraceCheckUtils]: 67: Hoare triple {65816#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {65816#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {65816#(< ~counter~0 46)} is VALID [2022-04-15 09:06:18,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {65841#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65816#(< ~counter~0 46)} is VALID [2022-04-15 09:06:18,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {65841#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {65841#(< ~counter~0 45)} is VALID [2022-04-15 09:06:18,565 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {65352#true} {65841#(< ~counter~0 45)} #96#return; {65841#(< ~counter~0 45)} is VALID [2022-04-15 09:06:18,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,566 INFO L272 TraceCheckUtils]: 59: Hoare triple {65841#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,566 INFO L290 TraceCheckUtils]: 58: Hoare triple {65841#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {65841#(< ~counter~0 45)} is VALID [2022-04-15 09:06:18,566 INFO L290 TraceCheckUtils]: 57: Hoare triple {65866#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65841#(< ~counter~0 45)} is VALID [2022-04-15 09:06:18,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {65866#(< ~counter~0 44)} assume !!(0 != ~r~0); {65866#(< ~counter~0 44)} is VALID [2022-04-15 09:06:18,567 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {65352#true} {65866#(< ~counter~0 44)} #94#return; {65866#(< ~counter~0 44)} is VALID [2022-04-15 09:06:18,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,567 INFO L290 TraceCheckUtils]: 53: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,567 INFO L290 TraceCheckUtils]: 52: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,568 INFO L272 TraceCheckUtils]: 51: Hoare triple {65866#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {65866#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {65866#(< ~counter~0 44)} is VALID [2022-04-15 09:06:18,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {65891#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65866#(< ~counter~0 44)} is VALID [2022-04-15 09:06:18,569 INFO L290 TraceCheckUtils]: 48: Hoare triple {65891#(< ~counter~0 43)} assume !(~r~0 < 0); {65891#(< ~counter~0 43)} is VALID [2022-04-15 09:06:18,569 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {65352#true} {65891#(< ~counter~0 43)} #98#return; {65891#(< ~counter~0 43)} is VALID [2022-04-15 09:06:18,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,570 INFO L272 TraceCheckUtils]: 43: Hoare triple {65891#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {65891#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {65891#(< ~counter~0 43)} is VALID [2022-04-15 09:06:18,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {65916#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65891#(< ~counter~0 43)} is VALID [2022-04-15 09:06:18,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {65916#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {65916#(< ~counter~0 42)} is VALID [2022-04-15 09:06:18,571 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {65352#true} {65916#(< ~counter~0 42)} #98#return; {65916#(< ~counter~0 42)} is VALID [2022-04-15 09:06:18,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,572 INFO L272 TraceCheckUtils]: 35: Hoare triple {65916#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {65916#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {65916#(< ~counter~0 42)} is VALID [2022-04-15 09:06:18,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {65941#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {65916#(< ~counter~0 42)} is VALID [2022-04-15 09:06:18,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {65941#(< ~counter~0 41)} assume !(~r~0 > 0); {65941#(< ~counter~0 41)} is VALID [2022-04-15 09:06:18,573 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {65352#true} {65941#(< ~counter~0 41)} #96#return; {65941#(< ~counter~0 41)} is VALID [2022-04-15 09:06:18,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,574 INFO L272 TraceCheckUtils]: 27: Hoare triple {65941#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {65941#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {65941#(< ~counter~0 41)} is VALID [2022-04-15 09:06:18,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {65966#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {65941#(< ~counter~0 41)} is VALID [2022-04-15 09:06:18,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {65966#(< ~counter~0 40)} assume !!(0 != ~r~0); {65966#(< ~counter~0 40)} is VALID [2022-04-15 09:06:18,575 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {65352#true} {65966#(< ~counter~0 40)} #94#return; {65966#(< ~counter~0 40)} is VALID [2022-04-15 09:06:18,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {65966#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {65966#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {65966#(< ~counter~0 40)} is VALID [2022-04-15 09:06:18,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {65991#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {65966#(< ~counter~0 40)} is VALID [2022-04-15 09:06:18,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {65991#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {65352#true} {65991#(< ~counter~0 39)} #92#return; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,577 INFO L272 TraceCheckUtils]: 11: Hoare triple {65991#(< ~counter~0 39)} 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)); {65352#true} is VALID [2022-04-15 09:06:18,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {65352#true} {65991#(< ~counter~0 39)} #90#return; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {65352#true} assume true; {65352#true} is VALID [2022-04-15 09:06:18,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {65352#true} assume !(0 == ~cond); {65352#true} is VALID [2022-04-15 09:06:18,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {65352#true} ~cond := #in~cond; {65352#true} is VALID [2022-04-15 09:06:18,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {65991#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {65352#true} is VALID [2022-04-15 09:06:18,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {65991#(< ~counter~0 39)} 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; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {65991#(< ~counter~0 39)} call #t~ret9 := main(); {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65991#(< ~counter~0 39)} {65352#true} #102#return; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {65991#(< ~counter~0 39)} assume true; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {65352#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; {65991#(< ~counter~0 39)} is VALID [2022-04-15 09:06:18,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {65352#true} call ULTIMATE.init(); {65352#true} is VALID [2022-04-15 09:06:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 09:06:18,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:18,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094519166] [2022-04-15 09:06:18,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:18,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135086147] [2022-04-15 09:06:18,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135086147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:18,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:18,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 09:06:18,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:18,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633394662] [2022-04-15 09:06:18,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633394662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:18,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:18,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 09:06:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734911408] [2022-04-15 09:06:18,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-15 09:06:18,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:18,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:06:18,664 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-15 09:06:18,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 09:06:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:18,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 09:06:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 09:06:18,665 INFO L87 Difference]: Start difference. First operand 574 states and 760 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:06:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:20,469 INFO L93 Difference]: Finished difference Result 633 states and 840 transitions. [2022-04-15 09:06:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 09:06:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 111 [2022-04-15 09:06:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:06:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 09:06:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:06:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 09:06:20,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-15 09:06:20,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:20,640 INFO L225 Difference]: With dead ends: 633 [2022-04-15 09:06:20,640 INFO L226 Difference]: Without dead ends: 622 [2022-04-15 09:06:20,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=525, Invalid=735, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 09:06:20,642 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 177 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:06:20,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 259 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:06:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-04-15 09:06:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 600. [2022-04-15 09:06:21,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:21,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:21,475 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:21,475 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:21,489 INFO L93 Difference]: Finished difference Result 622 states and 824 transitions. [2022-04-15 09:06:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 824 transitions. [2022-04-15 09:06:21,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:21,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:21,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 622 states. [2022-04-15 09:06:21,493 INFO L87 Difference]: Start difference. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 622 states. [2022-04-15 09:06:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:21,518 INFO L93 Difference]: Finished difference Result 622 states and 824 transitions. [2022-04-15 09:06:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 824 transitions. [2022-04-15 09:06:21,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:21,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:21,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:21,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 798 transitions. [2022-04-15 09:06:21,537 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 798 transitions. Word has length 111 [2022-04-15 09:06:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:21,537 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 798 transitions. [2022-04-15 09:06:21,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:06:21,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 798 transitions. [2022-04-15 09:06:38,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 792 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 798 transitions. [2022-04-15 09:06:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 09:06:38,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:06:38,601 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 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] [2022-04-15 09:06:38,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 09:06:38,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 09:06:38,801 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:06:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:06:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-15 09:06:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:38,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437385107] [2022-04-15 09:06:38,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:06:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-15 09:06:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:06:38,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568261793] [2022-04-15 09:06:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:06:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:06:38,814 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:06:38,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850414919] [2022-04-15 09:06:38,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:06:38,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:06:38,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:06:38,815 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:06:38,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 09:06:38,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:06:38,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:06:38,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:06:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:06:38,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:06:39,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {69771#true} call ULTIMATE.init(); {69771#true} is VALID [2022-04-15 09:06:39,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {69771#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; {69771#true} is VALID [2022-04-15 09:06:39,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69771#true} {69771#true} #102#return; {69771#true} is VALID [2022-04-15 09:06:39,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {69771#true} call #t~ret9 := main(); {69771#true} is VALID [2022-04-15 09:06:39,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {69771#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; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {69771#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69771#true} {69771#true} #90#return; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L272 TraceCheckUtils]: 11: Hoare triple {69771#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)); {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69771#true} {69771#true} #92#return; {69771#true} is VALID [2022-04-15 09:06:39,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {69771#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {69824#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {69824#(<= 1 main_~v~0)} assume !!(#t~post6 < 50);havoc #t~post6; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,812 INFO L272 TraceCheckUtils]: 19: Hoare triple {69824#(<= 1 main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:39,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,813 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69771#true} {69824#(<= 1 main_~v~0)} #94#return; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {69824#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {69824#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {69824#(<= 1 main_~v~0)} assume !!(#t~post7 < 50);havoc #t~post7; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,814 INFO L272 TraceCheckUtils]: 27: Hoare triple {69824#(<= 1 main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:39,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,814 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69771#true} {69824#(<= 1 main_~v~0)} #96#return; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {69824#(<= 1 main_~v~0)} assume !(~r~0 > 0); {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {69824#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {69824#(<= 1 main_~v~0)} assume !!(#t~post8 < 50);havoc #t~post8; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,815 INFO L272 TraceCheckUtils]: 35: Hoare triple {69824#(<= 1 main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:39,815 INFO L290 TraceCheckUtils]: 36: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,815 INFO L290 TraceCheckUtils]: 37: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,816 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69771#true} {69824#(<= 1 main_~v~0)} #98#return; {69824#(<= 1 main_~v~0)} is VALID [2022-04-15 09:06:39,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {69824#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 50);havoc #t~post8; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,818 INFO L272 TraceCheckUtils]: 43: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:39,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,819 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69771#true} {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 50);havoc #t~post6; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,820 INFO L272 TraceCheckUtils]: 51: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:39,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,821 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69771#true} {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 50);havoc #t~post7; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,822 INFO L272 TraceCheckUtils]: 59: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:39,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,823 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69771#true} {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 09:06:39,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {69897#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69970#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 09:06:39,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {69970#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69970#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 09:06:39,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {69970#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {69970#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 09:06:39,824 INFO L272 TraceCheckUtils]: 67: Hoare triple {69970#(< (+ main_~r~0 3) main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:39,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,825 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69771#true} {69970#(< (+ main_~r~0 3) main_~u~0)} #96#return; {69970#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 09:06:39,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {69970#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 09:06:39,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 09:06:39,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 09:06:39,826 INFO L272 TraceCheckUtils]: 75: Hoare triple {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:39,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,827 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69771#true} {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 09:06:39,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {69995#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,828 INFO L290 TraceCheckUtils]: 81: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,828 INFO L290 TraceCheckUtils]: 82: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 50);havoc #t~post7; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,828 INFO L272 TraceCheckUtils]: 83: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~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)); {69771#true} is VALID [2022-04-15 09:06:39,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,828 INFO L290 TraceCheckUtils]: 85: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,828 INFO L290 TraceCheckUtils]: 86: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,829 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69771#true} {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,829 INFO L290 TraceCheckUtils]: 89: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,829 INFO L290 TraceCheckUtils]: 90: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,829 INFO L272 TraceCheckUtils]: 91: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~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)); {69771#true} is VALID [2022-04-15 09:06:39,830 INFO L290 TraceCheckUtils]: 92: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,830 INFO L290 TraceCheckUtils]: 93: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,830 INFO L290 TraceCheckUtils]: 94: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,830 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69771#true} {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 09:06:39,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {70020#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 09:06:39,831 INFO L290 TraceCheckUtils]: 97: Hoare triple {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 09:06:39,832 INFO L290 TraceCheckUtils]: 98: Hoare triple {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 50);havoc #t~post8; {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 09:06:39,832 INFO L272 TraceCheckUtils]: 99: Hoare triple {70069#(< 0 (div (+ (- 2) main_~r~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)); {69771#true} is VALID [2022-04-15 09:06:39,832 INFO L290 TraceCheckUtils]: 100: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:39,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:39,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:39,832 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69771#true} {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 09:06:39,833 INFO L290 TraceCheckUtils]: 104: Hoare triple {70069#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69772#false} is VALID [2022-04-15 09:06:39,833 INFO L290 TraceCheckUtils]: 105: Hoare triple {69772#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69772#false} is VALID [2022-04-15 09:06:39,833 INFO L290 TraceCheckUtils]: 106: Hoare triple {69772#false} assume !(#t~post8 < 50);havoc #t~post8; {69772#false} is VALID [2022-04-15 09:06:39,833 INFO L290 TraceCheckUtils]: 107: Hoare triple {69772#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69772#false} is VALID [2022-04-15 09:06:39,833 INFO L290 TraceCheckUtils]: 108: Hoare triple {69772#false} assume !(#t~post6 < 50);havoc #t~post6; {69772#false} is VALID [2022-04-15 09:06:39,833 INFO L272 TraceCheckUtils]: 109: Hoare triple {69772#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)); {69772#false} is VALID [2022-04-15 09:06:39,834 INFO L290 TraceCheckUtils]: 110: Hoare triple {69772#false} ~cond := #in~cond; {69772#false} is VALID [2022-04-15 09:06:39,834 INFO L290 TraceCheckUtils]: 111: Hoare triple {69772#false} assume 0 == ~cond; {69772#false} is VALID [2022-04-15 09:06:39,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {69772#false} assume !false; {69772#false} is VALID [2022-04-15 09:06:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 09:06:39,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:06:40,277 INFO L290 TraceCheckUtils]: 112: Hoare triple {69772#false} assume !false; {69772#false} is VALID [2022-04-15 09:06:40,277 INFO L290 TraceCheckUtils]: 111: Hoare triple {69772#false} assume 0 == ~cond; {69772#false} is VALID [2022-04-15 09:06:40,277 INFO L290 TraceCheckUtils]: 110: Hoare triple {69772#false} ~cond := #in~cond; {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L272 TraceCheckUtils]: 109: Hoare triple {69772#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)); {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L290 TraceCheckUtils]: 108: Hoare triple {69772#false} assume !(#t~post6 < 50);havoc #t~post6; {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L290 TraceCheckUtils]: 107: Hoare triple {69772#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L290 TraceCheckUtils]: 106: Hoare triple {69772#false} assume !(#t~post8 < 50);havoc #t~post8; {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L290 TraceCheckUtils]: 105: Hoare triple {69772#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L290 TraceCheckUtils]: 104: Hoare triple {70142#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {69772#false} is VALID [2022-04-15 09:06:40,278 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {69771#true} {70142#(not (< main_~r~0 0))} #98#return; {70142#(not (< main_~r~0 0))} is VALID [2022-04-15 09:06:40,279 INFO L290 TraceCheckUtils]: 102: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,279 INFO L290 TraceCheckUtils]: 101: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,279 INFO L290 TraceCheckUtils]: 100: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,279 INFO L272 TraceCheckUtils]: 99: Hoare triple {70142#(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)); {69771#true} is VALID [2022-04-15 09:06:40,279 INFO L290 TraceCheckUtils]: 98: Hoare triple {70142#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {70142#(not (< main_~r~0 0))} is VALID [2022-04-15 09:06:40,279 INFO L290 TraceCheckUtils]: 97: Hoare triple {70142#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70142#(not (< main_~r~0 0))} is VALID [2022-04-15 09:06:40,280 INFO L290 TraceCheckUtils]: 96: Hoare triple {70167#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70142#(not (< main_~r~0 0))} is VALID [2022-04-15 09:06:40,280 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {69771#true} {70167#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,280 INFO L290 TraceCheckUtils]: 94: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,280 INFO L290 TraceCheckUtils]: 93: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,280 INFO L290 TraceCheckUtils]: 92: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,280 INFO L272 TraceCheckUtils]: 91: Hoare triple {70167#(<= 0 (+ main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:40,281 INFO L290 TraceCheckUtils]: 90: Hoare triple {70167#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {70167#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,281 INFO L290 TraceCheckUtils]: 88: Hoare triple {70167#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,281 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {69771#true} {70167#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,281 INFO L290 TraceCheckUtils]: 86: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,282 INFO L290 TraceCheckUtils]: 85: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,282 INFO L290 TraceCheckUtils]: 84: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,282 INFO L272 TraceCheckUtils]: 83: Hoare triple {70167#(<= 0 (+ main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:40,282 INFO L290 TraceCheckUtils]: 82: Hoare triple {70167#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,282 INFO L290 TraceCheckUtils]: 81: Hoare triple {70167#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,283 INFO L290 TraceCheckUtils]: 80: Hoare triple {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70167#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:06:40,283 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {69771#true} {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:06:40,283 INFO L290 TraceCheckUtils]: 78: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,283 INFO L290 TraceCheckUtils]: 77: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,283 INFO L290 TraceCheckUtils]: 76: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,283 INFO L272 TraceCheckUtils]: 75: Hoare triple {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~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)); {69771#true} is VALID [2022-04-15 09:06:40,284 INFO L290 TraceCheckUtils]: 74: Hoare triple {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:06:40,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:06:40,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {70241#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70216#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:06:40,286 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {69771#true} {70241#(<= main_~r~0 main_~u~0)} #96#return; {70241#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:06:40,286 INFO L290 TraceCheckUtils]: 70: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,286 INFO L290 TraceCheckUtils]: 69: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,286 INFO L290 TraceCheckUtils]: 68: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,286 INFO L272 TraceCheckUtils]: 67: Hoare triple {70241#(<= main_~r~0 main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:40,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {70241#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 50);havoc #t~post7; {70241#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:06:40,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {70241#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70241#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:06:40,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {70241#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 09:06:40,287 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {69771#true} {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,287 INFO L272 TraceCheckUtils]: 59: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:40,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 50);havoc #t~post7; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,288 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {69771#true} {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,289 INFO L272 TraceCheckUtils]: 51: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:40,289 INFO L290 TraceCheckUtils]: 50: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 50);havoc #t~post6; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,289 INFO L290 TraceCheckUtils]: 49: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,290 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {69771#true} {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,290 INFO L272 TraceCheckUtils]: 43: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~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)); {69771#true} is VALID [2022-04-15 09:06:40,290 INFO L290 TraceCheckUtils]: 42: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 50);havoc #t~post8; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {70266#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 09:06:40,291 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {69771#true} {70339#(<= 0 (+ main_~v~0 3))} #98#return; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,292 INFO L272 TraceCheckUtils]: 35: Hoare triple {70339#(<= 0 (+ main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:40,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 50);havoc #t~post8; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,293 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {69771#true} {70339#(<= 0 (+ main_~v~0 3))} #96#return; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,293 INFO L272 TraceCheckUtils]: 27: Hoare triple {70339#(<= 0 (+ main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:40,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,294 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {69771#true} {70339#(<= 0 (+ main_~v~0 3))} #94#return; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,294 INFO L272 TraceCheckUtils]: 19: Hoare triple {70339#(<= 0 (+ main_~v~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)); {69771#true} is VALID [2022-04-15 09:06:40,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 50);havoc #t~post6; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {70339#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {69771#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70339#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 09:06:40,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {69771#true} {69771#true} #92#return; {69771#true} is VALID [2022-04-15 09:06:40,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,295 INFO L272 TraceCheckUtils]: 11: Hoare triple {69771#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)); {69771#true} is VALID [2022-04-15 09:06:40,295 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {69771#true} {69771#true} #90#return; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {69771#true} assume !(0 == ~cond); {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {69771#true} ~cond := #in~cond; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {69771#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {69771#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; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {69771#true} call #t~ret9 := main(); {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69771#true} {69771#true} #102#return; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {69771#true} assume true; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {69771#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; {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {69771#true} call ULTIMATE.init(); {69771#true} is VALID [2022-04-15 09:06:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 09:06:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:06:40,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568261793] [2022-04-15 09:06:40,297 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:06:40,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850414919] [2022-04-15 09:06:40,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850414919] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:06:40,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:06:40,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:06:40,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:06:40,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437385107] [2022-04-15 09:06:40,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437385107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:06:40,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:06:40,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:06:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160140132] [2022-04-15 09:06:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:06:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-15 09:06:40,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:06:40,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 09:06:40,350 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-15 09:06:40,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:06:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:06:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:06:40,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:06:40,351 INFO L87 Difference]: Start difference. First operand 600 states and 798 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 09:06:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:42,848 INFO L93 Difference]: Finished difference Result 902 states and 1254 transitions. [2022-04-15 09:06:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:06:42,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-15 09:06:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:06:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 09:06:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 09:06:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 09:06:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 09:06:42,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-15 09:06:42,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:06:43,006 INFO L225 Difference]: With dead ends: 902 [2022-04-15 09:06:43,006 INFO L226 Difference]: Without dead ends: 751 [2022-04-15 09:06:43,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-15 09:06:43,006 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:06:43,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 332 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:06:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-04-15 09:06:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 600. [2022-04-15 09:06:44,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:06:44,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:44,388 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:44,389 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:44,408 INFO L93 Difference]: Finished difference Result 751 states and 1019 transitions. [2022-04-15 09:06:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1019 transitions. [2022-04-15 09:06:44,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:44,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:44,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 751 states. [2022-04-15 09:06:44,410 INFO L87 Difference]: Start difference. First operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 751 states. [2022-04-15 09:06:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:06:44,429 INFO L93 Difference]: Finished difference Result 751 states and 1019 transitions. [2022-04-15 09:06:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1019 transitions. [2022-04-15 09:06:44,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:06:44,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:06:44,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:06:44,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:06:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.21875) internal successors, (546), 458 states have internal predecessors, (546), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:06:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 798 transitions. [2022-04-15 09:06:44,447 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 798 transitions. Word has length 113 [2022-04-15 09:06:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:06:44,447 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 798 transitions. [2022-04-15 09:06:44,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 09:06:44,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 798 transitions. [2022-04-15 09:07:04,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 798 edges. 792 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 798 transitions. [2022-04-15 09:07:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 09:07:04,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:07:04,228 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 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-15 09:07:04,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 09:07:04,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:07:04,429 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:07:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:07:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-15 09:07:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:07:04,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425125626] [2022-04-15 09:07:04,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:07:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-15 09:07:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:07:04,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562474104] [2022-04-15 09:07:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:07:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:07:04,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:07:04,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135381126] [2022-04-15 09:07:04,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:07:04,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:07:04,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:07:04,443 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:07:04,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 09:07:04,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:07:04,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:07:04,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 09:07:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:07:04,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:07:05,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {74978#true} call ULTIMATE.init(); {74978#true} is VALID [2022-04-15 09:07:05,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {74978#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; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {74986#(<= ~counter~0 0)} assume true; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74986#(<= ~counter~0 0)} {74978#true} #102#return; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {74986#(<= ~counter~0 0)} call #t~ret9 := main(); {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {74986#(<= ~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; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {74986#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {74986#(<= ~counter~0 0)} ~cond := #in~cond; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {74986#(<= ~counter~0 0)} assume !(0 == ~cond); {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {74986#(<= ~counter~0 0)} assume true; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74986#(<= ~counter~0 0)} {74986#(<= ~counter~0 0)} #90#return; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,397 INFO L272 TraceCheckUtils]: 11: Hoare triple {74986#(<= ~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)); {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {74986#(<= ~counter~0 0)} ~cond := #in~cond; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {74986#(<= ~counter~0 0)} assume !(0 == ~cond); {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {74986#(<= ~counter~0 0)} assume true; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,398 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74986#(<= ~counter~0 0)} {74986#(<= ~counter~0 0)} #92#return; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {74986#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {74986#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:05,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {74986#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {75035#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,401 INFO L272 TraceCheckUtils]: 19: Hoare triple {75035#(<= ~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)); {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {75035#(<= ~counter~0 1)} ~cond := #in~cond; {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {75035#(<= ~counter~0 1)} assume !(0 == ~cond); {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {75035#(<= ~counter~0 1)} assume true; {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,402 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {75035#(<= ~counter~0 1)} {75035#(<= ~counter~0 1)} #94#return; {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {75035#(<= ~counter~0 1)} assume !!(0 != ~r~0); {75035#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:05,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {75035#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {75060#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,404 INFO L272 TraceCheckUtils]: 27: Hoare triple {75060#(<= ~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)); {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {75060#(<= ~counter~0 2)} ~cond := #in~cond; {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {75060#(<= ~counter~0 2)} assume !(0 == ~cond); {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {75060#(<= ~counter~0 2)} assume true; {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,405 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {75060#(<= ~counter~0 2)} {75060#(<= ~counter~0 2)} #96#return; {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {75060#(<= ~counter~0 2)} assume !(~r~0 > 0); {75060#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:05,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {75060#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {75085#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,407 INFO L272 TraceCheckUtils]: 35: Hoare triple {75085#(<= ~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)); {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {75085#(<= ~counter~0 3)} ~cond := #in~cond; {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {75085#(<= ~counter~0 3)} assume !(0 == ~cond); {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {75085#(<= ~counter~0 3)} assume true; {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,408 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {75085#(<= ~counter~0 3)} {75085#(<= ~counter~0 3)} #98#return; {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {75085#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75085#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:05,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {75085#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {75110#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,410 INFO L272 TraceCheckUtils]: 43: Hoare triple {75110#(<= ~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)); {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {75110#(<= ~counter~0 4)} ~cond := #in~cond; {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {75110#(<= ~counter~0 4)} assume !(0 == ~cond); {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {75110#(<= ~counter~0 4)} assume true; {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,412 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {75110#(<= ~counter~0 4)} {75110#(<= ~counter~0 4)} #98#return; {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {75110#(<= ~counter~0 4)} assume !(~r~0 < 0); {75110#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:05,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {75110#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {75135#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,413 INFO L272 TraceCheckUtils]: 51: Hoare triple {75135#(<= ~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)); {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,414 INFO L290 TraceCheckUtils]: 52: Hoare triple {75135#(<= ~counter~0 5)} ~cond := #in~cond; {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {75135#(<= ~counter~0 5)} assume !(0 == ~cond); {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,414 INFO L290 TraceCheckUtils]: 54: Hoare triple {75135#(<= ~counter~0 5)} assume true; {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,415 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {75135#(<= ~counter~0 5)} {75135#(<= ~counter~0 5)} #94#return; {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {75135#(<= ~counter~0 5)} assume !!(0 != ~r~0); {75135#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:05,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {75135#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {75160#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,417 INFO L272 TraceCheckUtils]: 59: Hoare triple {75160#(<= ~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)); {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {75160#(<= ~counter~0 6)} ~cond := #in~cond; {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {75160#(<= ~counter~0 6)} assume !(0 == ~cond); {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {75160#(<= ~counter~0 6)} assume true; {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,418 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {75160#(<= ~counter~0 6)} {75160#(<= ~counter~0 6)} #96#return; {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {75160#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75160#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:05,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {75160#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {75185#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,420 INFO L272 TraceCheckUtils]: 67: Hoare triple {75185#(<= ~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)); {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {75185#(<= ~counter~0 7)} ~cond := #in~cond; {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {75185#(<= ~counter~0 7)} assume !(0 == ~cond); {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,421 INFO L290 TraceCheckUtils]: 70: Hoare triple {75185#(<= ~counter~0 7)} assume true; {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,421 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {75185#(<= ~counter~0 7)} {75185#(<= ~counter~0 7)} #96#return; {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {75185#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75185#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:05,422 INFO L290 TraceCheckUtils]: 73: Hoare triple {75185#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,422 INFO L290 TraceCheckUtils]: 74: Hoare triple {75210#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,423 INFO L272 TraceCheckUtils]: 75: Hoare triple {75210#(<= ~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)); {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,423 INFO L290 TraceCheckUtils]: 76: Hoare triple {75210#(<= ~counter~0 8)} ~cond := #in~cond; {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,423 INFO L290 TraceCheckUtils]: 77: Hoare triple {75210#(<= ~counter~0 8)} assume !(0 == ~cond); {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,424 INFO L290 TraceCheckUtils]: 78: Hoare triple {75210#(<= ~counter~0 8)} assume true; {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,424 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {75210#(<= ~counter~0 8)} {75210#(<= ~counter~0 8)} #96#return; {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {75210#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75210#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:05,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {75210#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {75235#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,426 INFO L272 TraceCheckUtils]: 83: Hoare triple {75235#(<= ~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)); {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,426 INFO L290 TraceCheckUtils]: 84: Hoare triple {75235#(<= ~counter~0 9)} ~cond := #in~cond; {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {75235#(<= ~counter~0 9)} assume !(0 == ~cond); {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {75235#(<= ~counter~0 9)} assume true; {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,427 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {75235#(<= ~counter~0 9)} {75235#(<= ~counter~0 9)} #96#return; {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,428 INFO L290 TraceCheckUtils]: 88: Hoare triple {75235#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75235#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:05,428 INFO L290 TraceCheckUtils]: 89: Hoare triple {75235#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,429 INFO L290 TraceCheckUtils]: 90: Hoare triple {75260#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,429 INFO L272 TraceCheckUtils]: 91: Hoare triple {75260#(<= ~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)); {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,429 INFO L290 TraceCheckUtils]: 92: Hoare triple {75260#(<= ~counter~0 10)} ~cond := #in~cond; {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,430 INFO L290 TraceCheckUtils]: 93: Hoare triple {75260#(<= ~counter~0 10)} assume !(0 == ~cond); {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,430 INFO L290 TraceCheckUtils]: 94: Hoare triple {75260#(<= ~counter~0 10)} assume true; {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,430 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {75260#(<= ~counter~0 10)} {75260#(<= ~counter~0 10)} #96#return; {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,431 INFO L290 TraceCheckUtils]: 96: Hoare triple {75260#(<= ~counter~0 10)} assume !(~r~0 > 0); {75260#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:05,431 INFO L290 TraceCheckUtils]: 97: Hoare triple {75260#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,432 INFO L290 TraceCheckUtils]: 98: Hoare triple {75285#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,432 INFO L272 TraceCheckUtils]: 99: Hoare triple {75285#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,432 INFO L290 TraceCheckUtils]: 100: Hoare triple {75285#(<= ~counter~0 11)} ~cond := #in~cond; {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,433 INFO L290 TraceCheckUtils]: 101: Hoare triple {75285#(<= ~counter~0 11)} assume !(0 == ~cond); {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,433 INFO L290 TraceCheckUtils]: 102: Hoare triple {75285#(<= ~counter~0 11)} assume true; {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,434 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {75285#(<= ~counter~0 11)} {75285#(<= ~counter~0 11)} #98#return; {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,434 INFO L290 TraceCheckUtils]: 104: Hoare triple {75285#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75285#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:05,434 INFO L290 TraceCheckUtils]: 105: Hoare triple {75285#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75310#(<= |main_#t~post8| 11)} is VALID [2022-04-15 09:07:05,434 INFO L290 TraceCheckUtils]: 106: Hoare triple {75310#(<= |main_#t~post8| 11)} assume !(#t~post8 < 50);havoc #t~post8; {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L290 TraceCheckUtils]: 107: Hoare triple {74979#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L290 TraceCheckUtils]: 108: Hoare triple {74979#false} assume !(#t~post6 < 50);havoc #t~post6; {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L272 TraceCheckUtils]: 109: Hoare triple {74979#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)); {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L290 TraceCheckUtils]: 110: Hoare triple {74979#false} ~cond := #in~cond; {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L290 TraceCheckUtils]: 111: Hoare triple {74979#false} assume 0 == ~cond; {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L290 TraceCheckUtils]: 112: Hoare triple {74979#false} assume !false; {74979#false} is VALID [2022-04-15 09:07:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:07:05,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:07:05,977 INFO L290 TraceCheckUtils]: 112: Hoare triple {74979#false} assume !false; {74979#false} is VALID [2022-04-15 09:07:05,977 INFO L290 TraceCheckUtils]: 111: Hoare triple {74979#false} assume 0 == ~cond; {74979#false} is VALID [2022-04-15 09:07:05,977 INFO L290 TraceCheckUtils]: 110: Hoare triple {74979#false} ~cond := #in~cond; {74979#false} is VALID [2022-04-15 09:07:05,977 INFO L272 TraceCheckUtils]: 109: Hoare triple {74979#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)); {74979#false} is VALID [2022-04-15 09:07:05,977 INFO L290 TraceCheckUtils]: 108: Hoare triple {74979#false} assume !(#t~post6 < 50);havoc #t~post6; {74979#false} is VALID [2022-04-15 09:07:05,977 INFO L290 TraceCheckUtils]: 107: Hoare triple {74979#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {74979#false} is VALID [2022-04-15 09:07:05,977 INFO L290 TraceCheckUtils]: 106: Hoare triple {75350#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {74979#false} is VALID [2022-04-15 09:07:05,978 INFO L290 TraceCheckUtils]: 105: Hoare triple {75354#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75350#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:07:05,978 INFO L290 TraceCheckUtils]: 104: Hoare triple {75354#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75354#(< ~counter~0 50)} is VALID [2022-04-15 09:07:05,978 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {74978#true} {75354#(< ~counter~0 50)} #98#return; {75354#(< ~counter~0 50)} is VALID [2022-04-15 09:07:05,978 INFO L290 TraceCheckUtils]: 102: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,979 INFO L290 TraceCheckUtils]: 101: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,979 INFO L272 TraceCheckUtils]: 99: Hoare triple {75354#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {75354#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {75354#(< ~counter~0 50)} is VALID [2022-04-15 09:07:05,980 INFO L290 TraceCheckUtils]: 97: Hoare triple {75379#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75354#(< ~counter~0 50)} is VALID [2022-04-15 09:07:05,981 INFO L290 TraceCheckUtils]: 96: Hoare triple {75379#(< ~counter~0 49)} assume !(~r~0 > 0); {75379#(< ~counter~0 49)} is VALID [2022-04-15 09:07:05,981 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {74978#true} {75379#(< ~counter~0 49)} #96#return; {75379#(< ~counter~0 49)} is VALID [2022-04-15 09:07:05,981 INFO L290 TraceCheckUtils]: 94: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,981 INFO L290 TraceCheckUtils]: 93: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,981 INFO L290 TraceCheckUtils]: 92: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,981 INFO L272 TraceCheckUtils]: 91: Hoare triple {75379#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,982 INFO L290 TraceCheckUtils]: 90: Hoare triple {75379#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {75379#(< ~counter~0 49)} is VALID [2022-04-15 09:07:05,982 INFO L290 TraceCheckUtils]: 89: Hoare triple {75404#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75379#(< ~counter~0 49)} is VALID [2022-04-15 09:07:05,983 INFO L290 TraceCheckUtils]: 88: Hoare triple {75404#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75404#(< ~counter~0 48)} is VALID [2022-04-15 09:07:05,983 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {74978#true} {75404#(< ~counter~0 48)} #96#return; {75404#(< ~counter~0 48)} is VALID [2022-04-15 09:07:05,983 INFO L290 TraceCheckUtils]: 86: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,983 INFO L290 TraceCheckUtils]: 85: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,983 INFO L290 TraceCheckUtils]: 84: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,983 INFO L272 TraceCheckUtils]: 83: Hoare triple {75404#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,983 INFO L290 TraceCheckUtils]: 82: Hoare triple {75404#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {75404#(< ~counter~0 48)} is VALID [2022-04-15 09:07:05,984 INFO L290 TraceCheckUtils]: 81: Hoare triple {75429#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75404#(< ~counter~0 48)} is VALID [2022-04-15 09:07:05,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {75429#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75429#(< ~counter~0 47)} is VALID [2022-04-15 09:07:05,985 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {74978#true} {75429#(< ~counter~0 47)} #96#return; {75429#(< ~counter~0 47)} is VALID [2022-04-15 09:07:05,985 INFO L290 TraceCheckUtils]: 78: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,985 INFO L290 TraceCheckUtils]: 77: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,985 INFO L290 TraceCheckUtils]: 76: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,985 INFO L272 TraceCheckUtils]: 75: Hoare triple {75429#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {75429#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {75429#(< ~counter~0 47)} is VALID [2022-04-15 09:07:05,986 INFO L290 TraceCheckUtils]: 73: Hoare triple {75454#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75429#(< ~counter~0 47)} is VALID [2022-04-15 09:07:05,986 INFO L290 TraceCheckUtils]: 72: Hoare triple {75454#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75454#(< ~counter~0 46)} is VALID [2022-04-15 09:07:05,987 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {74978#true} {75454#(< ~counter~0 46)} #96#return; {75454#(< ~counter~0 46)} is VALID [2022-04-15 09:07:05,987 INFO L290 TraceCheckUtils]: 70: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,987 INFO L290 TraceCheckUtils]: 69: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,987 INFO L290 TraceCheckUtils]: 68: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,987 INFO L272 TraceCheckUtils]: 67: Hoare triple {75454#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {75454#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {75454#(< ~counter~0 46)} is VALID [2022-04-15 09:07:05,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {75479#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75454#(< ~counter~0 46)} is VALID [2022-04-15 09:07:05,988 INFO L290 TraceCheckUtils]: 64: Hoare triple {75479#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75479#(< ~counter~0 45)} is VALID [2022-04-15 09:07:05,989 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {74978#true} {75479#(< ~counter~0 45)} #96#return; {75479#(< ~counter~0 45)} is VALID [2022-04-15 09:07:05,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,989 INFO L272 TraceCheckUtils]: 59: Hoare triple {75479#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {75479#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {75479#(< ~counter~0 45)} is VALID [2022-04-15 09:07:05,990 INFO L290 TraceCheckUtils]: 57: Hoare triple {75504#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75479#(< ~counter~0 45)} is VALID [2022-04-15 09:07:05,990 INFO L290 TraceCheckUtils]: 56: Hoare triple {75504#(< ~counter~0 44)} assume !!(0 != ~r~0); {75504#(< ~counter~0 44)} is VALID [2022-04-15 09:07:05,991 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {74978#true} {75504#(< ~counter~0 44)} #94#return; {75504#(< ~counter~0 44)} is VALID [2022-04-15 09:07:05,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,991 INFO L272 TraceCheckUtils]: 51: Hoare triple {75504#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {75504#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {75504#(< ~counter~0 44)} is VALID [2022-04-15 09:07:05,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {75529#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75504#(< ~counter~0 44)} is VALID [2022-04-15 09:07:05,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {75529#(< ~counter~0 43)} assume !(~r~0 < 0); {75529#(< ~counter~0 43)} is VALID [2022-04-15 09:07:05,992 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {74978#true} {75529#(< ~counter~0 43)} #98#return; {75529#(< ~counter~0 43)} is VALID [2022-04-15 09:07:05,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,993 INFO L272 TraceCheckUtils]: 43: Hoare triple {75529#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {75529#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {75529#(< ~counter~0 43)} is VALID [2022-04-15 09:07:05,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {75554#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75529#(< ~counter~0 43)} is VALID [2022-04-15 09:07:05,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {75554#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75554#(< ~counter~0 42)} is VALID [2022-04-15 09:07:05,994 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {74978#true} {75554#(< ~counter~0 42)} #98#return; {75554#(< ~counter~0 42)} is VALID [2022-04-15 09:07:05,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,995 INFO L272 TraceCheckUtils]: 35: Hoare triple {75554#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {75554#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {75554#(< ~counter~0 42)} is VALID [2022-04-15 09:07:05,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {75579#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75554#(< ~counter~0 42)} is VALID [2022-04-15 09:07:05,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {75579#(< ~counter~0 41)} assume !(~r~0 > 0); {75579#(< ~counter~0 41)} is VALID [2022-04-15 09:07:05,996 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {74978#true} {75579#(< ~counter~0 41)} #96#return; {75579#(< ~counter~0 41)} is VALID [2022-04-15 09:07:05,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,997 INFO L272 TraceCheckUtils]: 27: Hoare triple {75579#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {75579#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {75579#(< ~counter~0 41)} is VALID [2022-04-15 09:07:05,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {75604#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75579#(< ~counter~0 41)} is VALID [2022-04-15 09:07:05,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {75604#(< ~counter~0 40)} assume !!(0 != ~r~0); {75604#(< ~counter~0 40)} is VALID [2022-04-15 09:07:05,998 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {74978#true} {75604#(< ~counter~0 40)} #94#return; {75604#(< ~counter~0 40)} is VALID [2022-04-15 09:07:05,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:05,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:05,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:05,998 INFO L272 TraceCheckUtils]: 19: Hoare triple {75604#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:05,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {75604#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {75604#(< ~counter~0 40)} is VALID [2022-04-15 09:07:05,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {75629#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75604#(< ~counter~0 40)} is VALID [2022-04-15 09:07:06,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {75629#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,000 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {74978#true} {75629#(< ~counter~0 39)} #92#return; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:06,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:06,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:06,000 INFO L272 TraceCheckUtils]: 11: Hoare triple {75629#(< ~counter~0 39)} 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)); {74978#true} is VALID [2022-04-15 09:07:06,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {74978#true} {75629#(< ~counter~0 39)} #90#return; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {74978#true} assume true; {74978#true} is VALID [2022-04-15 09:07:06,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {74978#true} assume !(0 == ~cond); {74978#true} is VALID [2022-04-15 09:07:06,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {74978#true} ~cond := #in~cond; {74978#true} is VALID [2022-04-15 09:07:06,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {75629#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {74978#true} is VALID [2022-04-15 09:07:06,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {75629#(< ~counter~0 39)} 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; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {75629#(< ~counter~0 39)} call #t~ret9 := main(); {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75629#(< ~counter~0 39)} {74978#true} #102#return; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {75629#(< ~counter~0 39)} assume true; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {74978#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; {75629#(< ~counter~0 39)} is VALID [2022-04-15 09:07:06,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {74978#true} call ULTIMATE.init(); {74978#true} is VALID [2022-04-15 09:07:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 09:07:06,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:07:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562474104] [2022-04-15 09:07:06,003 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:07:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135381126] [2022-04-15 09:07:06,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135381126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:07:06,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:07:06,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 09:07:06,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:07:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425125626] [2022-04-15 09:07:06,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425125626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:07:06,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:07:06,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 09:07:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959286966] [2022-04-15 09:07:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:07:06,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-15 09:07:06,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:07:06,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:06,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:06,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 09:07:06,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:07:06,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 09:07:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 09:07:06,087 INFO L87 Difference]: Start difference. First operand 600 states and 798 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:08,782 INFO L93 Difference]: Finished difference Result 825 states and 1134 transitions. [2022-04-15 09:07:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 09:07:08,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 113 [2022-04-15 09:07:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:07:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 09:07:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 09:07:08,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-15 09:07:09,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:09,031 INFO L225 Difference]: With dead ends: 825 [2022-04-15 09:07:09,031 INFO L226 Difference]: Without dead ends: 628 [2022-04-15 09:07:09,032 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=555, Invalid=777, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 09:07:09,032 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 175 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:07:09,033 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 267 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:07:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-04-15 09:07:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 618. [2022-04-15 09:07:10,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:07:10,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 628 states. Second operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:10,248 INFO L74 IsIncluded]: Start isIncluded. First operand 628 states. Second operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:10,248 INFO L87 Difference]: Start difference. First operand 628 states. Second operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:10,262 INFO L93 Difference]: Finished difference Result 628 states and 830 transitions. [2022-04-15 09:07:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 830 transitions. [2022-04-15 09:07:10,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:07:10,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:07:10,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 628 states. [2022-04-15 09:07:10,264 INFO L87 Difference]: Start difference. First operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 628 states. [2022-04-15 09:07:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:10,277 INFO L93 Difference]: Finished difference Result 628 states and 830 transitions. [2022-04-15 09:07:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 830 transitions. [2022-04-15 09:07:10,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:07:10,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:07:10,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:07:10,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:07:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 466 states have (on average 1.2188841201716738) internal successors, (568), 470 states have internal predecessors, (568), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 820 transitions. [2022-04-15 09:07:10,295 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 820 transitions. Word has length 113 [2022-04-15 09:07:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:07:10,295 INFO L478 AbstractCegarLoop]: Abstraction has 618 states and 820 transitions. [2022-04-15 09:07:10,295 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:10,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 618 states and 820 transitions. [2022-04-15 09:07:24,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 820 edges. 818 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:24,529 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 820 transitions. [2022-04-15 09:07:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 09:07:24,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:07:24,530 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-04-15 09:07:24,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 09:07:24,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 09:07:24,730 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:07:24,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:07:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-15 09:07:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:07:24,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [499239865] [2022-04-15 09:07:24,731 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:07:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-15 09:07:24,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:07:24,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704938382] [2022-04-15 09:07:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:07:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:07:24,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:07:24,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886702033] [2022-04-15 09:07:24,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:07:24,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:07:24,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:07:24,768 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:07:24,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 09:07:24,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:07:24,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:07:24,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 09:07:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:07:24,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:07:25,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {79843#true} call ULTIMATE.init(); {79843#true} is VALID [2022-04-15 09:07:25,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {79843#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; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {79851#(<= ~counter~0 0)} assume true; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79851#(<= ~counter~0 0)} {79843#true} #102#return; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {79851#(<= ~counter~0 0)} call #t~ret9 := main(); {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {79851#(<= ~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; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,320 INFO L272 TraceCheckUtils]: 6: Hoare triple {79851#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {79851#(<= ~counter~0 0)} ~cond := #in~cond; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {79851#(<= ~counter~0 0)} assume !(0 == ~cond); {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {79851#(<= ~counter~0 0)} assume true; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79851#(<= ~counter~0 0)} {79851#(<= ~counter~0 0)} #90#return; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {79851#(<= ~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)); {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {79851#(<= ~counter~0 0)} ~cond := #in~cond; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {79851#(<= ~counter~0 0)} assume !(0 == ~cond); {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {79851#(<= ~counter~0 0)} assume true; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,323 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79851#(<= ~counter~0 0)} {79851#(<= ~counter~0 0)} #92#return; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {79851#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79851#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:25,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {79851#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {79900#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {79900#(<= ~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)); {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {79900#(<= ~counter~0 1)} ~cond := #in~cond; {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {79900#(<= ~counter~0 1)} assume !(0 == ~cond); {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {79900#(<= ~counter~0 1)} assume true; {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79900#(<= ~counter~0 1)} {79900#(<= ~counter~0 1)} #94#return; {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {79900#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79900#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:25,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {79900#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {79925#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,329 INFO L272 TraceCheckUtils]: 27: Hoare triple {79925#(<= ~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)); {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {79925#(<= ~counter~0 2)} ~cond := #in~cond; {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {79925#(<= ~counter~0 2)} assume !(0 == ~cond); {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {79925#(<= ~counter~0 2)} assume true; {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,330 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79925#(<= ~counter~0 2)} {79925#(<= ~counter~0 2)} #96#return; {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {79925#(<= ~counter~0 2)} assume !(~r~0 > 0); {79925#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:25,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {79925#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {79950#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,332 INFO L272 TraceCheckUtils]: 35: Hoare triple {79950#(<= ~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)); {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {79950#(<= ~counter~0 3)} ~cond := #in~cond; {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {79950#(<= ~counter~0 3)} assume !(0 == ~cond); {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {79950#(<= ~counter~0 3)} assume true; {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,333 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79950#(<= ~counter~0 3)} {79950#(<= ~counter~0 3)} #98#return; {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {79950#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79950#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:25,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {79950#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {79975#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,335 INFO L272 TraceCheckUtils]: 43: Hoare triple {79975#(<= ~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)); {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {79975#(<= ~counter~0 4)} ~cond := #in~cond; {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {79975#(<= ~counter~0 4)} assume !(0 == ~cond); {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {79975#(<= ~counter~0 4)} assume true; {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,337 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79975#(<= ~counter~0 4)} {79975#(<= ~counter~0 4)} #98#return; {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {79975#(<= ~counter~0 4)} assume !(~r~0 < 0); {79975#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:25,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {79975#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {80000#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,338 INFO L272 TraceCheckUtils]: 51: Hoare triple {80000#(<= ~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)); {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {80000#(<= ~counter~0 5)} ~cond := #in~cond; {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {80000#(<= ~counter~0 5)} assume !(0 == ~cond); {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {80000#(<= ~counter~0 5)} assume true; {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,340 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {80000#(<= ~counter~0 5)} {80000#(<= ~counter~0 5)} #94#return; {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {80000#(<= ~counter~0 5)} assume !!(0 != ~r~0); {80000#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:25,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {80000#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {80025#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,341 INFO L272 TraceCheckUtils]: 59: Hoare triple {80025#(<= ~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)); {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {80025#(<= ~counter~0 6)} ~cond := #in~cond; {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {80025#(<= ~counter~0 6)} assume !(0 == ~cond); {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {80025#(<= ~counter~0 6)} assume true; {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,343 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {80025#(<= ~counter~0 6)} {80025#(<= ~counter~0 6)} #96#return; {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {80025#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80025#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:25,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {80025#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,344 INFO L290 TraceCheckUtils]: 66: Hoare triple {80050#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,345 INFO L272 TraceCheckUtils]: 67: Hoare triple {80050#(<= ~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)); {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,345 INFO L290 TraceCheckUtils]: 68: Hoare triple {80050#(<= ~counter~0 7)} ~cond := #in~cond; {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,345 INFO L290 TraceCheckUtils]: 69: Hoare triple {80050#(<= ~counter~0 7)} assume !(0 == ~cond); {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {80050#(<= ~counter~0 7)} assume true; {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,346 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {80050#(<= ~counter~0 7)} {80050#(<= ~counter~0 7)} #96#return; {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {80050#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80050#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:25,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {80050#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {80075#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,348 INFO L272 TraceCheckUtils]: 75: Hoare triple {80075#(<= ~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)); {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,348 INFO L290 TraceCheckUtils]: 76: Hoare triple {80075#(<= ~counter~0 8)} ~cond := #in~cond; {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,348 INFO L290 TraceCheckUtils]: 77: Hoare triple {80075#(<= ~counter~0 8)} assume !(0 == ~cond); {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,349 INFO L290 TraceCheckUtils]: 78: Hoare triple {80075#(<= ~counter~0 8)} assume true; {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,349 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {80075#(<= ~counter~0 8)} {80075#(<= ~counter~0 8)} #96#return; {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,349 INFO L290 TraceCheckUtils]: 80: Hoare triple {80075#(<= ~counter~0 8)} assume !(~r~0 > 0); {80075#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:25,350 INFO L290 TraceCheckUtils]: 81: Hoare triple {80075#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,350 INFO L290 TraceCheckUtils]: 82: Hoare triple {80100#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,351 INFO L272 TraceCheckUtils]: 83: Hoare triple {80100#(<= ~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)); {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {80100#(<= ~counter~0 9)} ~cond := #in~cond; {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {80100#(<= ~counter~0 9)} assume !(0 == ~cond); {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,352 INFO L290 TraceCheckUtils]: 86: Hoare triple {80100#(<= ~counter~0 9)} assume true; {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,352 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {80100#(<= ~counter~0 9)} {80100#(<= ~counter~0 9)} #98#return; {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {80100#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80100#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:25,353 INFO L290 TraceCheckUtils]: 89: Hoare triple {80100#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,353 INFO L290 TraceCheckUtils]: 90: Hoare triple {80125#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,354 INFO L272 TraceCheckUtils]: 91: Hoare triple {80125#(<= ~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)); {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,354 INFO L290 TraceCheckUtils]: 92: Hoare triple {80125#(<= ~counter~0 10)} ~cond := #in~cond; {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,355 INFO L290 TraceCheckUtils]: 93: Hoare triple {80125#(<= ~counter~0 10)} assume !(0 == ~cond); {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,355 INFO L290 TraceCheckUtils]: 94: Hoare triple {80125#(<= ~counter~0 10)} assume true; {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,355 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {80125#(<= ~counter~0 10)} {80125#(<= ~counter~0 10)} #98#return; {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,356 INFO L290 TraceCheckUtils]: 96: Hoare triple {80125#(<= ~counter~0 10)} assume !(~r~0 < 0); {80125#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:25,356 INFO L290 TraceCheckUtils]: 97: Hoare triple {80125#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {80150#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,357 INFO L272 TraceCheckUtils]: 99: Hoare triple {80150#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,357 INFO L290 TraceCheckUtils]: 100: Hoare triple {80150#(<= ~counter~0 11)} ~cond := #in~cond; {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,358 INFO L290 TraceCheckUtils]: 101: Hoare triple {80150#(<= ~counter~0 11)} assume !(0 == ~cond); {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,358 INFO L290 TraceCheckUtils]: 102: Hoare triple {80150#(<= ~counter~0 11)} assume true; {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,358 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {80150#(<= ~counter~0 11)} {80150#(<= ~counter~0 11)} #94#return; {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,359 INFO L290 TraceCheckUtils]: 104: Hoare triple {80150#(<= ~counter~0 11)} assume !!(0 != ~r~0); {80150#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:25,359 INFO L290 TraceCheckUtils]: 105: Hoare triple {80150#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80175#(<= |main_#t~post7| 11)} is VALID [2022-04-15 09:07:25,359 INFO L290 TraceCheckUtils]: 106: Hoare triple {80175#(<= |main_#t~post7| 11)} assume !(#t~post7 < 50);havoc #t~post7; {79844#false} is VALID [2022-04-15 09:07:25,359 INFO L290 TraceCheckUtils]: 107: Hoare triple {79844#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L290 TraceCheckUtils]: 108: Hoare triple {79844#false} assume !(#t~post8 < 50);havoc #t~post8; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L290 TraceCheckUtils]: 109: Hoare triple {79844#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L290 TraceCheckUtils]: 110: Hoare triple {79844#false} assume !(#t~post6 < 50);havoc #t~post6; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L272 TraceCheckUtils]: 111: Hoare triple {79844#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)); {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L290 TraceCheckUtils]: 112: Hoare triple {79844#false} ~cond := #in~cond; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L290 TraceCheckUtils]: 113: Hoare triple {79844#false} assume 0 == ~cond; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L290 TraceCheckUtils]: 114: Hoare triple {79844#false} assume !false; {79844#false} is VALID [2022-04-15 09:07:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:07:25,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:07:25,965 INFO L290 TraceCheckUtils]: 114: Hoare triple {79844#false} assume !false; {79844#false} is VALID [2022-04-15 09:07:25,965 INFO L290 TraceCheckUtils]: 113: Hoare triple {79844#false} assume 0 == ~cond; {79844#false} is VALID [2022-04-15 09:07:25,966 INFO L290 TraceCheckUtils]: 112: Hoare triple {79844#false} ~cond := #in~cond; {79844#false} is VALID [2022-04-15 09:07:25,966 INFO L272 TraceCheckUtils]: 111: Hoare triple {79844#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)); {79844#false} is VALID [2022-04-15 09:07:25,966 INFO L290 TraceCheckUtils]: 110: Hoare triple {79844#false} assume !(#t~post6 < 50);havoc #t~post6; {79844#false} is VALID [2022-04-15 09:07:25,966 INFO L290 TraceCheckUtils]: 109: Hoare triple {79844#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79844#false} is VALID [2022-04-15 09:07:25,966 INFO L290 TraceCheckUtils]: 108: Hoare triple {79844#false} assume !(#t~post8 < 50);havoc #t~post8; {79844#false} is VALID [2022-04-15 09:07:25,966 INFO L290 TraceCheckUtils]: 107: Hoare triple {79844#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79844#false} is VALID [2022-04-15 09:07:25,972 INFO L290 TraceCheckUtils]: 106: Hoare triple {80227#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {79844#false} is VALID [2022-04-15 09:07:25,972 INFO L290 TraceCheckUtils]: 105: Hoare triple {80231#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80227#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:07:25,973 INFO L290 TraceCheckUtils]: 104: Hoare triple {80231#(< ~counter~0 50)} assume !!(0 != ~r~0); {80231#(< ~counter~0 50)} is VALID [2022-04-15 09:07:25,973 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79843#true} {80231#(< ~counter~0 50)} #94#return; {80231#(< ~counter~0 50)} is VALID [2022-04-15 09:07:25,973 INFO L290 TraceCheckUtils]: 102: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,973 INFO L290 TraceCheckUtils]: 101: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,973 INFO L290 TraceCheckUtils]: 100: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,973 INFO L272 TraceCheckUtils]: 99: Hoare triple {80231#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,974 INFO L290 TraceCheckUtils]: 98: Hoare triple {80231#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {80231#(< ~counter~0 50)} is VALID [2022-04-15 09:07:25,975 INFO L290 TraceCheckUtils]: 97: Hoare triple {80256#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80231#(< ~counter~0 50)} is VALID [2022-04-15 09:07:25,975 INFO L290 TraceCheckUtils]: 96: Hoare triple {80256#(< ~counter~0 49)} assume !(~r~0 < 0); {80256#(< ~counter~0 49)} is VALID [2022-04-15 09:07:25,976 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79843#true} {80256#(< ~counter~0 49)} #98#return; {80256#(< ~counter~0 49)} is VALID [2022-04-15 09:07:25,976 INFO L290 TraceCheckUtils]: 94: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,976 INFO L290 TraceCheckUtils]: 93: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,976 INFO L290 TraceCheckUtils]: 92: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,976 INFO L272 TraceCheckUtils]: 91: Hoare triple {80256#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {80256#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {80256#(< ~counter~0 49)} is VALID [2022-04-15 09:07:25,977 INFO L290 TraceCheckUtils]: 89: Hoare triple {80281#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80256#(< ~counter~0 49)} is VALID [2022-04-15 09:07:25,977 INFO L290 TraceCheckUtils]: 88: Hoare triple {80281#(< ~counter~0 48)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80281#(< ~counter~0 48)} is VALID [2022-04-15 09:07:25,978 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79843#true} {80281#(< ~counter~0 48)} #98#return; {80281#(< ~counter~0 48)} is VALID [2022-04-15 09:07:25,978 INFO L290 TraceCheckUtils]: 86: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,978 INFO L290 TraceCheckUtils]: 85: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,978 INFO L272 TraceCheckUtils]: 83: Hoare triple {80281#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,978 INFO L290 TraceCheckUtils]: 82: Hoare triple {80281#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {80281#(< ~counter~0 48)} is VALID [2022-04-15 09:07:25,979 INFO L290 TraceCheckUtils]: 81: Hoare triple {80306#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80281#(< ~counter~0 48)} is VALID [2022-04-15 09:07:25,979 INFO L290 TraceCheckUtils]: 80: Hoare triple {80306#(< ~counter~0 47)} assume !(~r~0 > 0); {80306#(< ~counter~0 47)} is VALID [2022-04-15 09:07:25,980 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79843#true} {80306#(< ~counter~0 47)} #96#return; {80306#(< ~counter~0 47)} is VALID [2022-04-15 09:07:25,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,980 INFO L272 TraceCheckUtils]: 75: Hoare triple {80306#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,987 INFO L290 TraceCheckUtils]: 74: Hoare triple {80306#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {80306#(< ~counter~0 47)} is VALID [2022-04-15 09:07:25,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {80331#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80306#(< ~counter~0 47)} is VALID [2022-04-15 09:07:25,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {80331#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80331#(< ~counter~0 46)} is VALID [2022-04-15 09:07:25,988 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79843#true} {80331#(< ~counter~0 46)} #96#return; {80331#(< ~counter~0 46)} is VALID [2022-04-15 09:07:25,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,989 INFO L272 TraceCheckUtils]: 67: Hoare triple {80331#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,989 INFO L290 TraceCheckUtils]: 66: Hoare triple {80331#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {80331#(< ~counter~0 46)} is VALID [2022-04-15 09:07:25,990 INFO L290 TraceCheckUtils]: 65: Hoare triple {80356#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80331#(< ~counter~0 46)} is VALID [2022-04-15 09:07:25,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {80356#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80356#(< ~counter~0 45)} is VALID [2022-04-15 09:07:25,990 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79843#true} {80356#(< ~counter~0 45)} #96#return; {80356#(< ~counter~0 45)} is VALID [2022-04-15 09:07:25,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,991 INFO L272 TraceCheckUtils]: 59: Hoare triple {80356#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {80356#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {80356#(< ~counter~0 45)} is VALID [2022-04-15 09:07:25,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {80381#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80356#(< ~counter~0 45)} is VALID [2022-04-15 09:07:25,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {80381#(< ~counter~0 44)} assume !!(0 != ~r~0); {80381#(< ~counter~0 44)} is VALID [2022-04-15 09:07:25,992 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79843#true} {80381#(< ~counter~0 44)} #94#return; {80381#(< ~counter~0 44)} is VALID [2022-04-15 09:07:25,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,992 INFO L290 TraceCheckUtils]: 53: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,992 INFO L290 TraceCheckUtils]: 52: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,993 INFO L272 TraceCheckUtils]: 51: Hoare triple {80381#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {80381#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {80381#(< ~counter~0 44)} is VALID [2022-04-15 09:07:25,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {80406#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80381#(< ~counter~0 44)} is VALID [2022-04-15 09:07:25,994 INFO L290 TraceCheckUtils]: 48: Hoare triple {80406#(< ~counter~0 43)} assume !(~r~0 < 0); {80406#(< ~counter~0 43)} is VALID [2022-04-15 09:07:25,994 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79843#true} {80406#(< ~counter~0 43)} #98#return; {80406#(< ~counter~0 43)} is VALID [2022-04-15 09:07:25,994 INFO L290 TraceCheckUtils]: 46: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,994 INFO L272 TraceCheckUtils]: 43: Hoare triple {80406#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {80406#(< ~counter~0 43)} assume !!(#t~post8 < 50);havoc #t~post8; {80406#(< ~counter~0 43)} is VALID [2022-04-15 09:07:25,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {80431#(< ~counter~0 42)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80406#(< ~counter~0 43)} is VALID [2022-04-15 09:07:25,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {80431#(< ~counter~0 42)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80431#(< ~counter~0 42)} is VALID [2022-04-15 09:07:25,996 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79843#true} {80431#(< ~counter~0 42)} #98#return; {80431#(< ~counter~0 42)} is VALID [2022-04-15 09:07:25,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,996 INFO L272 TraceCheckUtils]: 35: Hoare triple {80431#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {80431#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {80431#(< ~counter~0 42)} is VALID [2022-04-15 09:07:25,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {80456#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80431#(< ~counter~0 42)} is VALID [2022-04-15 09:07:25,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {80456#(< ~counter~0 41)} assume !(~r~0 > 0); {80456#(< ~counter~0 41)} is VALID [2022-04-15 09:07:25,998 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79843#true} {80456#(< ~counter~0 41)} #96#return; {80456#(< ~counter~0 41)} is VALID [2022-04-15 09:07:25,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:25,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:25,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:25,998 INFO L272 TraceCheckUtils]: 27: Hoare triple {80456#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:25,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {80456#(< ~counter~0 41)} assume !!(#t~post7 < 50);havoc #t~post7; {80456#(< ~counter~0 41)} is VALID [2022-04-15 09:07:25,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {80481#(< ~counter~0 40)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80456#(< ~counter~0 41)} is VALID [2022-04-15 09:07:25,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {80481#(< ~counter~0 40)} assume !!(0 != ~r~0); {80481#(< ~counter~0 40)} is VALID [2022-04-15 09:07:26,000 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79843#true} {80481#(< ~counter~0 40)} #94#return; {80481#(< ~counter~0 40)} is VALID [2022-04-15 09:07:26,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:26,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:26,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:26,000 INFO L272 TraceCheckUtils]: 19: Hoare triple {80481#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:26,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {80481#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {80481#(< ~counter~0 40)} is VALID [2022-04-15 09:07:26,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {80506#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80481#(< ~counter~0 40)} is VALID [2022-04-15 09:07:26,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {80506#(< ~counter~0 39)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,002 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79843#true} {80506#(< ~counter~0 39)} #92#return; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:26,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:26,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:26,002 INFO L272 TraceCheckUtils]: 11: Hoare triple {80506#(< ~counter~0 39)} 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)); {79843#true} is VALID [2022-04-15 09:07:26,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79843#true} {80506#(< ~counter~0 39)} #90#return; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {79843#true} assume true; {79843#true} is VALID [2022-04-15 09:07:26,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {79843#true} assume !(0 == ~cond); {79843#true} is VALID [2022-04-15 09:07:26,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {79843#true} ~cond := #in~cond; {79843#true} is VALID [2022-04-15 09:07:26,003 INFO L272 TraceCheckUtils]: 6: Hoare triple {80506#(< ~counter~0 39)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79843#true} is VALID [2022-04-15 09:07:26,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {80506#(< ~counter~0 39)} 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; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {80506#(< ~counter~0 39)} call #t~ret9 := main(); {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80506#(< ~counter~0 39)} {79843#true} #102#return; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {80506#(< ~counter~0 39)} assume true; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {79843#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; {80506#(< ~counter~0 39)} is VALID [2022-04-15 09:07:26,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {79843#true} call ULTIMATE.init(); {79843#true} is VALID [2022-04-15 09:07:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 09:07:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:07:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704938382] [2022-04-15 09:07:26,005 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:07:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886702033] [2022-04-15 09:07:26,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886702033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:07:26,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:07:26,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 09:07:26,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:07:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [499239865] [2022-04-15 09:07:26,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [499239865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:07:26,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:07:26,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 09:07:26,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053517906] [2022-04-15 09:07:26,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:07:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-15 09:07:26,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:07:26,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:26,081 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-15 09:07:26,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 09:07:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:07:26,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 09:07:26,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 09:07:26,082 INFO L87 Difference]: Start difference. First operand 618 states and 820 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:28,507 INFO L93 Difference]: Finished difference Result 835 states and 1147 transitions. [2022-04-15 09:07:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 09:07:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 115 [2022-04-15 09:07:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:07:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 09:07:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 09:07:28,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-15 09:07:28,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:28,689 INFO L225 Difference]: With dead ends: 835 [2022-04-15 09:07:28,690 INFO L226 Difference]: Without dead ends: 634 [2022-04-15 09:07:28,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=590, Invalid=816, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 09:07:28,694 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 159 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:07:28,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 259 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:07:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-04-15 09:07:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2022-04-15 09:07:29,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:07:29,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 634 states. Second operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:29,755 INFO L74 IsIncluded]: Start isIncluded. First operand 634 states. Second operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:29,756 INFO L87 Difference]: Start difference. First operand 634 states. Second operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:29,771 INFO L93 Difference]: Finished difference Result 634 states and 836 transitions. [2022-04-15 09:07:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2022-04-15 09:07:29,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:07:29,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:07:29,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 634 states. [2022-04-15 09:07:29,773 INFO L87 Difference]: Start difference. First operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 634 states. [2022-04-15 09:07:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:29,786 INFO L93 Difference]: Finished difference Result 634 states and 836 transitions. [2022-04-15 09:07:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2022-04-15 09:07:29,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:07:29,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:07:29,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:07:29,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:07:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 482 states have (on average 1.2116182572614107) internal successors, (584), 482 states have internal predecessors, (584), 127 states have call successors, (127), 26 states have call predecessors, (127), 24 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 09:07:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 836 transitions. [2022-04-15 09:07:29,805 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 836 transitions. Word has length 115 [2022-04-15 09:07:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:07:29,805 INFO L478 AbstractCegarLoop]: Abstraction has 634 states and 836 transitions. [2022-04-15 09:07:29,805 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 14 states have call successors, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-15 09:07:29,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 634 states and 836 transitions. [2022-04-15 09:07:42,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 836 edges. 835 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 836 transitions. [2022-04-15 09:07:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 09:07:42,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:07:42,252 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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] [2022-04-15 09:07:42,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 09:07:42,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 09:07:42,453 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:07:42,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:07:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-15 09:07:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:07:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626185804] [2022-04-15 09:07:42,454 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:07:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-15 09:07:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:07:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297605468] [2022-04-15 09:07:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:07:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:07:42,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:07:42,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526297572] [2022-04-15 09:07:42,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:07:42,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:07:42,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:07:42,467 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:07:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 09:07:42,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:07:42,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:07:42,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 09:07:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:07:42,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:07:43,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {84786#true} call ULTIMATE.init(); {84786#true} is VALID [2022-04-15 09:07:43,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {84786#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; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {84794#(<= ~counter~0 0)} assume true; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84794#(<= ~counter~0 0)} {84786#true} #102#return; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {84794#(<= ~counter~0 0)} call #t~ret9 := main(); {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {84794#(<= ~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; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {84794#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {84794#(<= ~counter~0 0)} ~cond := #in~cond; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {84794#(<= ~counter~0 0)} assume !(0 == ~cond); {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {84794#(<= ~counter~0 0)} assume true; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84794#(<= ~counter~0 0)} {84794#(<= ~counter~0 0)} #90#return; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,212 INFO L272 TraceCheckUtils]: 11: Hoare triple {84794#(<= ~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)); {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {84794#(<= ~counter~0 0)} ~cond := #in~cond; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {84794#(<= ~counter~0 0)} assume !(0 == ~cond); {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {84794#(<= ~counter~0 0)} assume true; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,213 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84794#(<= ~counter~0 0)} {84794#(<= ~counter~0 0)} #92#return; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {84794#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {84794#(<= ~counter~0 0)} is VALID [2022-04-15 09:07:43,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {84794#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {84843#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,216 INFO L272 TraceCheckUtils]: 19: Hoare triple {84843#(<= ~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)); {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {84843#(<= ~counter~0 1)} ~cond := #in~cond; {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {84843#(<= ~counter~0 1)} assume !(0 == ~cond); {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {84843#(<= ~counter~0 1)} assume true; {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,217 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84843#(<= ~counter~0 1)} {84843#(<= ~counter~0 1)} #94#return; {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {84843#(<= ~counter~0 1)} assume !!(0 != ~r~0); {84843#(<= ~counter~0 1)} is VALID [2022-04-15 09:07:43,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {84843#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {84868#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,219 INFO L272 TraceCheckUtils]: 27: Hoare triple {84868#(<= ~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)); {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {84868#(<= ~counter~0 2)} ~cond := #in~cond; {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {84868#(<= ~counter~0 2)} assume !(0 == ~cond); {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {84868#(<= ~counter~0 2)} assume true; {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,220 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84868#(<= ~counter~0 2)} {84868#(<= ~counter~0 2)} #96#return; {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {84868#(<= ~counter~0 2)} assume !(~r~0 > 0); {84868#(<= ~counter~0 2)} is VALID [2022-04-15 09:07:43,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {84868#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {84893#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,222 INFO L272 TraceCheckUtils]: 35: Hoare triple {84893#(<= ~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)); {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {84893#(<= ~counter~0 3)} ~cond := #in~cond; {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {84893#(<= ~counter~0 3)} assume !(0 == ~cond); {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {84893#(<= ~counter~0 3)} assume true; {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,223 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84893#(<= ~counter~0 3)} {84893#(<= ~counter~0 3)} #98#return; {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {84893#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {84893#(<= ~counter~0 3)} is VALID [2022-04-15 09:07:43,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {84893#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {84918#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,225 INFO L272 TraceCheckUtils]: 43: Hoare triple {84918#(<= ~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)); {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {84918#(<= ~counter~0 4)} ~cond := #in~cond; {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {84918#(<= ~counter~0 4)} assume !(0 == ~cond); {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {84918#(<= ~counter~0 4)} assume true; {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,226 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84918#(<= ~counter~0 4)} {84918#(<= ~counter~0 4)} #98#return; {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {84918#(<= ~counter~0 4)} assume !(~r~0 < 0); {84918#(<= ~counter~0 4)} is VALID [2022-04-15 09:07:43,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {84918#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {84943#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,228 INFO L272 TraceCheckUtils]: 51: Hoare triple {84943#(<= ~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)); {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {84943#(<= ~counter~0 5)} ~cond := #in~cond; {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {84943#(<= ~counter~0 5)} assume !(0 == ~cond); {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {84943#(<= ~counter~0 5)} assume true; {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,229 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84943#(<= ~counter~0 5)} {84943#(<= ~counter~0 5)} #94#return; {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {84943#(<= ~counter~0 5)} assume !!(0 != ~r~0); {84943#(<= ~counter~0 5)} is VALID [2022-04-15 09:07:43,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {84943#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {84968#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,231 INFO L272 TraceCheckUtils]: 59: Hoare triple {84968#(<= ~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)); {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {84968#(<= ~counter~0 6)} ~cond := #in~cond; {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {84968#(<= ~counter~0 6)} assume !(0 == ~cond); {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {84968#(<= ~counter~0 6)} assume true; {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,233 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84968#(<= ~counter~0 6)} {84968#(<= ~counter~0 6)} #96#return; {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {84968#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84968#(<= ~counter~0 6)} is VALID [2022-04-15 09:07:43,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {84968#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {84993#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,234 INFO L272 TraceCheckUtils]: 67: Hoare triple {84993#(<= ~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)); {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {84993#(<= ~counter~0 7)} ~cond := #in~cond; {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {84993#(<= ~counter~0 7)} assume !(0 == ~cond); {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,235 INFO L290 TraceCheckUtils]: 70: Hoare triple {84993#(<= ~counter~0 7)} assume true; {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,236 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84993#(<= ~counter~0 7)} {84993#(<= ~counter~0 7)} #96#return; {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {84993#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {84993#(<= ~counter~0 7)} is VALID [2022-04-15 09:07:43,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {84993#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {85018#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,238 INFO L272 TraceCheckUtils]: 75: Hoare triple {85018#(<= ~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)); {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {85018#(<= ~counter~0 8)} ~cond := #in~cond; {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {85018#(<= ~counter~0 8)} assume !(0 == ~cond); {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {85018#(<= ~counter~0 8)} assume true; {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,239 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85018#(<= ~counter~0 8)} {85018#(<= ~counter~0 8)} #96#return; {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {85018#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85018#(<= ~counter~0 8)} is VALID [2022-04-15 09:07:43,240 INFO L290 TraceCheckUtils]: 81: Hoare triple {85018#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,240 INFO L290 TraceCheckUtils]: 82: Hoare triple {85043#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,241 INFO L272 TraceCheckUtils]: 83: Hoare triple {85043#(<= ~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)); {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,241 INFO L290 TraceCheckUtils]: 84: Hoare triple {85043#(<= ~counter~0 9)} ~cond := #in~cond; {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,241 INFO L290 TraceCheckUtils]: 85: Hoare triple {85043#(<= ~counter~0 9)} assume !(0 == ~cond); {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,242 INFO L290 TraceCheckUtils]: 86: Hoare triple {85043#(<= ~counter~0 9)} assume true; {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,242 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85043#(<= ~counter~0 9)} {85043#(<= ~counter~0 9)} #96#return; {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {85043#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85043#(<= ~counter~0 9)} is VALID [2022-04-15 09:07:43,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {85043#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,243 INFO L290 TraceCheckUtils]: 90: Hoare triple {85068#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,244 INFO L272 TraceCheckUtils]: 91: Hoare triple {85068#(<= ~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)); {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,244 INFO L290 TraceCheckUtils]: 92: Hoare triple {85068#(<= ~counter~0 10)} ~cond := #in~cond; {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,244 INFO L290 TraceCheckUtils]: 93: Hoare triple {85068#(<= ~counter~0 10)} assume !(0 == ~cond); {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,245 INFO L290 TraceCheckUtils]: 94: Hoare triple {85068#(<= ~counter~0 10)} assume true; {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,245 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85068#(<= ~counter~0 10)} {85068#(<= ~counter~0 10)} #96#return; {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,246 INFO L290 TraceCheckUtils]: 96: Hoare triple {85068#(<= ~counter~0 10)} assume !(~r~0 > 0); {85068#(<= ~counter~0 10)} is VALID [2022-04-15 09:07:43,246 INFO L290 TraceCheckUtils]: 97: Hoare triple {85068#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,247 INFO L290 TraceCheckUtils]: 98: Hoare triple {85093#(<= ~counter~0 11)} assume !!(#t~post8 < 50);havoc #t~post8; {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,247 INFO L272 TraceCheckUtils]: 99: Hoare triple {85093#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,247 INFO L290 TraceCheckUtils]: 100: Hoare triple {85093#(<= ~counter~0 11)} ~cond := #in~cond; {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,248 INFO L290 TraceCheckUtils]: 101: Hoare triple {85093#(<= ~counter~0 11)} assume !(0 == ~cond); {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,248 INFO L290 TraceCheckUtils]: 102: Hoare triple {85093#(<= ~counter~0 11)} assume true; {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,248 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85093#(<= ~counter~0 11)} {85093#(<= ~counter~0 11)} #98#return; {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,249 INFO L290 TraceCheckUtils]: 104: Hoare triple {85093#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85093#(<= ~counter~0 11)} is VALID [2022-04-15 09:07:43,249 INFO L290 TraceCheckUtils]: 105: Hoare triple {85093#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,250 INFO L290 TraceCheckUtils]: 106: Hoare triple {85118#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,250 INFO L272 TraceCheckUtils]: 107: Hoare triple {85118#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,251 INFO L290 TraceCheckUtils]: 108: Hoare triple {85118#(<= ~counter~0 12)} ~cond := #in~cond; {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,251 INFO L290 TraceCheckUtils]: 109: Hoare triple {85118#(<= ~counter~0 12)} assume !(0 == ~cond); {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,251 INFO L290 TraceCheckUtils]: 110: Hoare triple {85118#(<= ~counter~0 12)} assume true; {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,252 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85118#(<= ~counter~0 12)} {85118#(<= ~counter~0 12)} #98#return; {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,252 INFO L290 TraceCheckUtils]: 112: Hoare triple {85118#(<= ~counter~0 12)} assume !(~r~0 < 0); {85118#(<= ~counter~0 12)} is VALID [2022-04-15 09:07:43,252 INFO L290 TraceCheckUtils]: 113: Hoare triple {85118#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85143#(<= |main_#t~post6| 12)} is VALID [2022-04-15 09:07:43,253 INFO L290 TraceCheckUtils]: 114: Hoare triple {85143#(<= |main_#t~post6| 12)} assume !(#t~post6 < 50);havoc #t~post6; {84787#false} is VALID [2022-04-15 09:07:43,253 INFO L272 TraceCheckUtils]: 115: Hoare triple {84787#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)); {84787#false} is VALID [2022-04-15 09:07:43,253 INFO L290 TraceCheckUtils]: 116: Hoare triple {84787#false} ~cond := #in~cond; {84787#false} is VALID [2022-04-15 09:07:43,253 INFO L290 TraceCheckUtils]: 117: Hoare triple {84787#false} assume 0 == ~cond; {84787#false} is VALID [2022-04-15 09:07:43,253 INFO L290 TraceCheckUtils]: 118: Hoare triple {84787#false} assume !false; {84787#false} is VALID [2022-04-15 09:07:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:07:43,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:07:43,935 INFO L290 TraceCheckUtils]: 118: Hoare triple {84787#false} assume !false; {84787#false} is VALID [2022-04-15 09:07:43,935 INFO L290 TraceCheckUtils]: 117: Hoare triple {84787#false} assume 0 == ~cond; {84787#false} is VALID [2022-04-15 09:07:43,935 INFO L290 TraceCheckUtils]: 116: Hoare triple {84787#false} ~cond := #in~cond; {84787#false} is VALID [2022-04-15 09:07:43,935 INFO L272 TraceCheckUtils]: 115: Hoare triple {84787#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)); {84787#false} is VALID [2022-04-15 09:07:43,936 INFO L290 TraceCheckUtils]: 114: Hoare triple {85171#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {84787#false} is VALID [2022-04-15 09:07:43,936 INFO L290 TraceCheckUtils]: 113: Hoare triple {85175#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85171#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:07:43,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {85175#(< ~counter~0 50)} assume !(~r~0 < 0); {85175#(< ~counter~0 50)} is VALID [2022-04-15 09:07:43,937 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {84786#true} {85175#(< ~counter~0 50)} #98#return; {85175#(< ~counter~0 50)} is VALID [2022-04-15 09:07:43,937 INFO L290 TraceCheckUtils]: 110: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,937 INFO L290 TraceCheckUtils]: 109: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,937 INFO L290 TraceCheckUtils]: 108: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,937 INFO L272 TraceCheckUtils]: 107: Hoare triple {85175#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,937 INFO L290 TraceCheckUtils]: 106: Hoare triple {85175#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {85175#(< ~counter~0 50)} is VALID [2022-04-15 09:07:43,939 INFO L290 TraceCheckUtils]: 105: Hoare triple {85200#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85175#(< ~counter~0 50)} is VALID [2022-04-15 09:07:43,939 INFO L290 TraceCheckUtils]: 104: Hoare triple {85200#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85200#(< ~counter~0 49)} is VALID [2022-04-15 09:07:43,939 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {84786#true} {85200#(< ~counter~0 49)} #98#return; {85200#(< ~counter~0 49)} is VALID [2022-04-15 09:07:43,939 INFO L290 TraceCheckUtils]: 102: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,940 INFO L290 TraceCheckUtils]: 101: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,940 INFO L290 TraceCheckUtils]: 100: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,940 INFO L272 TraceCheckUtils]: 99: Hoare triple {85200#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,940 INFO L290 TraceCheckUtils]: 98: Hoare triple {85200#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {85200#(< ~counter~0 49)} is VALID [2022-04-15 09:07:43,941 INFO L290 TraceCheckUtils]: 97: Hoare triple {85225#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85200#(< ~counter~0 49)} is VALID [2022-04-15 09:07:43,941 INFO L290 TraceCheckUtils]: 96: Hoare triple {85225#(< ~counter~0 48)} assume !(~r~0 > 0); {85225#(< ~counter~0 48)} is VALID [2022-04-15 09:07:43,941 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {84786#true} {85225#(< ~counter~0 48)} #96#return; {85225#(< ~counter~0 48)} is VALID [2022-04-15 09:07:43,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,942 INFO L272 TraceCheckUtils]: 91: Hoare triple {85225#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {85225#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {85225#(< ~counter~0 48)} is VALID [2022-04-15 09:07:43,943 INFO L290 TraceCheckUtils]: 89: Hoare triple {85250#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85225#(< ~counter~0 48)} is VALID [2022-04-15 09:07:43,943 INFO L290 TraceCheckUtils]: 88: Hoare triple {85250#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85250#(< ~counter~0 47)} is VALID [2022-04-15 09:07:43,943 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {84786#true} {85250#(< ~counter~0 47)} #96#return; {85250#(< ~counter~0 47)} is VALID [2022-04-15 09:07:43,944 INFO L290 TraceCheckUtils]: 86: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,944 INFO L290 TraceCheckUtils]: 85: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,944 INFO L290 TraceCheckUtils]: 84: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,944 INFO L272 TraceCheckUtils]: 83: Hoare triple {85250#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {85250#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {85250#(< ~counter~0 47)} is VALID [2022-04-15 09:07:43,945 INFO L290 TraceCheckUtils]: 81: Hoare triple {85275#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85250#(< ~counter~0 47)} is VALID [2022-04-15 09:07:43,945 INFO L290 TraceCheckUtils]: 80: Hoare triple {85275#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85275#(< ~counter~0 46)} is VALID [2022-04-15 09:07:43,945 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {84786#true} {85275#(< ~counter~0 46)} #96#return; {85275#(< ~counter~0 46)} is VALID [2022-04-15 09:07:43,946 INFO L290 TraceCheckUtils]: 78: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,946 INFO L290 TraceCheckUtils]: 77: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,946 INFO L272 TraceCheckUtils]: 75: Hoare triple {85275#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {85275#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {85275#(< ~counter~0 46)} is VALID [2022-04-15 09:07:43,947 INFO L290 TraceCheckUtils]: 73: Hoare triple {85300#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85275#(< ~counter~0 46)} is VALID [2022-04-15 09:07:43,947 INFO L290 TraceCheckUtils]: 72: Hoare triple {85300#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85300#(< ~counter~0 45)} is VALID [2022-04-15 09:07:43,947 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {84786#true} {85300#(< ~counter~0 45)} #96#return; {85300#(< ~counter~0 45)} is VALID [2022-04-15 09:07:43,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,948 INFO L290 TraceCheckUtils]: 68: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,948 INFO L272 TraceCheckUtils]: 67: Hoare triple {85300#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {85300#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {85300#(< ~counter~0 45)} is VALID [2022-04-15 09:07:43,949 INFO L290 TraceCheckUtils]: 65: Hoare triple {85325#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85300#(< ~counter~0 45)} is VALID [2022-04-15 09:07:43,949 INFO L290 TraceCheckUtils]: 64: Hoare triple {85325#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85325#(< ~counter~0 44)} is VALID [2022-04-15 09:07:43,949 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {84786#true} {85325#(< ~counter~0 44)} #96#return; {85325#(< ~counter~0 44)} is VALID [2022-04-15 09:07:43,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,950 INFO L272 TraceCheckUtils]: 59: Hoare triple {85325#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {85325#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {85325#(< ~counter~0 44)} is VALID [2022-04-15 09:07:43,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {85350#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85325#(< ~counter~0 44)} is VALID [2022-04-15 09:07:43,951 INFO L290 TraceCheckUtils]: 56: Hoare triple {85350#(< ~counter~0 43)} assume !!(0 != ~r~0); {85350#(< ~counter~0 43)} is VALID [2022-04-15 09:07:43,951 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {84786#true} {85350#(< ~counter~0 43)} #94#return; {85350#(< ~counter~0 43)} is VALID [2022-04-15 09:07:43,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,952 INFO L272 TraceCheckUtils]: 51: Hoare triple {85350#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {85350#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {85350#(< ~counter~0 43)} is VALID [2022-04-15 09:07:43,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {85375#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85350#(< ~counter~0 43)} is VALID [2022-04-15 09:07:43,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {85375#(< ~counter~0 42)} assume !(~r~0 < 0); {85375#(< ~counter~0 42)} is VALID [2022-04-15 09:07:43,953 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {84786#true} {85375#(< ~counter~0 42)} #98#return; {85375#(< ~counter~0 42)} is VALID [2022-04-15 09:07:43,954 INFO L290 TraceCheckUtils]: 46: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,954 INFO L290 TraceCheckUtils]: 45: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,954 INFO L290 TraceCheckUtils]: 44: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,954 INFO L272 TraceCheckUtils]: 43: Hoare triple {85375#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {85375#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {85375#(< ~counter~0 42)} is VALID [2022-04-15 09:07:43,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {85400#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85375#(< ~counter~0 42)} is VALID [2022-04-15 09:07:43,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {85400#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85400#(< ~counter~0 41)} is VALID [2022-04-15 09:07:43,955 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {84786#true} {85400#(< ~counter~0 41)} #98#return; {85400#(< ~counter~0 41)} is VALID [2022-04-15 09:07:43,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,956 INFO L272 TraceCheckUtils]: 35: Hoare triple {85400#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {85400#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {85400#(< ~counter~0 41)} is VALID [2022-04-15 09:07:43,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {85425#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85400#(< ~counter~0 41)} is VALID [2022-04-15 09:07:43,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {85425#(< ~counter~0 40)} assume !(~r~0 > 0); {85425#(< ~counter~0 40)} is VALID [2022-04-15 09:07:43,957 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {84786#true} {85425#(< ~counter~0 40)} #96#return; {85425#(< ~counter~0 40)} is VALID [2022-04-15 09:07:43,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,958 INFO L272 TraceCheckUtils]: 27: Hoare triple {85425#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {85425#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {85425#(< ~counter~0 40)} is VALID [2022-04-15 09:07:43,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {85450#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85425#(< ~counter~0 40)} is VALID [2022-04-15 09:07:43,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {85450#(< ~counter~0 39)} assume !!(0 != ~r~0); {85450#(< ~counter~0 39)} is VALID [2022-04-15 09:07:43,959 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {84786#true} {85450#(< ~counter~0 39)} #94#return; {85450#(< ~counter~0 39)} is VALID [2022-04-15 09:07:43,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,960 INFO L272 TraceCheckUtils]: 19: Hoare triple {85450#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {85450#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {85450#(< ~counter~0 39)} is VALID [2022-04-15 09:07:43,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {85475#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85450#(< ~counter~0 39)} is VALID [2022-04-15 09:07:43,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {85475#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {84786#true} {85475#(< ~counter~0 38)} #92#return; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,962 INFO L272 TraceCheckUtils]: 11: Hoare triple {85475#(< ~counter~0 38)} 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)); {84786#true} is VALID [2022-04-15 09:07:43,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84786#true} {85475#(< ~counter~0 38)} #90#return; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {84786#true} assume true; {84786#true} is VALID [2022-04-15 09:07:43,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {84786#true} assume !(0 == ~cond); {84786#true} is VALID [2022-04-15 09:07:43,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {84786#true} ~cond := #in~cond; {84786#true} is VALID [2022-04-15 09:07:43,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {85475#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {84786#true} is VALID [2022-04-15 09:07:43,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {85475#(< ~counter~0 38)} 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; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {85475#(< ~counter~0 38)} call #t~ret9 := main(); {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85475#(< ~counter~0 38)} {84786#true} #102#return; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {85475#(< ~counter~0 38)} assume true; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {84786#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; {85475#(< ~counter~0 38)} is VALID [2022-04-15 09:07:43,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {84786#true} call ULTIMATE.init(); {84786#true} is VALID [2022-04-15 09:07:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 09:07:43,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:07:43,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297605468] [2022-04-15 09:07:43,964 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:07:43,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526297572] [2022-04-15 09:07:43,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526297572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:07:43,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:07:43,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 09:07:43,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:07:43,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626185804] [2022-04-15 09:07:43,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626185804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:07:43,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:07:43,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 09:07:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259897160] [2022-04-15 09:07:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:07:43,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-15 09:07:43,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:07:43,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:07:44,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:44,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 09:07:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:07:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 09:07:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 09:07:44,109 INFO L87 Difference]: Start difference. First operand 634 states and 836 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:07:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:46,354 INFO L93 Difference]: Finished difference Result 693 states and 916 transitions. [2022-04-15 09:07:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 09:07:46,354 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 119 [2022-04-15 09:07:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:07:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:07:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 09:07:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:07:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 09:07:46,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-15 09:07:46,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:07:46,542 INFO L225 Difference]: With dead ends: 693 [2022-04-15 09:07:46,542 INFO L226 Difference]: Without dead ends: 682 [2022-04-15 09:07:46,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=620, Invalid=862, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 09:07:46,543 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 181 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:07:46,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 277 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:07:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-04-15 09:07:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 660. [2022-04-15 09:07:48,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:07:48,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:07:48,301 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:07:48,301 INFO L87 Difference]: Start difference. First operand 682 states. Second operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:07:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:48,321 INFO L93 Difference]: Finished difference Result 682 states and 900 transitions. [2022-04-15 09:07:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 900 transitions. [2022-04-15 09:07:48,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:07:48,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:07:48,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 682 states. [2022-04-15 09:07:48,323 INFO L87 Difference]: Start difference. First operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 682 states. [2022-04-15 09:07:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:07:48,339 INFO L93 Difference]: Finished difference Result 682 states and 900 transitions. [2022-04-15 09:07:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 900 transitions. [2022-04-15 09:07:48,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:07:48,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:07:48,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:07:48,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:07:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 493 states have (on average 1.208924949290061) internal successors, (596), 503 states have internal predecessors, (596), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:07:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-04-15 09:07:48,387 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 119 [2022-04-15 09:07:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:07:48,387 INFO L478 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-04-15 09:07:48,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:07:48,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 660 states and 874 transitions. [2022-04-15 09:08:04,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 874 edges. 873 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-04-15 09:08:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 09:08:04,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:08:04,972 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 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-15 09:08:04,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-15 09:08:05,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 09:08:05,172 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:08:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:08:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-15 09:08:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:08:05,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1056842187] [2022-04-15 09:08:05,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:08:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-15 09:08:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:08:05,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036328821] [2022-04-15 09:08:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:08:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:08:05,185 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:08:05,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327033213] [2022-04-15 09:08:05,185 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:08:05,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:08:05,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:08:05,191 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:08:05,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 09:08:05,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 09:08:05,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:08:05,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 09:08:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:08:05,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:08:06,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {89617#true} call ULTIMATE.init(); {89617#true} is VALID [2022-04-15 09:08:06,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {89617#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; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {89625#(<= ~counter~0 0)} assume true; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89625#(<= ~counter~0 0)} {89617#true} #102#return; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {89625#(<= ~counter~0 0)} call #t~ret9 := main(); {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {89625#(<= ~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; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {89625#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {89625#(<= ~counter~0 0)} ~cond := #in~cond; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {89625#(<= ~counter~0 0)} assume !(0 == ~cond); {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {89625#(<= ~counter~0 0)} assume true; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89625#(<= ~counter~0 0)} {89625#(<= ~counter~0 0)} #90#return; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,256 INFO L272 TraceCheckUtils]: 11: Hoare triple {89625#(<= ~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)); {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {89625#(<= ~counter~0 0)} ~cond := #in~cond; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {89625#(<= ~counter~0 0)} assume !(0 == ~cond); {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {89625#(<= ~counter~0 0)} assume true; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89625#(<= ~counter~0 0)} {89625#(<= ~counter~0 0)} #92#return; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {89625#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {89625#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:06,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {89625#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {89674#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,281 INFO L272 TraceCheckUtils]: 19: Hoare triple {89674#(<= ~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)); {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {89674#(<= ~counter~0 1)} ~cond := #in~cond; {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {89674#(<= ~counter~0 1)} assume !(0 == ~cond); {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {89674#(<= ~counter~0 1)} assume true; {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,282 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89674#(<= ~counter~0 1)} {89674#(<= ~counter~0 1)} #94#return; {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {89674#(<= ~counter~0 1)} assume !!(0 != ~r~0); {89674#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:06,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {89674#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {89699#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,284 INFO L272 TraceCheckUtils]: 27: Hoare triple {89699#(<= ~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)); {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {89699#(<= ~counter~0 2)} ~cond := #in~cond; {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {89699#(<= ~counter~0 2)} assume !(0 == ~cond); {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {89699#(<= ~counter~0 2)} assume true; {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,285 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89699#(<= ~counter~0 2)} {89699#(<= ~counter~0 2)} #96#return; {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {89699#(<= ~counter~0 2)} assume !(~r~0 > 0); {89699#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:06,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {89699#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {89724#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,287 INFO L272 TraceCheckUtils]: 35: Hoare triple {89724#(<= ~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)); {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {89724#(<= ~counter~0 3)} ~cond := #in~cond; {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {89724#(<= ~counter~0 3)} assume !(0 == ~cond); {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {89724#(<= ~counter~0 3)} assume true; {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,288 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89724#(<= ~counter~0 3)} {89724#(<= ~counter~0 3)} #98#return; {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {89724#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89724#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:06,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {89724#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,289 INFO L290 TraceCheckUtils]: 42: Hoare triple {89749#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,289 INFO L272 TraceCheckUtils]: 43: Hoare triple {89749#(<= ~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)); {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {89749#(<= ~counter~0 4)} ~cond := #in~cond; {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {89749#(<= ~counter~0 4)} assume !(0 == ~cond); {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {89749#(<= ~counter~0 4)} assume true; {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,290 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89749#(<= ~counter~0 4)} {89749#(<= ~counter~0 4)} #98#return; {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {89749#(<= ~counter~0 4)} assume !(~r~0 < 0); {89749#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:06,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {89749#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {89774#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,292 INFO L272 TraceCheckUtils]: 51: Hoare triple {89774#(<= ~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)); {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {89774#(<= ~counter~0 5)} ~cond := #in~cond; {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {89774#(<= ~counter~0 5)} assume !(0 == ~cond); {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {89774#(<= ~counter~0 5)} assume true; {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,293 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89774#(<= ~counter~0 5)} {89774#(<= ~counter~0 5)} #94#return; {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,293 INFO L290 TraceCheckUtils]: 56: Hoare triple {89774#(<= ~counter~0 5)} assume !!(0 != ~r~0); {89774#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:06,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {89774#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {89799#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,295 INFO L272 TraceCheckUtils]: 59: Hoare triple {89799#(<= ~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)); {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {89799#(<= ~counter~0 6)} ~cond := #in~cond; {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {89799#(<= ~counter~0 6)} assume !(0 == ~cond); {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {89799#(<= ~counter~0 6)} assume true; {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,296 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89799#(<= ~counter~0 6)} {89799#(<= ~counter~0 6)} #96#return; {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {89799#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89799#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:06,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {89799#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,297 INFO L290 TraceCheckUtils]: 66: Hoare triple {89824#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,297 INFO L272 TraceCheckUtils]: 67: Hoare triple {89824#(<= ~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)); {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {89824#(<= ~counter~0 7)} ~cond := #in~cond; {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,298 INFO L290 TraceCheckUtils]: 69: Hoare triple {89824#(<= ~counter~0 7)} assume !(0 == ~cond); {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,298 INFO L290 TraceCheckUtils]: 70: Hoare triple {89824#(<= ~counter~0 7)} assume true; {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,299 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89824#(<= ~counter~0 7)} {89824#(<= ~counter~0 7)} #96#return; {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {89824#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89824#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:06,299 INFO L290 TraceCheckUtils]: 73: Hoare triple {89824#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {89849#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,312 INFO L272 TraceCheckUtils]: 75: Hoare triple {89849#(<= ~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)); {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {89849#(<= ~counter~0 8)} ~cond := #in~cond; {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,312 INFO L290 TraceCheckUtils]: 77: Hoare triple {89849#(<= ~counter~0 8)} assume !(0 == ~cond); {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,312 INFO L290 TraceCheckUtils]: 78: Hoare triple {89849#(<= ~counter~0 8)} assume true; {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,313 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89849#(<= ~counter~0 8)} {89849#(<= ~counter~0 8)} #96#return; {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {89849#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89849#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:06,314 INFO L290 TraceCheckUtils]: 81: Hoare triple {89849#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,314 INFO L290 TraceCheckUtils]: 82: Hoare triple {89874#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,315 INFO L272 TraceCheckUtils]: 83: Hoare triple {89874#(<= ~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)); {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {89874#(<= ~counter~0 9)} ~cond := #in~cond; {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,315 INFO L290 TraceCheckUtils]: 85: Hoare triple {89874#(<= ~counter~0 9)} assume !(0 == ~cond); {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,315 INFO L290 TraceCheckUtils]: 86: Hoare triple {89874#(<= ~counter~0 9)} assume true; {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,316 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89874#(<= ~counter~0 9)} {89874#(<= ~counter~0 9)} #96#return; {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {89874#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89874#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:06,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {89874#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {89899#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,317 INFO L272 TraceCheckUtils]: 91: Hoare triple {89899#(<= ~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)); {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,318 INFO L290 TraceCheckUtils]: 92: Hoare triple {89899#(<= ~counter~0 10)} ~cond := #in~cond; {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,318 INFO L290 TraceCheckUtils]: 93: Hoare triple {89899#(<= ~counter~0 10)} assume !(0 == ~cond); {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,318 INFO L290 TraceCheckUtils]: 94: Hoare triple {89899#(<= ~counter~0 10)} assume true; {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,318 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89899#(<= ~counter~0 10)} {89899#(<= ~counter~0 10)} #96#return; {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {89899#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {89899#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:06,319 INFO L290 TraceCheckUtils]: 97: Hoare triple {89899#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,320 INFO L290 TraceCheckUtils]: 98: Hoare triple {89924#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,320 INFO L272 TraceCheckUtils]: 99: Hoare triple {89924#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,320 INFO L290 TraceCheckUtils]: 100: Hoare triple {89924#(<= ~counter~0 11)} ~cond := #in~cond; {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,321 INFO L290 TraceCheckUtils]: 101: Hoare triple {89924#(<= ~counter~0 11)} assume !(0 == ~cond); {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {89924#(<= ~counter~0 11)} assume true; {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,321 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89924#(<= ~counter~0 11)} {89924#(<= ~counter~0 11)} #96#return; {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {89924#(<= ~counter~0 11)} assume !(~r~0 > 0); {89924#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:06,322 INFO L290 TraceCheckUtils]: 105: Hoare triple {89924#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {89949#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,323 INFO L272 TraceCheckUtils]: 107: Hoare triple {89949#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,323 INFO L290 TraceCheckUtils]: 108: Hoare triple {89949#(<= ~counter~0 12)} ~cond := #in~cond; {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,323 INFO L290 TraceCheckUtils]: 109: Hoare triple {89949#(<= ~counter~0 12)} assume !(0 == ~cond); {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,324 INFO L290 TraceCheckUtils]: 110: Hoare triple {89949#(<= ~counter~0 12)} assume true; {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,324 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89949#(<= ~counter~0 12)} {89949#(<= ~counter~0 12)} #98#return; {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,324 INFO L290 TraceCheckUtils]: 112: Hoare triple {89949#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {89949#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:06,324 INFO L290 TraceCheckUtils]: 113: Hoare triple {89949#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {89974#(<= |main_#t~post8| 12)} is VALID [2022-04-15 09:08:06,325 INFO L290 TraceCheckUtils]: 114: Hoare triple {89974#(<= |main_#t~post8| 12)} assume !(#t~post8 < 50);havoc #t~post8; {89618#false} is VALID [2022-04-15 09:08:06,325 INFO L290 TraceCheckUtils]: 115: Hoare triple {89618#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89618#false} is VALID [2022-04-15 09:08:06,325 INFO L290 TraceCheckUtils]: 116: Hoare triple {89618#false} assume !(#t~post6 < 50);havoc #t~post6; {89618#false} is VALID [2022-04-15 09:08:06,325 INFO L272 TraceCheckUtils]: 117: Hoare triple {89618#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)); {89618#false} is VALID [2022-04-15 09:08:06,325 INFO L290 TraceCheckUtils]: 118: Hoare triple {89618#false} ~cond := #in~cond; {89618#false} is VALID [2022-04-15 09:08:06,325 INFO L290 TraceCheckUtils]: 119: Hoare triple {89618#false} assume 0 == ~cond; {89618#false} is VALID [2022-04-15 09:08:06,325 INFO L290 TraceCheckUtils]: 120: Hoare triple {89618#false} assume !false; {89618#false} is VALID [2022-04-15 09:08:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:08:06,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:08:06,866 INFO L290 TraceCheckUtils]: 120: Hoare triple {89618#false} assume !false; {89618#false} is VALID [2022-04-15 09:08:06,866 INFO L290 TraceCheckUtils]: 119: Hoare triple {89618#false} assume 0 == ~cond; {89618#false} is VALID [2022-04-15 09:08:06,866 INFO L290 TraceCheckUtils]: 118: Hoare triple {89618#false} ~cond := #in~cond; {89618#false} is VALID [2022-04-15 09:08:06,866 INFO L272 TraceCheckUtils]: 117: Hoare triple {89618#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)); {89618#false} is VALID [2022-04-15 09:08:06,866 INFO L290 TraceCheckUtils]: 116: Hoare triple {89618#false} assume !(#t~post6 < 50);havoc #t~post6; {89618#false} is VALID [2022-04-15 09:08:06,866 INFO L290 TraceCheckUtils]: 115: Hoare triple {89618#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {89618#false} is VALID [2022-04-15 09:08:06,866 INFO L290 TraceCheckUtils]: 114: Hoare triple {90014#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {89618#false} is VALID [2022-04-15 09:08:06,867 INFO L290 TraceCheckUtils]: 113: Hoare triple {90018#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90014#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:08:06,867 INFO L290 TraceCheckUtils]: 112: Hoare triple {90018#(< ~counter~0 50)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90018#(< ~counter~0 50)} is VALID [2022-04-15 09:08:06,868 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {89617#true} {90018#(< ~counter~0 50)} #98#return; {90018#(< ~counter~0 50)} is VALID [2022-04-15 09:08:06,868 INFO L290 TraceCheckUtils]: 110: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,868 INFO L290 TraceCheckUtils]: 109: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,868 INFO L290 TraceCheckUtils]: 108: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,868 INFO L272 TraceCheckUtils]: 107: Hoare triple {90018#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,868 INFO L290 TraceCheckUtils]: 106: Hoare triple {90018#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {90018#(< ~counter~0 50)} is VALID [2022-04-15 09:08:06,870 INFO L290 TraceCheckUtils]: 105: Hoare triple {90043#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90018#(< ~counter~0 50)} is VALID [2022-04-15 09:08:06,870 INFO L290 TraceCheckUtils]: 104: Hoare triple {90043#(< ~counter~0 49)} assume !(~r~0 > 0); {90043#(< ~counter~0 49)} is VALID [2022-04-15 09:08:06,871 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {89617#true} {90043#(< ~counter~0 49)} #96#return; {90043#(< ~counter~0 49)} is VALID [2022-04-15 09:08:06,871 INFO L290 TraceCheckUtils]: 102: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,871 INFO L290 TraceCheckUtils]: 101: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,871 INFO L290 TraceCheckUtils]: 100: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,871 INFO L272 TraceCheckUtils]: 99: Hoare triple {90043#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,871 INFO L290 TraceCheckUtils]: 98: Hoare triple {90043#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {90043#(< ~counter~0 49)} is VALID [2022-04-15 09:08:06,872 INFO L290 TraceCheckUtils]: 97: Hoare triple {90068#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90043#(< ~counter~0 49)} is VALID [2022-04-15 09:08:06,872 INFO L290 TraceCheckUtils]: 96: Hoare triple {90068#(< ~counter~0 48)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90068#(< ~counter~0 48)} is VALID [2022-04-15 09:08:06,873 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {89617#true} {90068#(< ~counter~0 48)} #96#return; {90068#(< ~counter~0 48)} is VALID [2022-04-15 09:08:06,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,873 INFO L290 TraceCheckUtils]: 92: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,873 INFO L272 TraceCheckUtils]: 91: Hoare triple {90068#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {90068#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {90068#(< ~counter~0 48)} is VALID [2022-04-15 09:08:06,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {90093#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90068#(< ~counter~0 48)} is VALID [2022-04-15 09:08:06,874 INFO L290 TraceCheckUtils]: 88: Hoare triple {90093#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90093#(< ~counter~0 47)} is VALID [2022-04-15 09:08:06,875 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {89617#true} {90093#(< ~counter~0 47)} #96#return; {90093#(< ~counter~0 47)} is VALID [2022-04-15 09:08:06,875 INFO L290 TraceCheckUtils]: 86: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,875 INFO L290 TraceCheckUtils]: 85: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,875 INFO L290 TraceCheckUtils]: 84: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,875 INFO L272 TraceCheckUtils]: 83: Hoare triple {90093#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,875 INFO L290 TraceCheckUtils]: 82: Hoare triple {90093#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {90093#(< ~counter~0 47)} is VALID [2022-04-15 09:08:06,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {90118#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90093#(< ~counter~0 47)} is VALID [2022-04-15 09:08:06,876 INFO L290 TraceCheckUtils]: 80: Hoare triple {90118#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90118#(< ~counter~0 46)} is VALID [2022-04-15 09:08:06,877 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {89617#true} {90118#(< ~counter~0 46)} #96#return; {90118#(< ~counter~0 46)} is VALID [2022-04-15 09:08:06,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,877 INFO L272 TraceCheckUtils]: 75: Hoare triple {90118#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {90118#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {90118#(< ~counter~0 46)} is VALID [2022-04-15 09:08:06,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {90143#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90118#(< ~counter~0 46)} is VALID [2022-04-15 09:08:06,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {90143#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90143#(< ~counter~0 45)} is VALID [2022-04-15 09:08:06,879 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {89617#true} {90143#(< ~counter~0 45)} #96#return; {90143#(< ~counter~0 45)} is VALID [2022-04-15 09:08:06,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,879 INFO L272 TraceCheckUtils]: 67: Hoare triple {90143#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {90143#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {90143#(< ~counter~0 45)} is VALID [2022-04-15 09:08:06,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {90168#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90143#(< ~counter~0 45)} is VALID [2022-04-15 09:08:06,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {90168#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90168#(< ~counter~0 44)} is VALID [2022-04-15 09:08:06,881 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {89617#true} {90168#(< ~counter~0 44)} #96#return; {90168#(< ~counter~0 44)} is VALID [2022-04-15 09:08:06,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,881 INFO L290 TraceCheckUtils]: 61: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,881 INFO L290 TraceCheckUtils]: 60: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,881 INFO L272 TraceCheckUtils]: 59: Hoare triple {90168#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {90168#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {90168#(< ~counter~0 44)} is VALID [2022-04-15 09:08:06,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {90193#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90168#(< ~counter~0 44)} is VALID [2022-04-15 09:08:06,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {90193#(< ~counter~0 43)} assume !!(0 != ~r~0); {90193#(< ~counter~0 43)} is VALID [2022-04-15 09:08:06,883 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {89617#true} {90193#(< ~counter~0 43)} #94#return; {90193#(< ~counter~0 43)} is VALID [2022-04-15 09:08:06,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,883 INFO L272 TraceCheckUtils]: 51: Hoare triple {90193#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {90193#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {90193#(< ~counter~0 43)} is VALID [2022-04-15 09:08:06,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {90218#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90193#(< ~counter~0 43)} is VALID [2022-04-15 09:08:06,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {90218#(< ~counter~0 42)} assume !(~r~0 < 0); {90218#(< ~counter~0 42)} is VALID [2022-04-15 09:08:06,885 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {89617#true} {90218#(< ~counter~0 42)} #98#return; {90218#(< ~counter~0 42)} is VALID [2022-04-15 09:08:06,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,886 INFO L272 TraceCheckUtils]: 43: Hoare triple {90218#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {90218#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {90218#(< ~counter~0 42)} is VALID [2022-04-15 09:08:06,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {90243#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90218#(< ~counter~0 42)} is VALID [2022-04-15 09:08:06,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {90243#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90243#(< ~counter~0 41)} is VALID [2022-04-15 09:08:06,887 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {89617#true} {90243#(< ~counter~0 41)} #98#return; {90243#(< ~counter~0 41)} is VALID [2022-04-15 09:08:06,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,888 INFO L272 TraceCheckUtils]: 35: Hoare triple {90243#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {90243#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {90243#(< ~counter~0 41)} is VALID [2022-04-15 09:08:06,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {90268#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90243#(< ~counter~0 41)} is VALID [2022-04-15 09:08:06,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {90268#(< ~counter~0 40)} assume !(~r~0 > 0); {90268#(< ~counter~0 40)} is VALID [2022-04-15 09:08:06,889 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {89617#true} {90268#(< ~counter~0 40)} #96#return; {90268#(< ~counter~0 40)} is VALID [2022-04-15 09:08:06,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,890 INFO L272 TraceCheckUtils]: 27: Hoare triple {90268#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {90268#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {90268#(< ~counter~0 40)} is VALID [2022-04-15 09:08:06,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {90293#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90268#(< ~counter~0 40)} is VALID [2022-04-15 09:08:06,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {90293#(< ~counter~0 39)} assume !!(0 != ~r~0); {90293#(< ~counter~0 39)} is VALID [2022-04-15 09:08:06,891 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {89617#true} {90293#(< ~counter~0 39)} #94#return; {90293#(< ~counter~0 39)} is VALID [2022-04-15 09:08:06,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,892 INFO L272 TraceCheckUtils]: 19: Hoare triple {90293#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {90293#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {90293#(< ~counter~0 39)} is VALID [2022-04-15 09:08:06,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {90318#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90293#(< ~counter~0 39)} is VALID [2022-04-15 09:08:06,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {90318#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,893 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {89617#true} {90318#(< ~counter~0 38)} #92#return; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {90318#(< ~counter~0 38)} 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)); {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89617#true} {90318#(< ~counter~0 38)} #90#return; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {89617#true} assume true; {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {89617#true} assume !(0 == ~cond); {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {89617#true} ~cond := #in~cond; {89617#true} is VALID [2022-04-15 09:08:06,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {90318#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {89617#true} is VALID [2022-04-15 09:08:06,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {90318#(< ~counter~0 38)} 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; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {90318#(< ~counter~0 38)} call #t~ret9 := main(); {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90318#(< ~counter~0 38)} {89617#true} #102#return; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {90318#(< ~counter~0 38)} assume true; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {89617#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; {90318#(< ~counter~0 38)} is VALID [2022-04-15 09:08:06,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {89617#true} call ULTIMATE.init(); {89617#true} is VALID [2022-04-15 09:08:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 09:08:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:08:06,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036328821] [2022-04-15 09:08:06,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:08:06,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327033213] [2022-04-15 09:08:06,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327033213] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:08:06,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:08:06,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 09:08:06,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:08:06,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1056842187] [2022-04-15 09:08:06,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1056842187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:08:06,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:08:06,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 09:08:06,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091112518] [2022-04-15 09:08:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:08:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-15 09:08:06,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:08:06,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:06,982 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-15 09:08:06,983 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 09:08:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:08:06,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 09:08:06,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 09:08:06,983 INFO L87 Difference]: Start difference. First operand 660 states and 874 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:10,029 INFO L93 Difference]: Finished difference Result 885 states and 1210 transitions. [2022-04-15 09:08:10,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 09:08:10,029 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 121 [2022-04-15 09:08:10,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:08:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 09:08:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 09:08:10,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-15 09:08:10,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:10,291 INFO L225 Difference]: With dead ends: 885 [2022-04-15 09:08:10,292 INFO L226 Difference]: Without dead ends: 688 [2022-04-15 09:08:10,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=653, Invalid=907, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 09:08:10,293 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 169 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:08:10,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 290 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:08:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-04-15 09:08:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 678. [2022-04-15 09:08:12,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:08:12,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 688 states. Second operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:12,530 INFO L74 IsIncluded]: Start isIncluded. First operand 688 states. Second operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:12,530 INFO L87 Difference]: Start difference. First operand 688 states. Second operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:12,546 INFO L93 Difference]: Finished difference Result 688 states and 906 transitions. [2022-04-15 09:08:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 906 transitions. [2022-04-15 09:08:12,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:08:12,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:08:12,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 688 states. [2022-04-15 09:08:12,547 INFO L87 Difference]: Start difference. First operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 688 states. [2022-04-15 09:08:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:12,563 INFO L93 Difference]: Finished difference Result 688 states and 906 transitions. [2022-04-15 09:08:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 906 transitions. [2022-04-15 09:08:12,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:08:12,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:08:12,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:08:12,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:08:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 511 states have (on average 1.2093933463796478) internal successors, (618), 515 states have internal predecessors, (618), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 896 transitions. [2022-04-15 09:08:12,584 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 896 transitions. Word has length 121 [2022-04-15 09:08:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:08:12,584 INFO L478 AbstractCegarLoop]: Abstraction has 678 states and 896 transitions. [2022-04-15 09:08:12,584 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:12,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 678 states and 896 transitions. [2022-04-15 09:08:30,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 896 edges. 893 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 896 transitions. [2022-04-15 09:08:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 09:08:30,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:08:30,519 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-15 09:08:30,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-15 09:08:30,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 09:08:30,719 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:08:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:08:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-15 09:08:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:08:30,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371062676] [2022-04-15 09:08:30,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:08:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-15 09:08:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:08:30,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398015498] [2022-04-15 09:08:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:08:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:08:30,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:08:30,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201650633] [2022-04-15 09:08:30,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:08:30,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:08:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:08:30,750 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:08:30,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 09:08:30,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:08:30,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:08:30,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 09:08:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:08:30,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:08:31,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {94894#true} call ULTIMATE.init(); {94894#true} is VALID [2022-04-15 09:08:31,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {94894#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; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {94902#(<= ~counter~0 0)} assume true; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94902#(<= ~counter~0 0)} {94894#true} #102#return; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {94902#(<= ~counter~0 0)} call #t~ret9 := main(); {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {94902#(<= ~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; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {94902#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {94902#(<= ~counter~0 0)} ~cond := #in~cond; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {94902#(<= ~counter~0 0)} assume !(0 == ~cond); {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {94902#(<= ~counter~0 0)} assume true; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94902#(<= ~counter~0 0)} {94902#(<= ~counter~0 0)} #90#return; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,388 INFO L272 TraceCheckUtils]: 11: Hoare triple {94902#(<= ~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)); {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {94902#(<= ~counter~0 0)} ~cond := #in~cond; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {94902#(<= ~counter~0 0)} assume !(0 == ~cond); {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {94902#(<= ~counter~0 0)} assume true; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,389 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94902#(<= ~counter~0 0)} {94902#(<= ~counter~0 0)} #92#return; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {94902#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {94902#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:31,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {94902#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {94951#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,392 INFO L272 TraceCheckUtils]: 19: Hoare triple {94951#(<= ~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)); {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {94951#(<= ~counter~0 1)} ~cond := #in~cond; {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {94951#(<= ~counter~0 1)} assume !(0 == ~cond); {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {94951#(<= ~counter~0 1)} assume true; {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,393 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94951#(<= ~counter~0 1)} {94951#(<= ~counter~0 1)} #94#return; {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {94951#(<= ~counter~0 1)} assume !!(0 != ~r~0); {94951#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:31,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {94951#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {94976#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,395 INFO L272 TraceCheckUtils]: 27: Hoare triple {94976#(<= ~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)); {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {94976#(<= ~counter~0 2)} ~cond := #in~cond; {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {94976#(<= ~counter~0 2)} assume !(0 == ~cond); {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {94976#(<= ~counter~0 2)} assume true; {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,396 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94976#(<= ~counter~0 2)} {94976#(<= ~counter~0 2)} #96#return; {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {94976#(<= ~counter~0 2)} assume !(~r~0 > 0); {94976#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:31,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {94976#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {95001#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,397 INFO L272 TraceCheckUtils]: 35: Hoare triple {95001#(<= ~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)); {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {95001#(<= ~counter~0 3)} ~cond := #in~cond; {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {95001#(<= ~counter~0 3)} assume !(0 == ~cond); {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {95001#(<= ~counter~0 3)} assume true; {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,399 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {95001#(<= ~counter~0 3)} {95001#(<= ~counter~0 3)} #98#return; {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {95001#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95001#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:31,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {95001#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {95026#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {95026#(<= ~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)); {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {95026#(<= ~counter~0 4)} ~cond := #in~cond; {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {95026#(<= ~counter~0 4)} assume !(0 == ~cond); {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {95026#(<= ~counter~0 4)} assume true; {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,401 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {95026#(<= ~counter~0 4)} {95026#(<= ~counter~0 4)} #98#return; {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {95026#(<= ~counter~0 4)} assume !(~r~0 < 0); {95026#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:31,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {95026#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {95051#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,403 INFO L272 TraceCheckUtils]: 51: Hoare triple {95051#(<= ~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)); {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {95051#(<= ~counter~0 5)} ~cond := #in~cond; {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {95051#(<= ~counter~0 5)} assume !(0 == ~cond); {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {95051#(<= ~counter~0 5)} assume true; {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,404 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {95051#(<= ~counter~0 5)} {95051#(<= ~counter~0 5)} #94#return; {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {95051#(<= ~counter~0 5)} assume !!(0 != ~r~0); {95051#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:31,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {95051#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {95076#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,406 INFO L272 TraceCheckUtils]: 59: Hoare triple {95076#(<= ~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)); {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {95076#(<= ~counter~0 6)} ~cond := #in~cond; {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,407 INFO L290 TraceCheckUtils]: 61: Hoare triple {95076#(<= ~counter~0 6)} assume !(0 == ~cond); {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {95076#(<= ~counter~0 6)} assume true; {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,407 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {95076#(<= ~counter~0 6)} {95076#(<= ~counter~0 6)} #96#return; {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {95076#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95076#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:31,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {95076#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {95101#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,409 INFO L272 TraceCheckUtils]: 67: Hoare triple {95101#(<= ~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)); {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,409 INFO L290 TraceCheckUtils]: 68: Hoare triple {95101#(<= ~counter~0 7)} ~cond := #in~cond; {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {95101#(<= ~counter~0 7)} assume !(0 == ~cond); {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,410 INFO L290 TraceCheckUtils]: 70: Hoare triple {95101#(<= ~counter~0 7)} assume true; {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,410 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {95101#(<= ~counter~0 7)} {95101#(<= ~counter~0 7)} #96#return; {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {95101#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95101#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:31,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {95101#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {95126#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,412 INFO L272 TraceCheckUtils]: 75: Hoare triple {95126#(<= ~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)); {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,412 INFO L290 TraceCheckUtils]: 76: Hoare triple {95126#(<= ~counter~0 8)} ~cond := #in~cond; {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,412 INFO L290 TraceCheckUtils]: 77: Hoare triple {95126#(<= ~counter~0 8)} assume !(0 == ~cond); {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,412 INFO L290 TraceCheckUtils]: 78: Hoare triple {95126#(<= ~counter~0 8)} assume true; {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,413 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {95126#(<= ~counter~0 8)} {95126#(<= ~counter~0 8)} #96#return; {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,413 INFO L290 TraceCheckUtils]: 80: Hoare triple {95126#(<= ~counter~0 8)} assume !(~r~0 > 0); {95126#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:31,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {95126#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {95151#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,415 INFO L272 TraceCheckUtils]: 83: Hoare triple {95151#(<= ~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)); {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,415 INFO L290 TraceCheckUtils]: 84: Hoare triple {95151#(<= ~counter~0 9)} ~cond := #in~cond; {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {95151#(<= ~counter~0 9)} assume !(0 == ~cond); {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {95151#(<= ~counter~0 9)} assume true; {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,416 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {95151#(<= ~counter~0 9)} {95151#(<= ~counter~0 9)} #98#return; {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,416 INFO L290 TraceCheckUtils]: 88: Hoare triple {95151#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95151#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:31,417 INFO L290 TraceCheckUtils]: 89: Hoare triple {95151#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,417 INFO L290 TraceCheckUtils]: 90: Hoare triple {95176#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,417 INFO L272 TraceCheckUtils]: 91: Hoare triple {95176#(<= ~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)); {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,418 INFO L290 TraceCheckUtils]: 92: Hoare triple {95176#(<= ~counter~0 10)} ~cond := #in~cond; {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,418 INFO L290 TraceCheckUtils]: 93: Hoare triple {95176#(<= ~counter~0 10)} assume !(0 == ~cond); {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,418 INFO L290 TraceCheckUtils]: 94: Hoare triple {95176#(<= ~counter~0 10)} assume true; {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,419 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {95176#(<= ~counter~0 10)} {95176#(<= ~counter~0 10)} #98#return; {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,419 INFO L290 TraceCheckUtils]: 96: Hoare triple {95176#(<= ~counter~0 10)} assume !(~r~0 < 0); {95176#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:31,420 INFO L290 TraceCheckUtils]: 97: Hoare triple {95176#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {95201#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,420 INFO L272 TraceCheckUtils]: 99: Hoare triple {95201#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,420 INFO L290 TraceCheckUtils]: 100: Hoare triple {95201#(<= ~counter~0 11)} ~cond := #in~cond; {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,421 INFO L290 TraceCheckUtils]: 101: Hoare triple {95201#(<= ~counter~0 11)} assume !(0 == ~cond); {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,421 INFO L290 TraceCheckUtils]: 102: Hoare triple {95201#(<= ~counter~0 11)} assume true; {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,421 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {95201#(<= ~counter~0 11)} {95201#(<= ~counter~0 11)} #94#return; {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,422 INFO L290 TraceCheckUtils]: 104: Hoare triple {95201#(<= ~counter~0 11)} assume !!(0 != ~r~0); {95201#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:31,422 INFO L290 TraceCheckUtils]: 105: Hoare triple {95201#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,423 INFO L290 TraceCheckUtils]: 106: Hoare triple {95226#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,423 INFO L272 TraceCheckUtils]: 107: Hoare triple {95226#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,423 INFO L290 TraceCheckUtils]: 108: Hoare triple {95226#(<= ~counter~0 12)} ~cond := #in~cond; {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,424 INFO L290 TraceCheckUtils]: 109: Hoare triple {95226#(<= ~counter~0 12)} assume !(0 == ~cond); {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,424 INFO L290 TraceCheckUtils]: 110: Hoare triple {95226#(<= ~counter~0 12)} assume true; {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,424 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {95226#(<= ~counter~0 12)} {95226#(<= ~counter~0 12)} #96#return; {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,424 INFO L290 TraceCheckUtils]: 112: Hoare triple {95226#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95226#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 113: Hoare triple {95226#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95251#(<= |main_#t~post7| 12)} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 114: Hoare triple {95251#(<= |main_#t~post7| 12)} assume !(#t~post7 < 50);havoc #t~post7; {94895#false} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 115: Hoare triple {94895#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94895#false} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 116: Hoare triple {94895#false} assume !(#t~post8 < 50);havoc #t~post8; {94895#false} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 117: Hoare triple {94895#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94895#false} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 118: Hoare triple {94895#false} assume !(#t~post6 < 50);havoc #t~post6; {94895#false} is VALID [2022-04-15 09:08:31,425 INFO L272 TraceCheckUtils]: 119: Hoare triple {94895#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)); {94895#false} is VALID [2022-04-15 09:08:31,425 INFO L290 TraceCheckUtils]: 120: Hoare triple {94895#false} ~cond := #in~cond; {94895#false} is VALID [2022-04-15 09:08:31,426 INFO L290 TraceCheckUtils]: 121: Hoare triple {94895#false} assume 0 == ~cond; {94895#false} is VALID [2022-04-15 09:08:31,426 INFO L290 TraceCheckUtils]: 122: Hoare triple {94895#false} assume !false; {94895#false} is VALID [2022-04-15 09:08:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:08:31,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 122: Hoare triple {94895#false} assume !false; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 121: Hoare triple {94895#false} assume 0 == ~cond; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 120: Hoare triple {94895#false} ~cond := #in~cond; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L272 TraceCheckUtils]: 119: Hoare triple {94895#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)); {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 118: Hoare triple {94895#false} assume !(#t~post6 < 50);havoc #t~post6; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 117: Hoare triple {94895#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 116: Hoare triple {94895#false} assume !(#t~post8 < 50);havoc #t~post8; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 115: Hoare triple {94895#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {94895#false} is VALID [2022-04-15 09:08:31,839 INFO L290 TraceCheckUtils]: 114: Hoare triple {95303#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {94895#false} is VALID [2022-04-15 09:08:31,840 INFO L290 TraceCheckUtils]: 113: Hoare triple {95307#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95303#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:08:31,840 INFO L290 TraceCheckUtils]: 112: Hoare triple {95307#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95307#(< ~counter~0 50)} is VALID [2022-04-15 09:08:31,840 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {94894#true} {95307#(< ~counter~0 50)} #96#return; {95307#(< ~counter~0 50)} is VALID [2022-04-15 09:08:31,840 INFO L290 TraceCheckUtils]: 110: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,840 INFO L290 TraceCheckUtils]: 109: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,840 INFO L290 TraceCheckUtils]: 108: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,840 INFO L272 TraceCheckUtils]: 107: Hoare triple {95307#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,841 INFO L290 TraceCheckUtils]: 106: Hoare triple {95307#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {95307#(< ~counter~0 50)} is VALID [2022-04-15 09:08:31,842 INFO L290 TraceCheckUtils]: 105: Hoare triple {95332#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95307#(< ~counter~0 50)} is VALID [2022-04-15 09:08:31,843 INFO L290 TraceCheckUtils]: 104: Hoare triple {95332#(< ~counter~0 49)} assume !!(0 != ~r~0); {95332#(< ~counter~0 49)} is VALID [2022-04-15 09:08:31,843 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {94894#true} {95332#(< ~counter~0 49)} #94#return; {95332#(< ~counter~0 49)} is VALID [2022-04-15 09:08:31,843 INFO L290 TraceCheckUtils]: 102: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,843 INFO L290 TraceCheckUtils]: 101: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,843 INFO L290 TraceCheckUtils]: 100: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,843 INFO L272 TraceCheckUtils]: 99: Hoare triple {95332#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {95332#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {95332#(< ~counter~0 49)} is VALID [2022-04-15 09:08:31,844 INFO L290 TraceCheckUtils]: 97: Hoare triple {95357#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95332#(< ~counter~0 49)} is VALID [2022-04-15 09:08:31,844 INFO L290 TraceCheckUtils]: 96: Hoare triple {95357#(< ~counter~0 48)} assume !(~r~0 < 0); {95357#(< ~counter~0 48)} is VALID [2022-04-15 09:08:31,845 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {94894#true} {95357#(< ~counter~0 48)} #98#return; {95357#(< ~counter~0 48)} is VALID [2022-04-15 09:08:31,845 INFO L290 TraceCheckUtils]: 94: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,845 INFO L290 TraceCheckUtils]: 93: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,845 INFO L290 TraceCheckUtils]: 92: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,845 INFO L272 TraceCheckUtils]: 91: Hoare triple {95357#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,845 INFO L290 TraceCheckUtils]: 90: Hoare triple {95357#(< ~counter~0 48)} assume !!(#t~post8 < 50);havoc #t~post8; {95357#(< ~counter~0 48)} is VALID [2022-04-15 09:08:31,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {95382#(< ~counter~0 47)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95357#(< ~counter~0 48)} is VALID [2022-04-15 09:08:31,846 INFO L290 TraceCheckUtils]: 88: Hoare triple {95382#(< ~counter~0 47)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95382#(< ~counter~0 47)} is VALID [2022-04-15 09:08:31,846 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {94894#true} {95382#(< ~counter~0 47)} #98#return; {95382#(< ~counter~0 47)} is VALID [2022-04-15 09:08:31,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,846 INFO L290 TraceCheckUtils]: 85: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,846 INFO L290 TraceCheckUtils]: 84: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,847 INFO L272 TraceCheckUtils]: 83: Hoare triple {95382#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,847 INFO L290 TraceCheckUtils]: 82: Hoare triple {95382#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {95382#(< ~counter~0 47)} is VALID [2022-04-15 09:08:31,847 INFO L290 TraceCheckUtils]: 81: Hoare triple {95407#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95382#(< ~counter~0 47)} is VALID [2022-04-15 09:08:31,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {95407#(< ~counter~0 46)} assume !(~r~0 > 0); {95407#(< ~counter~0 46)} is VALID [2022-04-15 09:08:31,848 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {94894#true} {95407#(< ~counter~0 46)} #96#return; {95407#(< ~counter~0 46)} is VALID [2022-04-15 09:08:31,848 INFO L290 TraceCheckUtils]: 78: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,848 INFO L272 TraceCheckUtils]: 75: Hoare triple {95407#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {95407#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {95407#(< ~counter~0 46)} is VALID [2022-04-15 09:08:31,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {95432#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95407#(< ~counter~0 46)} is VALID [2022-04-15 09:08:31,849 INFO L290 TraceCheckUtils]: 72: Hoare triple {95432#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95432#(< ~counter~0 45)} is VALID [2022-04-15 09:08:31,850 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {94894#true} {95432#(< ~counter~0 45)} #96#return; {95432#(< ~counter~0 45)} is VALID [2022-04-15 09:08:31,850 INFO L290 TraceCheckUtils]: 70: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,850 INFO L290 TraceCheckUtils]: 69: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,850 INFO L290 TraceCheckUtils]: 68: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,850 INFO L272 TraceCheckUtils]: 67: Hoare triple {95432#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {95432#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {95432#(< ~counter~0 45)} is VALID [2022-04-15 09:08:31,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {95457#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95432#(< ~counter~0 45)} is VALID [2022-04-15 09:08:31,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {95457#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95457#(< ~counter~0 44)} is VALID [2022-04-15 09:08:31,851 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {94894#true} {95457#(< ~counter~0 44)} #96#return; {95457#(< ~counter~0 44)} is VALID [2022-04-15 09:08:31,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,851 INFO L272 TraceCheckUtils]: 59: Hoare triple {95457#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {95457#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {95457#(< ~counter~0 44)} is VALID [2022-04-15 09:08:31,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {95482#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95457#(< ~counter~0 44)} is VALID [2022-04-15 09:08:31,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {95482#(< ~counter~0 43)} assume !!(0 != ~r~0); {95482#(< ~counter~0 43)} is VALID [2022-04-15 09:08:31,853 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {94894#true} {95482#(< ~counter~0 43)} #94#return; {95482#(< ~counter~0 43)} is VALID [2022-04-15 09:08:31,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,853 INFO L272 TraceCheckUtils]: 51: Hoare triple {95482#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {95482#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {95482#(< ~counter~0 43)} is VALID [2022-04-15 09:08:31,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {95507#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95482#(< ~counter~0 43)} is VALID [2022-04-15 09:08:31,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {95507#(< ~counter~0 42)} assume !(~r~0 < 0); {95507#(< ~counter~0 42)} is VALID [2022-04-15 09:08:31,854 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {94894#true} {95507#(< ~counter~0 42)} #98#return; {95507#(< ~counter~0 42)} is VALID [2022-04-15 09:08:31,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,855 INFO L272 TraceCheckUtils]: 43: Hoare triple {95507#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {95507#(< ~counter~0 42)} assume !!(#t~post8 < 50);havoc #t~post8; {95507#(< ~counter~0 42)} is VALID [2022-04-15 09:08:31,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {95532#(< ~counter~0 41)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95507#(< ~counter~0 42)} is VALID [2022-04-15 09:08:31,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {95532#(< ~counter~0 41)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95532#(< ~counter~0 41)} is VALID [2022-04-15 09:08:31,856 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {94894#true} {95532#(< ~counter~0 41)} #98#return; {95532#(< ~counter~0 41)} is VALID [2022-04-15 09:08:31,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,856 INFO L272 TraceCheckUtils]: 35: Hoare triple {95532#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {95532#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {95532#(< ~counter~0 41)} is VALID [2022-04-15 09:08:31,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {95557#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95532#(< ~counter~0 41)} is VALID [2022-04-15 09:08:31,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {95557#(< ~counter~0 40)} assume !(~r~0 > 0); {95557#(< ~counter~0 40)} is VALID [2022-04-15 09:08:31,858 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {94894#true} {95557#(< ~counter~0 40)} #96#return; {95557#(< ~counter~0 40)} is VALID [2022-04-15 09:08:31,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,858 INFO L272 TraceCheckUtils]: 27: Hoare triple {95557#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {95557#(< ~counter~0 40)} assume !!(#t~post7 < 50);havoc #t~post7; {95557#(< ~counter~0 40)} is VALID [2022-04-15 09:08:31,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {95582#(< ~counter~0 39)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95557#(< ~counter~0 40)} is VALID [2022-04-15 09:08:31,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {95582#(< ~counter~0 39)} assume !!(0 != ~r~0); {95582#(< ~counter~0 39)} is VALID [2022-04-15 09:08:31,860 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {94894#true} {95582#(< ~counter~0 39)} #94#return; {95582#(< ~counter~0 39)} is VALID [2022-04-15 09:08:31,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,860 INFO L272 TraceCheckUtils]: 19: Hoare triple {95582#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {95582#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {95582#(< ~counter~0 39)} is VALID [2022-04-15 09:08:31,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {95607#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95582#(< ~counter~0 39)} is VALID [2022-04-15 09:08:31,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {95607#(< ~counter~0 38)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {94894#true} {95607#(< ~counter~0 38)} #92#return; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,861 INFO L272 TraceCheckUtils]: 11: Hoare triple {95607#(< ~counter~0 38)} 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)); {94894#true} is VALID [2022-04-15 09:08:31,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {94894#true} {95607#(< ~counter~0 38)} #90#return; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {94894#true} assume true; {94894#true} is VALID [2022-04-15 09:08:31,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {94894#true} assume !(0 == ~cond); {94894#true} is VALID [2022-04-15 09:08:31,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {94894#true} ~cond := #in~cond; {94894#true} is VALID [2022-04-15 09:08:31,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {95607#(< ~counter~0 38)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {94894#true} is VALID [2022-04-15 09:08:31,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {95607#(< ~counter~0 38)} 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; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {95607#(< ~counter~0 38)} call #t~ret9 := main(); {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95607#(< ~counter~0 38)} {94894#true} #102#return; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {95607#(< ~counter~0 38)} assume true; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {94894#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; {95607#(< ~counter~0 38)} is VALID [2022-04-15 09:08:31,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {94894#true} call ULTIMATE.init(); {94894#true} is VALID [2022-04-15 09:08:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 09:08:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:08:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398015498] [2022-04-15 09:08:31,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:08:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201650633] [2022-04-15 09:08:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201650633] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:08:31,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:08:31,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 09:08:31,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:08:31,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371062676] [2022-04-15 09:08:31,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371062676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:08:31,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:08:31,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 09:08:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221240288] [2022-04-15 09:08:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:08:31,865 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-15 09:08:31,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:08:31,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:31,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:31,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 09:08:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:08:31,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 09:08:31,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 09:08:31,931 INFO L87 Difference]: Start difference. First operand 678 states and 896 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:34,432 INFO L93 Difference]: Finished difference Result 895 states and 1223 transitions. [2022-04-15 09:08:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 09:08:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 123 [2022-04-15 09:08:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:08:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 09:08:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 09:08:34,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-15 09:08:34,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:34,702 INFO L225 Difference]: With dead ends: 895 [2022-04-15 09:08:34,703 INFO L226 Difference]: Without dead ends: 694 [2022-04-15 09:08:34,703 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=691, Invalid=949, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 09:08:34,704 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 186 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:08:34,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 300 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:08:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-04-15 09:08:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2022-04-15 09:08:37,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:08:37,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 694 states. Second operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:37,098 INFO L74 IsIncluded]: Start isIncluded. First operand 694 states. Second operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:37,099 INFO L87 Difference]: Start difference. First operand 694 states. Second operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:37,115 INFO L93 Difference]: Finished difference Result 694 states and 912 transitions. [2022-04-15 09:08:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 912 transitions. [2022-04-15 09:08:37,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:08:37,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:08:37,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 694 states. [2022-04-15 09:08:37,116 INFO L87 Difference]: Start difference. First operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 694 states. [2022-04-15 09:08:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:37,132 INFO L93 Difference]: Finished difference Result 694 states and 912 transitions. [2022-04-15 09:08:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 912 transitions. [2022-04-15 09:08:37,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:08:37,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:08:37,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:08:37,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:08:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 527 states have (on average 1.2030360531309299) internal successors, (634), 527 states have internal predecessors, (634), 140 states have call successors, (140), 28 states have call predecessors, (140), 26 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 09:08:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 912 transitions. [2022-04-15 09:08:37,162 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 912 transitions. Word has length 123 [2022-04-15 09:08:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:08:37,162 INFO L478 AbstractCegarLoop]: Abstraction has 694 states and 912 transitions. [2022-04-15 09:08:37,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 15 states have call successors, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-15 09:08:37,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 694 states and 912 transitions. [2022-04-15 09:08:50,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 912 edges. 910 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 912 transitions. [2022-04-15 09:08:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 09:08:50,960 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:08:50,960 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 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] [2022-04-15 09:08:50,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 09:08:51,161 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:08:51,161 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:08:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:08:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-15 09:08:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:08:51,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340834057] [2022-04-15 09:08:51,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:08:51,162 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-15 09:08:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:08:51,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777915546] [2022-04-15 09:08:51,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:08:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:08:51,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:08:51,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57339609] [2022-04-15 09:08:51,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:08:51,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:08:51,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:08:51,192 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:08:51,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 09:08:51,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:08:51,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:08:51,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 09:08:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:08:51,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:08:51,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {100249#true} call ULTIMATE.init(); {100249#true} is VALID [2022-04-15 09:08:51,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {100249#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; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {100257#(<= ~counter~0 0)} assume true; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100257#(<= ~counter~0 0)} {100249#true} #102#return; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {100257#(<= ~counter~0 0)} call #t~ret9 := main(); {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {100257#(<= ~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; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {100257#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {100257#(<= ~counter~0 0)} ~cond := #in~cond; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {100257#(<= ~counter~0 0)} assume !(0 == ~cond); {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {100257#(<= ~counter~0 0)} assume true; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {100257#(<= ~counter~0 0)} {100257#(<= ~counter~0 0)} #90#return; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {100257#(<= ~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)); {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {100257#(<= ~counter~0 0)} ~cond := #in~cond; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {100257#(<= ~counter~0 0)} assume !(0 == ~cond); {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {100257#(<= ~counter~0 0)} assume true; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {100257#(<= ~counter~0 0)} {100257#(<= ~counter~0 0)} #92#return; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {100257#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100257#(<= ~counter~0 0)} is VALID [2022-04-15 09:08:51,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {100257#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {100306#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,960 INFO L272 TraceCheckUtils]: 19: Hoare triple {100306#(<= ~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)); {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {100306#(<= ~counter~0 1)} ~cond := #in~cond; {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {100306#(<= ~counter~0 1)} assume !(0 == ~cond); {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {100306#(<= ~counter~0 1)} assume true; {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,961 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {100306#(<= ~counter~0 1)} {100306#(<= ~counter~0 1)} #94#return; {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {100306#(<= ~counter~0 1)} assume !!(0 != ~r~0); {100306#(<= ~counter~0 1)} is VALID [2022-04-15 09:08:51,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {100306#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {100331#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,963 INFO L272 TraceCheckUtils]: 27: Hoare triple {100331#(<= ~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)); {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {100331#(<= ~counter~0 2)} ~cond := #in~cond; {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {100331#(<= ~counter~0 2)} assume !(0 == ~cond); {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {100331#(<= ~counter~0 2)} assume true; {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,965 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {100331#(<= ~counter~0 2)} {100331#(<= ~counter~0 2)} #96#return; {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {100331#(<= ~counter~0 2)} assume !(~r~0 > 0); {100331#(<= ~counter~0 2)} is VALID [2022-04-15 09:08:51,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {100331#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {100356#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,967 INFO L272 TraceCheckUtils]: 35: Hoare triple {100356#(<= ~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)); {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {100356#(<= ~counter~0 3)} ~cond := #in~cond; {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {100356#(<= ~counter~0 3)} assume !(0 == ~cond); {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {100356#(<= ~counter~0 3)} assume true; {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,968 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {100356#(<= ~counter~0 3)} {100356#(<= ~counter~0 3)} #98#return; {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {100356#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100356#(<= ~counter~0 3)} is VALID [2022-04-15 09:08:51,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {100356#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {100381#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,970 INFO L272 TraceCheckUtils]: 43: Hoare triple {100381#(<= ~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)); {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {100381#(<= ~counter~0 4)} ~cond := #in~cond; {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {100381#(<= ~counter~0 4)} assume !(0 == ~cond); {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {100381#(<= ~counter~0 4)} assume true; {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,971 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100381#(<= ~counter~0 4)} {100381#(<= ~counter~0 4)} #98#return; {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {100381#(<= ~counter~0 4)} assume !(~r~0 < 0); {100381#(<= ~counter~0 4)} is VALID [2022-04-15 09:08:51,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {100381#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {100406#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,973 INFO L272 TraceCheckUtils]: 51: Hoare triple {100406#(<= ~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)); {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {100406#(<= ~counter~0 5)} ~cond := #in~cond; {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {100406#(<= ~counter~0 5)} assume !(0 == ~cond); {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {100406#(<= ~counter~0 5)} assume true; {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,974 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100406#(<= ~counter~0 5)} {100406#(<= ~counter~0 5)} #94#return; {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {100406#(<= ~counter~0 5)} assume !!(0 != ~r~0); {100406#(<= ~counter~0 5)} is VALID [2022-04-15 09:08:51,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {100406#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {100431#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,976 INFO L272 TraceCheckUtils]: 59: Hoare triple {100431#(<= ~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)); {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,977 INFO L290 TraceCheckUtils]: 60: Hoare triple {100431#(<= ~counter~0 6)} ~cond := #in~cond; {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {100431#(<= ~counter~0 6)} assume !(0 == ~cond); {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {100431#(<= ~counter~0 6)} assume true; {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,978 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100431#(<= ~counter~0 6)} {100431#(<= ~counter~0 6)} #96#return; {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,978 INFO L290 TraceCheckUtils]: 64: Hoare triple {100431#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100431#(<= ~counter~0 6)} is VALID [2022-04-15 09:08:51,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {100431#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {100456#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,980 INFO L272 TraceCheckUtils]: 67: Hoare triple {100456#(<= ~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)); {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,980 INFO L290 TraceCheckUtils]: 68: Hoare triple {100456#(<= ~counter~0 7)} ~cond := #in~cond; {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,980 INFO L290 TraceCheckUtils]: 69: Hoare triple {100456#(<= ~counter~0 7)} assume !(0 == ~cond); {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,980 INFO L290 TraceCheckUtils]: 70: Hoare triple {100456#(<= ~counter~0 7)} assume true; {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,981 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100456#(<= ~counter~0 7)} {100456#(<= ~counter~0 7)} #96#return; {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {100456#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100456#(<= ~counter~0 7)} is VALID [2022-04-15 09:08:51,982 INFO L290 TraceCheckUtils]: 73: Hoare triple {100456#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,982 INFO L290 TraceCheckUtils]: 74: Hoare triple {100481#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,983 INFO L272 TraceCheckUtils]: 75: Hoare triple {100481#(<= ~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)); {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {100481#(<= ~counter~0 8)} ~cond := #in~cond; {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {100481#(<= ~counter~0 8)} assume !(0 == ~cond); {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {100481#(<= ~counter~0 8)} assume true; {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,984 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100481#(<= ~counter~0 8)} {100481#(<= ~counter~0 8)} #96#return; {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,984 INFO L290 TraceCheckUtils]: 80: Hoare triple {100481#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100481#(<= ~counter~0 8)} is VALID [2022-04-15 09:08:51,985 INFO L290 TraceCheckUtils]: 81: Hoare triple {100481#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,986 INFO L290 TraceCheckUtils]: 82: Hoare triple {100506#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,986 INFO L272 TraceCheckUtils]: 83: Hoare triple {100506#(<= ~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)); {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,986 INFO L290 TraceCheckUtils]: 84: Hoare triple {100506#(<= ~counter~0 9)} ~cond := #in~cond; {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,987 INFO L290 TraceCheckUtils]: 85: Hoare triple {100506#(<= ~counter~0 9)} assume !(0 == ~cond); {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,987 INFO L290 TraceCheckUtils]: 86: Hoare triple {100506#(<= ~counter~0 9)} assume true; {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,987 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100506#(<= ~counter~0 9)} {100506#(<= ~counter~0 9)} #96#return; {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,988 INFO L290 TraceCheckUtils]: 88: Hoare triple {100506#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100506#(<= ~counter~0 9)} is VALID [2022-04-15 09:08:51,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {100506#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,989 INFO L290 TraceCheckUtils]: 90: Hoare triple {100531#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,990 INFO L272 TraceCheckUtils]: 91: Hoare triple {100531#(<= ~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)); {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,990 INFO L290 TraceCheckUtils]: 92: Hoare triple {100531#(<= ~counter~0 10)} ~cond := #in~cond; {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,990 INFO L290 TraceCheckUtils]: 93: Hoare triple {100531#(<= ~counter~0 10)} assume !(0 == ~cond); {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,990 INFO L290 TraceCheckUtils]: 94: Hoare triple {100531#(<= ~counter~0 10)} assume true; {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,991 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100531#(<= ~counter~0 10)} {100531#(<= ~counter~0 10)} #96#return; {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,991 INFO L290 TraceCheckUtils]: 96: Hoare triple {100531#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100531#(<= ~counter~0 10)} is VALID [2022-04-15 09:08:51,992 INFO L290 TraceCheckUtils]: 97: Hoare triple {100531#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,992 INFO L290 TraceCheckUtils]: 98: Hoare triple {100556#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,993 INFO L272 TraceCheckUtils]: 99: Hoare triple {100556#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,993 INFO L290 TraceCheckUtils]: 100: Hoare triple {100556#(<= ~counter~0 11)} ~cond := #in~cond; {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {100556#(<= ~counter~0 11)} assume !(0 == ~cond); {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,994 INFO L290 TraceCheckUtils]: 102: Hoare triple {100556#(<= ~counter~0 11)} assume true; {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,994 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100556#(<= ~counter~0 11)} {100556#(<= ~counter~0 11)} #96#return; {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,994 INFO L290 TraceCheckUtils]: 104: Hoare triple {100556#(<= ~counter~0 11)} assume !(~r~0 > 0); {100556#(<= ~counter~0 11)} is VALID [2022-04-15 09:08:51,995 INFO L290 TraceCheckUtils]: 105: Hoare triple {100556#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,996 INFO L290 TraceCheckUtils]: 106: Hoare triple {100581#(<= ~counter~0 12)} assume !!(#t~post8 < 50);havoc #t~post8; {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,996 INFO L272 TraceCheckUtils]: 107: Hoare triple {100581#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,996 INFO L290 TraceCheckUtils]: 108: Hoare triple {100581#(<= ~counter~0 12)} ~cond := #in~cond; {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,997 INFO L290 TraceCheckUtils]: 109: Hoare triple {100581#(<= ~counter~0 12)} assume !(0 == ~cond); {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,997 INFO L290 TraceCheckUtils]: 110: Hoare triple {100581#(<= ~counter~0 12)} assume true; {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,997 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100581#(<= ~counter~0 12)} {100581#(<= ~counter~0 12)} #98#return; {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,998 INFO L290 TraceCheckUtils]: 112: Hoare triple {100581#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100581#(<= ~counter~0 12)} is VALID [2022-04-15 09:08:51,999 INFO L290 TraceCheckUtils]: 113: Hoare triple {100581#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:51,999 INFO L290 TraceCheckUtils]: 114: Hoare triple {100606#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:51,999 INFO L272 TraceCheckUtils]: 115: Hoare triple {100606#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:52,000 INFO L290 TraceCheckUtils]: 116: Hoare triple {100606#(<= ~counter~0 13)} ~cond := #in~cond; {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:52,000 INFO L290 TraceCheckUtils]: 117: Hoare triple {100606#(<= ~counter~0 13)} assume !(0 == ~cond); {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:52,000 INFO L290 TraceCheckUtils]: 118: Hoare triple {100606#(<= ~counter~0 13)} assume true; {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:52,001 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100606#(<= ~counter~0 13)} {100606#(<= ~counter~0 13)} #98#return; {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:52,001 INFO L290 TraceCheckUtils]: 120: Hoare triple {100606#(<= ~counter~0 13)} assume !(~r~0 < 0); {100606#(<= ~counter~0 13)} is VALID [2022-04-15 09:08:52,001 INFO L290 TraceCheckUtils]: 121: Hoare triple {100606#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100631#(<= |main_#t~post6| 13)} is VALID [2022-04-15 09:08:52,002 INFO L290 TraceCheckUtils]: 122: Hoare triple {100631#(<= |main_#t~post6| 13)} assume !(#t~post6 < 50);havoc #t~post6; {100250#false} is VALID [2022-04-15 09:08:52,002 INFO L272 TraceCheckUtils]: 123: Hoare triple {100250#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)); {100250#false} is VALID [2022-04-15 09:08:52,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {100250#false} ~cond := #in~cond; {100250#false} is VALID [2022-04-15 09:08:52,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {100250#false} assume 0 == ~cond; {100250#false} is VALID [2022-04-15 09:08:52,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {100250#false} assume !false; {100250#false} is VALID [2022-04-15 09:08:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:08:52,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:08:52,712 INFO L290 TraceCheckUtils]: 126: Hoare triple {100250#false} assume !false; {100250#false} is VALID [2022-04-15 09:08:52,712 INFO L290 TraceCheckUtils]: 125: Hoare triple {100250#false} assume 0 == ~cond; {100250#false} is VALID [2022-04-15 09:08:52,712 INFO L290 TraceCheckUtils]: 124: Hoare triple {100250#false} ~cond := #in~cond; {100250#false} is VALID [2022-04-15 09:08:52,712 INFO L272 TraceCheckUtils]: 123: Hoare triple {100250#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)); {100250#false} is VALID [2022-04-15 09:08:52,712 INFO L290 TraceCheckUtils]: 122: Hoare triple {100659#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {100250#false} is VALID [2022-04-15 09:08:52,712 INFO L290 TraceCheckUtils]: 121: Hoare triple {100663#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100659#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:08:52,713 INFO L290 TraceCheckUtils]: 120: Hoare triple {100663#(< ~counter~0 50)} assume !(~r~0 < 0); {100663#(< ~counter~0 50)} is VALID [2022-04-15 09:08:52,713 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100249#true} {100663#(< ~counter~0 50)} #98#return; {100663#(< ~counter~0 50)} is VALID [2022-04-15 09:08:52,713 INFO L290 TraceCheckUtils]: 118: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,713 INFO L290 TraceCheckUtils]: 117: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,713 INFO L290 TraceCheckUtils]: 116: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,713 INFO L272 TraceCheckUtils]: 115: Hoare triple {100663#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,714 INFO L290 TraceCheckUtils]: 114: Hoare triple {100663#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {100663#(< ~counter~0 50)} is VALID [2022-04-15 09:08:52,715 INFO L290 TraceCheckUtils]: 113: Hoare triple {100688#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100663#(< ~counter~0 50)} is VALID [2022-04-15 09:08:52,716 INFO L290 TraceCheckUtils]: 112: Hoare triple {100688#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100688#(< ~counter~0 49)} is VALID [2022-04-15 09:08:52,716 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100249#true} {100688#(< ~counter~0 49)} #98#return; {100688#(< ~counter~0 49)} is VALID [2022-04-15 09:08:52,716 INFO L290 TraceCheckUtils]: 110: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,716 INFO L290 TraceCheckUtils]: 109: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,716 INFO L290 TraceCheckUtils]: 108: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,716 INFO L272 TraceCheckUtils]: 107: Hoare triple {100688#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,717 INFO L290 TraceCheckUtils]: 106: Hoare triple {100688#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {100688#(< ~counter~0 49)} is VALID [2022-04-15 09:08:52,717 INFO L290 TraceCheckUtils]: 105: Hoare triple {100713#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100688#(< ~counter~0 49)} is VALID [2022-04-15 09:08:52,718 INFO L290 TraceCheckUtils]: 104: Hoare triple {100713#(< ~counter~0 48)} assume !(~r~0 > 0); {100713#(< ~counter~0 48)} is VALID [2022-04-15 09:08:52,718 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100249#true} {100713#(< ~counter~0 48)} #96#return; {100713#(< ~counter~0 48)} is VALID [2022-04-15 09:08:52,718 INFO L290 TraceCheckUtils]: 102: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,718 INFO L290 TraceCheckUtils]: 101: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,718 INFO L290 TraceCheckUtils]: 100: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,718 INFO L272 TraceCheckUtils]: 99: Hoare triple {100713#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,718 INFO L290 TraceCheckUtils]: 98: Hoare triple {100713#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {100713#(< ~counter~0 48)} is VALID [2022-04-15 09:08:52,719 INFO L290 TraceCheckUtils]: 97: Hoare triple {100738#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100713#(< ~counter~0 48)} is VALID [2022-04-15 09:08:52,719 INFO L290 TraceCheckUtils]: 96: Hoare triple {100738#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100738#(< ~counter~0 47)} is VALID [2022-04-15 09:08:52,720 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100249#true} {100738#(< ~counter~0 47)} #96#return; {100738#(< ~counter~0 47)} is VALID [2022-04-15 09:08:52,720 INFO L290 TraceCheckUtils]: 94: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,720 INFO L290 TraceCheckUtils]: 93: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,720 INFO L290 TraceCheckUtils]: 92: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,720 INFO L272 TraceCheckUtils]: 91: Hoare triple {100738#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,720 INFO L290 TraceCheckUtils]: 90: Hoare triple {100738#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {100738#(< ~counter~0 47)} is VALID [2022-04-15 09:08:52,721 INFO L290 TraceCheckUtils]: 89: Hoare triple {100763#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100738#(< ~counter~0 47)} is VALID [2022-04-15 09:08:52,721 INFO L290 TraceCheckUtils]: 88: Hoare triple {100763#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100763#(< ~counter~0 46)} is VALID [2022-04-15 09:08:52,722 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100249#true} {100763#(< ~counter~0 46)} #96#return; {100763#(< ~counter~0 46)} is VALID [2022-04-15 09:08:52,722 INFO L290 TraceCheckUtils]: 86: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,722 INFO L290 TraceCheckUtils]: 85: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,722 INFO L290 TraceCheckUtils]: 84: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,722 INFO L272 TraceCheckUtils]: 83: Hoare triple {100763#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,722 INFO L290 TraceCheckUtils]: 82: Hoare triple {100763#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {100763#(< ~counter~0 46)} is VALID [2022-04-15 09:08:52,723 INFO L290 TraceCheckUtils]: 81: Hoare triple {100788#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100763#(< ~counter~0 46)} is VALID [2022-04-15 09:08:52,723 INFO L290 TraceCheckUtils]: 80: Hoare triple {100788#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100788#(< ~counter~0 45)} is VALID [2022-04-15 09:08:52,724 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100249#true} {100788#(< ~counter~0 45)} #96#return; {100788#(< ~counter~0 45)} is VALID [2022-04-15 09:08:52,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,724 INFO L290 TraceCheckUtils]: 76: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,724 INFO L272 TraceCheckUtils]: 75: Hoare triple {100788#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {100788#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {100788#(< ~counter~0 45)} is VALID [2022-04-15 09:08:52,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {100813#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100788#(< ~counter~0 45)} is VALID [2022-04-15 09:08:52,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {100813#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100813#(< ~counter~0 44)} is VALID [2022-04-15 09:08:52,726 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100249#true} {100813#(< ~counter~0 44)} #96#return; {100813#(< ~counter~0 44)} is VALID [2022-04-15 09:08:52,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {100813#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {100813#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {100813#(< ~counter~0 44)} is VALID [2022-04-15 09:08:52,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {100838#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100813#(< ~counter~0 44)} is VALID [2022-04-15 09:08:52,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {100838#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100838#(< ~counter~0 43)} is VALID [2022-04-15 09:08:52,727 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100249#true} {100838#(< ~counter~0 43)} #96#return; {100838#(< ~counter~0 43)} is VALID [2022-04-15 09:08:52,728 INFO L290 TraceCheckUtils]: 62: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,728 INFO L272 TraceCheckUtils]: 59: Hoare triple {100838#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {100838#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {100838#(< ~counter~0 43)} is VALID [2022-04-15 09:08:52,729 INFO L290 TraceCheckUtils]: 57: Hoare triple {100863#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100838#(< ~counter~0 43)} is VALID [2022-04-15 09:08:52,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {100863#(< ~counter~0 42)} assume !!(0 != ~r~0); {100863#(< ~counter~0 42)} is VALID [2022-04-15 09:08:52,729 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100249#true} {100863#(< ~counter~0 42)} #94#return; {100863#(< ~counter~0 42)} is VALID [2022-04-15 09:08:52,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,730 INFO L272 TraceCheckUtils]: 51: Hoare triple {100863#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {100863#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {100863#(< ~counter~0 42)} is VALID [2022-04-15 09:08:52,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {100888#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100863#(< ~counter~0 42)} is VALID [2022-04-15 09:08:52,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {100888#(< ~counter~0 41)} assume !(~r~0 < 0); {100888#(< ~counter~0 41)} is VALID [2022-04-15 09:08:52,731 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100249#true} {100888#(< ~counter~0 41)} #98#return; {100888#(< ~counter~0 41)} is VALID [2022-04-15 09:08:52,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,732 INFO L272 TraceCheckUtils]: 43: Hoare triple {100888#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {100888#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {100888#(< ~counter~0 41)} is VALID [2022-04-15 09:08:52,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {100913#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100888#(< ~counter~0 41)} is VALID [2022-04-15 09:08:52,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {100913#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100913#(< ~counter~0 40)} is VALID [2022-04-15 09:08:52,733 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {100249#true} {100913#(< ~counter~0 40)} #98#return; {100913#(< ~counter~0 40)} is VALID [2022-04-15 09:08:52,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,734 INFO L272 TraceCheckUtils]: 35: Hoare triple {100913#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {100913#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {100913#(< ~counter~0 40)} is VALID [2022-04-15 09:08:52,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {100938#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100913#(< ~counter~0 40)} is VALID [2022-04-15 09:08:52,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {100938#(< ~counter~0 39)} assume !(~r~0 > 0); {100938#(< ~counter~0 39)} is VALID [2022-04-15 09:08:52,735 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {100249#true} {100938#(< ~counter~0 39)} #96#return; {100938#(< ~counter~0 39)} is VALID [2022-04-15 09:08:52,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,735 INFO L272 TraceCheckUtils]: 27: Hoare triple {100938#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {100938#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {100938#(< ~counter~0 39)} is VALID [2022-04-15 09:08:52,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {100963#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100938#(< ~counter~0 39)} is VALID [2022-04-15 09:08:52,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {100963#(< ~counter~0 38)} assume !!(0 != ~r~0); {100963#(< ~counter~0 38)} is VALID [2022-04-15 09:08:52,737 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {100249#true} {100963#(< ~counter~0 38)} #94#return; {100963#(< ~counter~0 38)} is VALID [2022-04-15 09:08:52,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,737 INFO L272 TraceCheckUtils]: 19: Hoare triple {100963#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {100963#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {100963#(< ~counter~0 38)} is VALID [2022-04-15 09:08:52,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {100988#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100963#(< ~counter~0 38)} is VALID [2022-04-15 09:08:52,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {100988#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,739 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {100249#true} {100988#(< ~counter~0 37)} #92#return; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {100988#(< ~counter~0 37)} 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)); {100249#true} is VALID [2022-04-15 09:08:52,740 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {100249#true} {100988#(< ~counter~0 37)} #90#return; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {100249#true} assume true; {100249#true} is VALID [2022-04-15 09:08:52,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {100249#true} assume !(0 == ~cond); {100249#true} is VALID [2022-04-15 09:08:52,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {100249#true} ~cond := #in~cond; {100249#true} is VALID [2022-04-15 09:08:52,740 INFO L272 TraceCheckUtils]: 6: Hoare triple {100988#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {100249#true} is VALID [2022-04-15 09:08:52,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {100988#(< ~counter~0 37)} 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; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {100988#(< ~counter~0 37)} call #t~ret9 := main(); {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100988#(< ~counter~0 37)} {100249#true} #102#return; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {100988#(< ~counter~0 37)} assume true; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {100249#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; {100988#(< ~counter~0 37)} is VALID [2022-04-15 09:08:52,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {100249#true} call ULTIMATE.init(); {100249#true} is VALID [2022-04-15 09:08:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 09:08:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:08:52,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777915546] [2022-04-15 09:08:52,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:08:52,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57339609] [2022-04-15 09:08:52,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57339609] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:08:52,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:08:52,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 09:08:52,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:08:52,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340834057] [2022-04-15 09:08:52,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340834057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:08:52,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:08:52,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 09:08:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920384998] [2022-04-15 09:08:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:08:52,743 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-15 09:08:52,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:08:52,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:08:52,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:52,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 09:08:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:08:52,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 09:08:52,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 09:08:52,857 INFO L87 Difference]: Start difference. First operand 694 states and 912 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:08:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:55,964 INFO L93 Difference]: Finished difference Result 753 states and 992 transitions. [2022-04-15 09:08:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 09:08:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 127 [2022-04-15 09:08:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:08:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:08:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 09:08:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:08:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 09:08:55,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-15 09:08:56,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:08:56,178 INFO L225 Difference]: With dead ends: 753 [2022-04-15 09:08:56,178 INFO L226 Difference]: Without dead ends: 742 [2022-04-15 09:08:56,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=723, Invalid=999, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 09:08:56,180 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 180 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 09:08:56,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 321 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 09:08:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-04-15 09:08:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 720. [2022-04-15 09:08:57,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:08:57,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 742 states. Second operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:08:57,415 INFO L74 IsIncluded]: Start isIncluded. First operand 742 states. Second operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:08:57,415 INFO L87 Difference]: Start difference. First operand 742 states. Second operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:08:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:57,432 INFO L93 Difference]: Finished difference Result 742 states and 976 transitions. [2022-04-15 09:08:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 976 transitions. [2022-04-15 09:08:57,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:08:57,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:08:57,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 742 states. [2022-04-15 09:08:57,434 INFO L87 Difference]: Start difference. First operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 742 states. [2022-04-15 09:08:57,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:08:57,457 INFO L93 Difference]: Finished difference Result 742 states and 976 transitions. [2022-04-15 09:08:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 976 transitions. [2022-04-15 09:08:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:08:57,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:08:57,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:08:57,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:08:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 538 states have (on average 1.2007434944237918) internal successors, (646), 548 states have internal predecessors, (646), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:08:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 950 transitions. [2022-04-15 09:08:57,486 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 950 transitions. Word has length 127 [2022-04-15 09:08:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:08:57,486 INFO L478 AbstractCegarLoop]: Abstraction has 720 states and 950 transitions. [2022-04-15 09:08:57,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:08:57,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 720 states and 950 transitions. [2022-04-15 09:09:16,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 950 edges. 947 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 950 transitions. [2022-04-15 09:09:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 09:09:16,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:16,504 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 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] [2022-04-15 09:09:16,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 09:09:16,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:16,705 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:16,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-15 09:09:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:16,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675058689] [2022-04-15 09:09:16,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:16,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-15 09:09:16,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:16,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003421193] [2022-04-15 09:09:16,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:16,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:16,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:09:16,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1708881409] [2022-04-15 09:09:16,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:09:16,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:16,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:16,729 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:09:16,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 09:09:16,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:09:16,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:09:16,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 09:09:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:16,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:09:17,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {105492#true} call ULTIMATE.init(); {105492#true} is VALID [2022-04-15 09:09:17,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {105492#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; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {105500#(<= ~counter~0 0)} assume true; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105500#(<= ~counter~0 0)} {105492#true} #102#return; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {105500#(<= ~counter~0 0)} call #t~ret9 := main(); {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {105500#(<= ~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; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {105500#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {105500#(<= ~counter~0 0)} ~cond := #in~cond; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {105500#(<= ~counter~0 0)} assume !(0 == ~cond); {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {105500#(<= ~counter~0 0)} assume true; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {105500#(<= ~counter~0 0)} {105500#(<= ~counter~0 0)} #90#return; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,472 INFO L272 TraceCheckUtils]: 11: Hoare triple {105500#(<= ~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)); {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {105500#(<= ~counter~0 0)} ~cond := #in~cond; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {105500#(<= ~counter~0 0)} assume !(0 == ~cond); {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {105500#(<= ~counter~0 0)} assume true; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,473 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {105500#(<= ~counter~0 0)} {105500#(<= ~counter~0 0)} #92#return; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {105500#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {105500#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:17,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {105500#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {105549#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {105549#(<= ~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)); {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {105549#(<= ~counter~0 1)} ~cond := #in~cond; {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {105549#(<= ~counter~0 1)} assume !(0 == ~cond); {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {105549#(<= ~counter~0 1)} assume true; {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,477 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {105549#(<= ~counter~0 1)} {105549#(<= ~counter~0 1)} #94#return; {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {105549#(<= ~counter~0 1)} assume !!(0 != ~r~0); {105549#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:17,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {105549#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {105574#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,479 INFO L272 TraceCheckUtils]: 27: Hoare triple {105574#(<= ~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)); {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {105574#(<= ~counter~0 2)} ~cond := #in~cond; {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {105574#(<= ~counter~0 2)} assume !(0 == ~cond); {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {105574#(<= ~counter~0 2)} assume true; {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,481 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {105574#(<= ~counter~0 2)} {105574#(<= ~counter~0 2)} #96#return; {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {105574#(<= ~counter~0 2)} assume !(~r~0 > 0); {105574#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:17,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {105574#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {105599#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,483 INFO L272 TraceCheckUtils]: 35: Hoare triple {105599#(<= ~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)); {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {105599#(<= ~counter~0 3)} ~cond := #in~cond; {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {105599#(<= ~counter~0 3)} assume !(0 == ~cond); {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {105599#(<= ~counter~0 3)} assume true; {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,484 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {105599#(<= ~counter~0 3)} {105599#(<= ~counter~0 3)} #98#return; {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {105599#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105599#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:17,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {105599#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {105624#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,486 INFO L272 TraceCheckUtils]: 43: Hoare triple {105624#(<= ~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)); {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {105624#(<= ~counter~0 4)} ~cond := #in~cond; {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {105624#(<= ~counter~0 4)} assume !(0 == ~cond); {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {105624#(<= ~counter~0 4)} assume true; {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,487 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {105624#(<= ~counter~0 4)} {105624#(<= ~counter~0 4)} #98#return; {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {105624#(<= ~counter~0 4)} assume !(~r~0 < 0); {105624#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:17,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {105624#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {105649#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,489 INFO L272 TraceCheckUtils]: 51: Hoare triple {105649#(<= ~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)); {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {105649#(<= ~counter~0 5)} ~cond := #in~cond; {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {105649#(<= ~counter~0 5)} assume !(0 == ~cond); {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {105649#(<= ~counter~0 5)} assume true; {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,490 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {105649#(<= ~counter~0 5)} {105649#(<= ~counter~0 5)} #94#return; {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {105649#(<= ~counter~0 5)} assume !!(0 != ~r~0); {105649#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:17,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {105649#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {105674#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,492 INFO L272 TraceCheckUtils]: 59: Hoare triple {105674#(<= ~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)); {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {105674#(<= ~counter~0 6)} ~cond := #in~cond; {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {105674#(<= ~counter~0 6)} assume !(0 == ~cond); {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {105674#(<= ~counter~0 6)} assume true; {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,494 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {105674#(<= ~counter~0 6)} {105674#(<= ~counter~0 6)} #96#return; {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,494 INFO L290 TraceCheckUtils]: 64: Hoare triple {105674#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105674#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:17,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {105674#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {105699#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,495 INFO L272 TraceCheckUtils]: 67: Hoare triple {105699#(<= ~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)); {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {105699#(<= ~counter~0 7)} ~cond := #in~cond; {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {105699#(<= ~counter~0 7)} assume !(0 == ~cond); {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {105699#(<= ~counter~0 7)} assume true; {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,497 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {105699#(<= ~counter~0 7)} {105699#(<= ~counter~0 7)} #96#return; {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,497 INFO L290 TraceCheckUtils]: 72: Hoare triple {105699#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105699#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:17,498 INFO L290 TraceCheckUtils]: 73: Hoare triple {105699#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {105724#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,499 INFO L272 TraceCheckUtils]: 75: Hoare triple {105724#(<= ~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)); {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {105724#(<= ~counter~0 8)} ~cond := #in~cond; {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {105724#(<= ~counter~0 8)} assume !(0 == ~cond); {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,500 INFO L290 TraceCheckUtils]: 78: Hoare triple {105724#(<= ~counter~0 8)} assume true; {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,500 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {105724#(<= ~counter~0 8)} {105724#(<= ~counter~0 8)} #96#return; {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,500 INFO L290 TraceCheckUtils]: 80: Hoare triple {105724#(<= ~counter~0 8)} assume !(~r~0 > 0); {105724#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:17,501 INFO L290 TraceCheckUtils]: 81: Hoare triple {105724#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,501 INFO L290 TraceCheckUtils]: 82: Hoare triple {105749#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,502 INFO L272 TraceCheckUtils]: 83: Hoare triple {105749#(<= ~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)); {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {105749#(<= ~counter~0 9)} ~cond := #in~cond; {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {105749#(<= ~counter~0 9)} assume !(0 == ~cond); {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,503 INFO L290 TraceCheckUtils]: 86: Hoare triple {105749#(<= ~counter~0 9)} assume true; {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,503 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {105749#(<= ~counter~0 9)} {105749#(<= ~counter~0 9)} #98#return; {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,504 INFO L290 TraceCheckUtils]: 88: Hoare triple {105749#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {105749#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:17,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {105749#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,505 INFO L290 TraceCheckUtils]: 90: Hoare triple {105774#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,505 INFO L272 TraceCheckUtils]: 91: Hoare triple {105774#(<= ~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)); {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,505 INFO L290 TraceCheckUtils]: 92: Hoare triple {105774#(<= ~counter~0 10)} ~cond := #in~cond; {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,506 INFO L290 TraceCheckUtils]: 93: Hoare triple {105774#(<= ~counter~0 10)} assume !(0 == ~cond); {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,506 INFO L290 TraceCheckUtils]: 94: Hoare triple {105774#(<= ~counter~0 10)} assume true; {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,506 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {105774#(<= ~counter~0 10)} {105774#(<= ~counter~0 10)} #98#return; {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,507 INFO L290 TraceCheckUtils]: 96: Hoare triple {105774#(<= ~counter~0 10)} assume !(~r~0 < 0); {105774#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:17,508 INFO L290 TraceCheckUtils]: 97: Hoare triple {105774#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,508 INFO L290 TraceCheckUtils]: 98: Hoare triple {105799#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,508 INFO L272 TraceCheckUtils]: 99: Hoare triple {105799#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {105799#(<= ~counter~0 11)} ~cond := #in~cond; {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {105799#(<= ~counter~0 11)} assume !(0 == ~cond); {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {105799#(<= ~counter~0 11)} assume true; {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,510 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {105799#(<= ~counter~0 11)} {105799#(<= ~counter~0 11)} #94#return; {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,510 INFO L290 TraceCheckUtils]: 104: Hoare triple {105799#(<= ~counter~0 11)} assume !!(0 != ~r~0); {105799#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:17,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {105799#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,511 INFO L290 TraceCheckUtils]: 106: Hoare triple {105824#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,512 INFO L272 TraceCheckUtils]: 107: Hoare triple {105824#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,512 INFO L290 TraceCheckUtils]: 108: Hoare triple {105824#(<= ~counter~0 12)} ~cond := #in~cond; {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,512 INFO L290 TraceCheckUtils]: 109: Hoare triple {105824#(<= ~counter~0 12)} assume !(0 == ~cond); {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,512 INFO L290 TraceCheckUtils]: 110: Hoare triple {105824#(<= ~counter~0 12)} assume true; {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,513 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {105824#(<= ~counter~0 12)} {105824#(<= ~counter~0 12)} #96#return; {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,513 INFO L290 TraceCheckUtils]: 112: Hoare triple {105824#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105824#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:17,514 INFO L290 TraceCheckUtils]: 113: Hoare triple {105824#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,514 INFO L290 TraceCheckUtils]: 114: Hoare triple {105849#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,515 INFO L272 TraceCheckUtils]: 115: Hoare triple {105849#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,515 INFO L290 TraceCheckUtils]: 116: Hoare triple {105849#(<= ~counter~0 13)} ~cond := #in~cond; {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,515 INFO L290 TraceCheckUtils]: 117: Hoare triple {105849#(<= ~counter~0 13)} assume !(0 == ~cond); {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,516 INFO L290 TraceCheckUtils]: 118: Hoare triple {105849#(<= ~counter~0 13)} assume true; {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,516 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {105849#(<= ~counter~0 13)} {105849#(<= ~counter~0 13)} #96#return; {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,516 INFO L290 TraceCheckUtils]: 120: Hoare triple {105849#(<= ~counter~0 13)} assume !(~r~0 > 0); {105849#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:17,517 INFO L290 TraceCheckUtils]: 121: Hoare triple {105849#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105874#(<= |main_#t~post8| 13)} is VALID [2022-04-15 09:09:17,517 INFO L290 TraceCheckUtils]: 122: Hoare triple {105874#(<= |main_#t~post8| 13)} assume !(#t~post8 < 50);havoc #t~post8; {105493#false} is VALID [2022-04-15 09:09:17,517 INFO L290 TraceCheckUtils]: 123: Hoare triple {105493#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105493#false} is VALID [2022-04-15 09:09:17,517 INFO L290 TraceCheckUtils]: 124: Hoare triple {105493#false} assume !(#t~post6 < 50);havoc #t~post6; {105493#false} is VALID [2022-04-15 09:09:17,517 INFO L272 TraceCheckUtils]: 125: Hoare triple {105493#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)); {105493#false} is VALID [2022-04-15 09:09:17,517 INFO L290 TraceCheckUtils]: 126: Hoare triple {105493#false} ~cond := #in~cond; {105493#false} is VALID [2022-04-15 09:09:17,517 INFO L290 TraceCheckUtils]: 127: Hoare triple {105493#false} assume 0 == ~cond; {105493#false} is VALID [2022-04-15 09:09:17,518 INFO L290 TraceCheckUtils]: 128: Hoare triple {105493#false} assume !false; {105493#false} is VALID [2022-04-15 09:09:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:09:17,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:09:18,136 INFO L290 TraceCheckUtils]: 128: Hoare triple {105493#false} assume !false; {105493#false} is VALID [2022-04-15 09:09:18,136 INFO L290 TraceCheckUtils]: 127: Hoare triple {105493#false} assume 0 == ~cond; {105493#false} is VALID [2022-04-15 09:09:18,136 INFO L290 TraceCheckUtils]: 126: Hoare triple {105493#false} ~cond := #in~cond; {105493#false} is VALID [2022-04-15 09:09:18,136 INFO L272 TraceCheckUtils]: 125: Hoare triple {105493#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)); {105493#false} is VALID [2022-04-15 09:09:18,137 INFO L290 TraceCheckUtils]: 124: Hoare triple {105493#false} assume !(#t~post6 < 50);havoc #t~post6; {105493#false} is VALID [2022-04-15 09:09:18,137 INFO L290 TraceCheckUtils]: 123: Hoare triple {105493#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105493#false} is VALID [2022-04-15 09:09:18,137 INFO L290 TraceCheckUtils]: 122: Hoare triple {105914#(< |main_#t~post8| 50)} assume !(#t~post8 < 50);havoc #t~post8; {105493#false} is VALID [2022-04-15 09:09:18,137 INFO L290 TraceCheckUtils]: 121: Hoare triple {105918#(< ~counter~0 50)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105914#(< |main_#t~post8| 50)} is VALID [2022-04-15 09:09:18,137 INFO L290 TraceCheckUtils]: 120: Hoare triple {105918#(< ~counter~0 50)} assume !(~r~0 > 0); {105918#(< ~counter~0 50)} is VALID [2022-04-15 09:09:18,138 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {105492#true} {105918#(< ~counter~0 50)} #96#return; {105918#(< ~counter~0 50)} is VALID [2022-04-15 09:09:18,138 INFO L290 TraceCheckUtils]: 118: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,138 INFO L290 TraceCheckUtils]: 117: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,138 INFO L290 TraceCheckUtils]: 116: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,138 INFO L272 TraceCheckUtils]: 115: Hoare triple {105918#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,138 INFO L290 TraceCheckUtils]: 114: Hoare triple {105918#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {105918#(< ~counter~0 50)} is VALID [2022-04-15 09:09:18,140 INFO L290 TraceCheckUtils]: 113: Hoare triple {105943#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105918#(< ~counter~0 50)} is VALID [2022-04-15 09:09:18,140 INFO L290 TraceCheckUtils]: 112: Hoare triple {105943#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {105943#(< ~counter~0 49)} is VALID [2022-04-15 09:09:18,141 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {105492#true} {105943#(< ~counter~0 49)} #96#return; {105943#(< ~counter~0 49)} is VALID [2022-04-15 09:09:18,141 INFO L290 TraceCheckUtils]: 110: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,141 INFO L290 TraceCheckUtils]: 109: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,141 INFO L290 TraceCheckUtils]: 108: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,141 INFO L272 TraceCheckUtils]: 107: Hoare triple {105943#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,141 INFO L290 TraceCheckUtils]: 106: Hoare triple {105943#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {105943#(< ~counter~0 49)} is VALID [2022-04-15 09:09:18,142 INFO L290 TraceCheckUtils]: 105: Hoare triple {105968#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {105943#(< ~counter~0 49)} is VALID [2022-04-15 09:09:18,142 INFO L290 TraceCheckUtils]: 104: Hoare triple {105968#(< ~counter~0 48)} assume !!(0 != ~r~0); {105968#(< ~counter~0 48)} is VALID [2022-04-15 09:09:18,142 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {105492#true} {105968#(< ~counter~0 48)} #94#return; {105968#(< ~counter~0 48)} is VALID [2022-04-15 09:09:18,142 INFO L290 TraceCheckUtils]: 102: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,142 INFO L290 TraceCheckUtils]: 101: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,142 INFO L290 TraceCheckUtils]: 100: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,143 INFO L272 TraceCheckUtils]: 99: Hoare triple {105968#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,143 INFO L290 TraceCheckUtils]: 98: Hoare triple {105968#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {105968#(< ~counter~0 48)} is VALID [2022-04-15 09:09:18,143 INFO L290 TraceCheckUtils]: 97: Hoare triple {105993#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {105968#(< ~counter~0 48)} is VALID [2022-04-15 09:09:18,144 INFO L290 TraceCheckUtils]: 96: Hoare triple {105993#(< ~counter~0 47)} assume !(~r~0 < 0); {105993#(< ~counter~0 47)} is VALID [2022-04-15 09:09:18,144 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {105492#true} {105993#(< ~counter~0 47)} #98#return; {105993#(< ~counter~0 47)} is VALID [2022-04-15 09:09:18,144 INFO L290 TraceCheckUtils]: 94: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,144 INFO L272 TraceCheckUtils]: 91: Hoare triple {105993#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,144 INFO L290 TraceCheckUtils]: 90: Hoare triple {105993#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {105993#(< ~counter~0 47)} is VALID [2022-04-15 09:09:18,145 INFO L290 TraceCheckUtils]: 89: Hoare triple {106018#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {105993#(< ~counter~0 47)} is VALID [2022-04-15 09:09:18,145 INFO L290 TraceCheckUtils]: 88: Hoare triple {106018#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {106018#(< ~counter~0 46)} is VALID [2022-04-15 09:09:18,146 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {105492#true} {106018#(< ~counter~0 46)} #98#return; {106018#(< ~counter~0 46)} is VALID [2022-04-15 09:09:18,146 INFO L290 TraceCheckUtils]: 86: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,146 INFO L290 TraceCheckUtils]: 85: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,146 INFO L290 TraceCheckUtils]: 84: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,146 INFO L272 TraceCheckUtils]: 83: Hoare triple {106018#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,146 INFO L290 TraceCheckUtils]: 82: Hoare triple {106018#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {106018#(< ~counter~0 46)} is VALID [2022-04-15 09:09:18,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {106043#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106018#(< ~counter~0 46)} is VALID [2022-04-15 09:09:18,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {106043#(< ~counter~0 45)} assume !(~r~0 > 0); {106043#(< ~counter~0 45)} is VALID [2022-04-15 09:09:18,147 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {105492#true} {106043#(< ~counter~0 45)} #96#return; {106043#(< ~counter~0 45)} is VALID [2022-04-15 09:09:18,148 INFO L290 TraceCheckUtils]: 78: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,148 INFO L290 TraceCheckUtils]: 77: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,148 INFO L290 TraceCheckUtils]: 76: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,148 INFO L272 TraceCheckUtils]: 75: Hoare triple {106043#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {106043#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {106043#(< ~counter~0 45)} is VALID [2022-04-15 09:09:18,149 INFO L290 TraceCheckUtils]: 73: Hoare triple {106068#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106043#(< ~counter~0 45)} is VALID [2022-04-15 09:09:18,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {106068#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {106068#(< ~counter~0 44)} is VALID [2022-04-15 09:09:18,149 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {105492#true} {106068#(< ~counter~0 44)} #96#return; {106068#(< ~counter~0 44)} is VALID [2022-04-15 09:09:18,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,149 INFO L272 TraceCheckUtils]: 67: Hoare triple {106068#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {106068#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {106068#(< ~counter~0 44)} is VALID [2022-04-15 09:09:18,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {106093#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106068#(< ~counter~0 44)} is VALID [2022-04-15 09:09:18,151 INFO L290 TraceCheckUtils]: 64: Hoare triple {106093#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {106093#(< ~counter~0 43)} is VALID [2022-04-15 09:09:18,151 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {105492#true} {106093#(< ~counter~0 43)} #96#return; {106093#(< ~counter~0 43)} is VALID [2022-04-15 09:09:18,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,151 INFO L290 TraceCheckUtils]: 60: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,151 INFO L272 TraceCheckUtils]: 59: Hoare triple {106093#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {106093#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {106093#(< ~counter~0 43)} is VALID [2022-04-15 09:09:18,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {106118#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106093#(< ~counter~0 43)} is VALID [2022-04-15 09:09:18,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {106118#(< ~counter~0 42)} assume !!(0 != ~r~0); {106118#(< ~counter~0 42)} is VALID [2022-04-15 09:09:18,153 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {105492#true} {106118#(< ~counter~0 42)} #94#return; {106118#(< ~counter~0 42)} is VALID [2022-04-15 09:09:18,153 INFO L290 TraceCheckUtils]: 54: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,153 INFO L290 TraceCheckUtils]: 53: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,153 INFO L290 TraceCheckUtils]: 52: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,153 INFO L272 TraceCheckUtils]: 51: Hoare triple {106118#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,153 INFO L290 TraceCheckUtils]: 50: Hoare triple {106118#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {106118#(< ~counter~0 42)} is VALID [2022-04-15 09:09:18,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {106143#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106118#(< ~counter~0 42)} is VALID [2022-04-15 09:09:18,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {106143#(< ~counter~0 41)} assume !(~r~0 < 0); {106143#(< ~counter~0 41)} is VALID [2022-04-15 09:09:18,154 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {105492#true} {106143#(< ~counter~0 41)} #98#return; {106143#(< ~counter~0 41)} is VALID [2022-04-15 09:09:18,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,155 INFO L272 TraceCheckUtils]: 43: Hoare triple {106143#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {106143#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {106143#(< ~counter~0 41)} is VALID [2022-04-15 09:09:18,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {106168#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106143#(< ~counter~0 41)} is VALID [2022-04-15 09:09:18,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {106168#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {106168#(< ~counter~0 40)} is VALID [2022-04-15 09:09:18,156 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {105492#true} {106168#(< ~counter~0 40)} #98#return; {106168#(< ~counter~0 40)} is VALID [2022-04-15 09:09:18,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,156 INFO L272 TraceCheckUtils]: 35: Hoare triple {106168#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {106168#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {106168#(< ~counter~0 40)} is VALID [2022-04-15 09:09:18,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {106193#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106168#(< ~counter~0 40)} is VALID [2022-04-15 09:09:18,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {106193#(< ~counter~0 39)} assume !(~r~0 > 0); {106193#(< ~counter~0 39)} is VALID [2022-04-15 09:09:18,158 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {105492#true} {106193#(< ~counter~0 39)} #96#return; {106193#(< ~counter~0 39)} is VALID [2022-04-15 09:09:18,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,158 INFO L272 TraceCheckUtils]: 27: Hoare triple {106193#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,158 INFO L290 TraceCheckUtils]: 26: Hoare triple {106193#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {106193#(< ~counter~0 39)} is VALID [2022-04-15 09:09:18,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {106218#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106193#(< ~counter~0 39)} is VALID [2022-04-15 09:09:18,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {106218#(< ~counter~0 38)} assume !!(0 != ~r~0); {106218#(< ~counter~0 38)} is VALID [2022-04-15 09:09:18,159 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {105492#true} {106218#(< ~counter~0 38)} #94#return; {106218#(< ~counter~0 38)} is VALID [2022-04-15 09:09:18,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,160 INFO L272 TraceCheckUtils]: 19: Hoare triple {106218#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {106218#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {106218#(< ~counter~0 38)} is VALID [2022-04-15 09:09:18,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {106243#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106218#(< ~counter~0 38)} is VALID [2022-04-15 09:09:18,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {106243#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,161 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {105492#true} {106243#(< ~counter~0 37)} #92#return; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,161 INFO L272 TraceCheckUtils]: 11: Hoare triple {106243#(< ~counter~0 37)} 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)); {105492#true} is VALID [2022-04-15 09:09:18,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {105492#true} {106243#(< ~counter~0 37)} #90#return; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {105492#true} assume true; {105492#true} is VALID [2022-04-15 09:09:18,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {105492#true} assume !(0 == ~cond); {105492#true} is VALID [2022-04-15 09:09:18,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {105492#true} ~cond := #in~cond; {105492#true} is VALID [2022-04-15 09:09:18,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {106243#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {105492#true} is VALID [2022-04-15 09:09:18,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {106243#(< ~counter~0 37)} 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; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {106243#(< ~counter~0 37)} call #t~ret9 := main(); {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106243#(< ~counter~0 37)} {105492#true} #102#return; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {106243#(< ~counter~0 37)} assume true; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {105492#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; {106243#(< ~counter~0 37)} is VALID [2022-04-15 09:09:18,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {105492#true} call ULTIMATE.init(); {105492#true} is VALID [2022-04-15 09:09:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 09:09:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:18,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003421193] [2022-04-15 09:09:18,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:09:18,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708881409] [2022-04-15 09:09:18,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708881409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:09:18,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:09:18,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 09:09:18,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:18,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675058689] [2022-04-15 09:09:18,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675058689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:18,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:18,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 09:09:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447778358] [2022-04-15 09:09:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-15 09:09:18,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:18,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:18,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:18,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 09:09:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 09:09:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 09:09:18,263 INFO L87 Difference]: Start difference. First operand 720 states and 950 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:21,380 INFO L93 Difference]: Finished difference Result 945 states and 1286 transitions. [2022-04-15 09:09:21,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 09:09:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 129 [2022-04-15 09:09:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 09:09:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 09:09:21,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-15 09:09:21,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:21,624 INFO L225 Difference]: With dead ends: 945 [2022-04-15 09:09:21,624 INFO L226 Difference]: Without dead ends: 748 [2022-04-15 09:09:21,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=759, Invalid=1047, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 09:09:21,625 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 09:09:21,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 315 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 09:09:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-04-15 09:09:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 738. [2022-04-15 09:09:23,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:23,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 748 states. Second operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:23,147 INFO L74 IsIncluded]: Start isIncluded. First operand 748 states. Second operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:23,148 INFO L87 Difference]: Start difference. First operand 748 states. Second operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:23,166 INFO L93 Difference]: Finished difference Result 748 states and 982 transitions. [2022-04-15 09:09:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 982 transitions. [2022-04-15 09:09:23,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:23,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:23,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 748 states. [2022-04-15 09:09:23,168 INFO L87 Difference]: Start difference. First operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 748 states. [2022-04-15 09:09:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:23,186 INFO L93 Difference]: Finished difference Result 748 states and 982 transitions. [2022-04-15 09:09:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 982 transitions. [2022-04-15 09:09:23,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:23,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:23,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:23,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 556 states have (on average 1.2014388489208634) internal successors, (668), 560 states have internal predecessors, (668), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 972 transitions. [2022-04-15 09:09:23,210 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 972 transitions. Word has length 129 [2022-04-15 09:09:23,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:23,211 INFO L478 AbstractCegarLoop]: Abstraction has 738 states and 972 transitions. [2022-04-15 09:09:23,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:23,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 738 states and 972 transitions. [2022-04-15 09:09:43,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 972 edges. 969 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 972 transitions. [2022-04-15 09:09:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 09:09:43,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:43,316 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-15 09:09:43,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 09:09:43,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 09:09:43,517 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-15 09:09:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:43,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [356392333] [2022-04-15 09:09:43,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-15 09:09:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:43,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511349751] [2022-04-15 09:09:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:43,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:09:43,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086615487] [2022-04-15 09:09:43,530 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:09:43,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:43,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:43,531 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:09:43,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 09:09:43,711 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 09:09:43,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:09:43,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 09:09:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:43,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:09:44,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {111181#true} call ULTIMATE.init(); {111181#true} is VALID [2022-04-15 09:09:44,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {111181#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; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {111189#(<= ~counter~0 0)} assume true; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111189#(<= ~counter~0 0)} {111181#true} #102#return; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {111189#(<= ~counter~0 0)} call #t~ret9 := main(); {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {111189#(<= ~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; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {111189#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {111189#(<= ~counter~0 0)} ~cond := #in~cond; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {111189#(<= ~counter~0 0)} assume !(0 == ~cond); {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {111189#(<= ~counter~0 0)} assume true; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,320 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {111189#(<= ~counter~0 0)} {111189#(<= ~counter~0 0)} #90#return; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,320 INFO L272 TraceCheckUtils]: 11: Hoare triple {111189#(<= ~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)); {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {111189#(<= ~counter~0 0)} ~cond := #in~cond; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {111189#(<= ~counter~0 0)} assume !(0 == ~cond); {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {111189#(<= ~counter~0 0)} assume true; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,321 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {111189#(<= ~counter~0 0)} {111189#(<= ~counter~0 0)} #92#return; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {111189#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {111189#(<= ~counter~0 0)} is VALID [2022-04-15 09:09:44,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {111189#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {111238#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {111238#(<= ~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)); {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {111238#(<= ~counter~0 1)} ~cond := #in~cond; {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {111238#(<= ~counter~0 1)} assume !(0 == ~cond); {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {111238#(<= ~counter~0 1)} assume true; {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,325 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111238#(<= ~counter~0 1)} {111238#(<= ~counter~0 1)} #94#return; {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {111238#(<= ~counter~0 1)} assume !!(0 != ~r~0); {111238#(<= ~counter~0 1)} is VALID [2022-04-15 09:09:44,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {111238#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {111263#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,327 INFO L272 TraceCheckUtils]: 27: Hoare triple {111263#(<= ~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)); {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {111263#(<= ~counter~0 2)} ~cond := #in~cond; {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {111263#(<= ~counter~0 2)} assume !(0 == ~cond); {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {111263#(<= ~counter~0 2)} assume true; {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,328 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {111263#(<= ~counter~0 2)} {111263#(<= ~counter~0 2)} #96#return; {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {111263#(<= ~counter~0 2)} assume !(~r~0 > 0); {111263#(<= ~counter~0 2)} is VALID [2022-04-15 09:09:44,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {111263#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {111288#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,329 INFO L272 TraceCheckUtils]: 35: Hoare triple {111288#(<= ~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)); {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {111288#(<= ~counter~0 3)} ~cond := #in~cond; {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {111288#(<= ~counter~0 3)} assume !(0 == ~cond); {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {111288#(<= ~counter~0 3)} assume true; {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,331 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {111288#(<= ~counter~0 3)} {111288#(<= ~counter~0 3)} #98#return; {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {111288#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111288#(<= ~counter~0 3)} is VALID [2022-04-15 09:09:44,332 INFO L290 TraceCheckUtils]: 41: Hoare triple {111288#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,332 INFO L290 TraceCheckUtils]: 42: Hoare triple {111313#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,332 INFO L272 TraceCheckUtils]: 43: Hoare triple {111313#(<= ~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)); {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {111313#(<= ~counter~0 4)} ~cond := #in~cond; {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {111313#(<= ~counter~0 4)} assume !(0 == ~cond); {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {111313#(<= ~counter~0 4)} assume true; {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,333 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {111313#(<= ~counter~0 4)} {111313#(<= ~counter~0 4)} #98#return; {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {111313#(<= ~counter~0 4)} assume !(~r~0 < 0); {111313#(<= ~counter~0 4)} is VALID [2022-04-15 09:09:44,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {111313#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {111338#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,335 INFO L272 TraceCheckUtils]: 51: Hoare triple {111338#(<= ~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)); {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {111338#(<= ~counter~0 5)} ~cond := #in~cond; {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {111338#(<= ~counter~0 5)} assume !(0 == ~cond); {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {111338#(<= ~counter~0 5)} assume true; {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,336 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {111338#(<= ~counter~0 5)} {111338#(<= ~counter~0 5)} #94#return; {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {111338#(<= ~counter~0 5)} assume !!(0 != ~r~0); {111338#(<= ~counter~0 5)} is VALID [2022-04-15 09:09:44,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {111338#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {111363#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,338 INFO L272 TraceCheckUtils]: 59: Hoare triple {111363#(<= ~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)); {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {111363#(<= ~counter~0 6)} ~cond := #in~cond; {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {111363#(<= ~counter~0 6)} assume !(0 == ~cond); {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {111363#(<= ~counter~0 6)} assume true; {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,339 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {111363#(<= ~counter~0 6)} {111363#(<= ~counter~0 6)} #96#return; {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {111363#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111363#(<= ~counter~0 6)} is VALID [2022-04-15 09:09:44,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {111363#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {111388#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,341 INFO L272 TraceCheckUtils]: 67: Hoare triple {111388#(<= ~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)); {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {111388#(<= ~counter~0 7)} ~cond := #in~cond; {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {111388#(<= ~counter~0 7)} assume !(0 == ~cond); {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {111388#(<= ~counter~0 7)} assume true; {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,342 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {111388#(<= ~counter~0 7)} {111388#(<= ~counter~0 7)} #96#return; {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,342 INFO L290 TraceCheckUtils]: 72: Hoare triple {111388#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111388#(<= ~counter~0 7)} is VALID [2022-04-15 09:09:44,343 INFO L290 TraceCheckUtils]: 73: Hoare triple {111388#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,343 INFO L290 TraceCheckUtils]: 74: Hoare triple {111413#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,343 INFO L272 TraceCheckUtils]: 75: Hoare triple {111413#(<= ~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)); {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,344 INFO L290 TraceCheckUtils]: 76: Hoare triple {111413#(<= ~counter~0 8)} ~cond := #in~cond; {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,344 INFO L290 TraceCheckUtils]: 77: Hoare triple {111413#(<= ~counter~0 8)} assume !(0 == ~cond); {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,344 INFO L290 TraceCheckUtils]: 78: Hoare triple {111413#(<= ~counter~0 8)} assume true; {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,344 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111413#(<= ~counter~0 8)} {111413#(<= ~counter~0 8)} #96#return; {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,345 INFO L290 TraceCheckUtils]: 80: Hoare triple {111413#(<= ~counter~0 8)} assume !(~r~0 > 0); {111413#(<= ~counter~0 8)} is VALID [2022-04-15 09:09:44,345 INFO L290 TraceCheckUtils]: 81: Hoare triple {111413#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,346 INFO L290 TraceCheckUtils]: 82: Hoare triple {111438#(<= ~counter~0 9)} assume !!(#t~post8 < 50);havoc #t~post8; {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,346 INFO L272 TraceCheckUtils]: 83: Hoare triple {111438#(<= ~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)); {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,346 INFO L290 TraceCheckUtils]: 84: Hoare triple {111438#(<= ~counter~0 9)} ~cond := #in~cond; {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {111438#(<= ~counter~0 9)} assume !(0 == ~cond); {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {111438#(<= ~counter~0 9)} assume true; {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,347 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {111438#(<= ~counter~0 9)} {111438#(<= ~counter~0 9)} #98#return; {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,347 INFO L290 TraceCheckUtils]: 88: Hoare triple {111438#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111438#(<= ~counter~0 9)} is VALID [2022-04-15 09:09:44,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {111438#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,349 INFO L290 TraceCheckUtils]: 90: Hoare triple {111463#(<= ~counter~0 10)} assume !!(#t~post8 < 50);havoc #t~post8; {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,349 INFO L272 TraceCheckUtils]: 91: Hoare triple {111463#(<= ~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)); {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {111463#(<= ~counter~0 10)} ~cond := #in~cond; {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {111463#(<= ~counter~0 10)} assume !(0 == ~cond); {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,350 INFO L290 TraceCheckUtils]: 94: Hoare triple {111463#(<= ~counter~0 10)} assume true; {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,350 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {111463#(<= ~counter~0 10)} {111463#(<= ~counter~0 10)} #98#return; {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,350 INFO L290 TraceCheckUtils]: 96: Hoare triple {111463#(<= ~counter~0 10)} assume !(~r~0 < 0); {111463#(<= ~counter~0 10)} is VALID [2022-04-15 09:09:44,351 INFO L290 TraceCheckUtils]: 97: Hoare triple {111463#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,351 INFO L290 TraceCheckUtils]: 98: Hoare triple {111488#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,352 INFO L272 TraceCheckUtils]: 99: Hoare triple {111488#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,352 INFO L290 TraceCheckUtils]: 100: Hoare triple {111488#(<= ~counter~0 11)} ~cond := #in~cond; {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,352 INFO L290 TraceCheckUtils]: 101: Hoare triple {111488#(<= ~counter~0 11)} assume !(0 == ~cond); {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,352 INFO L290 TraceCheckUtils]: 102: Hoare triple {111488#(<= ~counter~0 11)} assume true; {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,353 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {111488#(<= ~counter~0 11)} {111488#(<= ~counter~0 11)} #94#return; {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,353 INFO L290 TraceCheckUtils]: 104: Hoare triple {111488#(<= ~counter~0 11)} assume !!(0 != ~r~0); {111488#(<= ~counter~0 11)} is VALID [2022-04-15 09:09:44,354 INFO L290 TraceCheckUtils]: 105: Hoare triple {111488#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,354 INFO L290 TraceCheckUtils]: 106: Hoare triple {111513#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,354 INFO L272 TraceCheckUtils]: 107: Hoare triple {111513#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,355 INFO L290 TraceCheckUtils]: 108: Hoare triple {111513#(<= ~counter~0 12)} ~cond := #in~cond; {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,355 INFO L290 TraceCheckUtils]: 109: Hoare triple {111513#(<= ~counter~0 12)} assume !(0 == ~cond); {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,355 INFO L290 TraceCheckUtils]: 110: Hoare triple {111513#(<= ~counter~0 12)} assume true; {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,356 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {111513#(<= ~counter~0 12)} {111513#(<= ~counter~0 12)} #96#return; {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,356 INFO L290 TraceCheckUtils]: 112: Hoare triple {111513#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111513#(<= ~counter~0 12)} is VALID [2022-04-15 09:09:44,357 INFO L290 TraceCheckUtils]: 113: Hoare triple {111513#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,357 INFO L290 TraceCheckUtils]: 114: Hoare triple {111538#(<= ~counter~0 13)} assume !!(#t~post7 < 50);havoc #t~post7; {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,357 INFO L272 TraceCheckUtils]: 115: Hoare triple {111538#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,358 INFO L290 TraceCheckUtils]: 116: Hoare triple {111538#(<= ~counter~0 13)} ~cond := #in~cond; {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,358 INFO L290 TraceCheckUtils]: 117: Hoare triple {111538#(<= ~counter~0 13)} assume !(0 == ~cond); {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,358 INFO L290 TraceCheckUtils]: 118: Hoare triple {111538#(<= ~counter~0 13)} assume true; {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,358 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111538#(<= ~counter~0 13)} {111538#(<= ~counter~0 13)} #96#return; {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {111538#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111538#(<= ~counter~0 13)} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 121: Hoare triple {111538#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111563#(<= |main_#t~post7| 13)} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 122: Hoare triple {111563#(<= |main_#t~post7| 13)} assume !(#t~post7 < 50);havoc #t~post7; {111182#false} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 123: Hoare triple {111182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111182#false} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 124: Hoare triple {111182#false} assume !(#t~post8 < 50);havoc #t~post8; {111182#false} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 125: Hoare triple {111182#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111182#false} is VALID [2022-04-15 09:09:44,359 INFO L290 TraceCheckUtils]: 126: Hoare triple {111182#false} assume !(#t~post6 < 50);havoc #t~post6; {111182#false} is VALID [2022-04-15 09:09:44,359 INFO L272 TraceCheckUtils]: 127: Hoare triple {111182#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)); {111182#false} is VALID [2022-04-15 09:09:44,360 INFO L290 TraceCheckUtils]: 128: Hoare triple {111182#false} ~cond := #in~cond; {111182#false} is VALID [2022-04-15 09:09:44,360 INFO L290 TraceCheckUtils]: 129: Hoare triple {111182#false} assume 0 == ~cond; {111182#false} is VALID [2022-04-15 09:09:44,360 INFO L290 TraceCheckUtils]: 130: Hoare triple {111182#false} assume !false; {111182#false} is VALID [2022-04-15 09:09:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:09:44,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:09:45,026 INFO L290 TraceCheckUtils]: 130: Hoare triple {111182#false} assume !false; {111182#false} is VALID [2022-04-15 09:09:45,026 INFO L290 TraceCheckUtils]: 129: Hoare triple {111182#false} assume 0 == ~cond; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 128: Hoare triple {111182#false} ~cond := #in~cond; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L272 TraceCheckUtils]: 127: Hoare triple {111182#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)); {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 126: Hoare triple {111182#false} assume !(#t~post6 < 50);havoc #t~post6; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 125: Hoare triple {111182#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 124: Hoare triple {111182#false} assume !(#t~post8 < 50);havoc #t~post8; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 123: Hoare triple {111182#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 122: Hoare triple {111615#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {111182#false} is VALID [2022-04-15 09:09:45,027 INFO L290 TraceCheckUtils]: 121: Hoare triple {111619#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111615#(< |main_#t~post7| 50)} is VALID [2022-04-15 09:09:45,028 INFO L290 TraceCheckUtils]: 120: Hoare triple {111619#(< ~counter~0 50)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111619#(< ~counter~0 50)} is VALID [2022-04-15 09:09:45,028 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111181#true} {111619#(< ~counter~0 50)} #96#return; {111619#(< ~counter~0 50)} is VALID [2022-04-15 09:09:45,028 INFO L290 TraceCheckUtils]: 118: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,028 INFO L290 TraceCheckUtils]: 117: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,028 INFO L290 TraceCheckUtils]: 116: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,028 INFO L272 TraceCheckUtils]: 115: Hoare triple {111619#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,028 INFO L290 TraceCheckUtils]: 114: Hoare triple {111619#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {111619#(< ~counter~0 50)} is VALID [2022-04-15 09:09:45,031 INFO L290 TraceCheckUtils]: 113: Hoare triple {111644#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111619#(< ~counter~0 50)} is VALID [2022-04-15 09:09:45,031 INFO L290 TraceCheckUtils]: 112: Hoare triple {111644#(< ~counter~0 49)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111644#(< ~counter~0 49)} is VALID [2022-04-15 09:09:45,031 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {111181#true} {111644#(< ~counter~0 49)} #96#return; {111644#(< ~counter~0 49)} is VALID [2022-04-15 09:09:45,031 INFO L290 TraceCheckUtils]: 110: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,031 INFO L290 TraceCheckUtils]: 109: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,031 INFO L272 TraceCheckUtils]: 107: Hoare triple {111644#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,032 INFO L290 TraceCheckUtils]: 106: Hoare triple {111644#(< ~counter~0 49)} assume !!(#t~post7 < 50);havoc #t~post7; {111644#(< ~counter~0 49)} is VALID [2022-04-15 09:09:45,032 INFO L290 TraceCheckUtils]: 105: Hoare triple {111669#(< ~counter~0 48)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111644#(< ~counter~0 49)} is VALID [2022-04-15 09:09:45,033 INFO L290 TraceCheckUtils]: 104: Hoare triple {111669#(< ~counter~0 48)} assume !!(0 != ~r~0); {111669#(< ~counter~0 48)} is VALID [2022-04-15 09:09:45,033 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {111181#true} {111669#(< ~counter~0 48)} #94#return; {111669#(< ~counter~0 48)} is VALID [2022-04-15 09:09:45,033 INFO L290 TraceCheckUtils]: 102: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,033 INFO L290 TraceCheckUtils]: 101: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,033 INFO L290 TraceCheckUtils]: 100: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,033 INFO L272 TraceCheckUtils]: 99: Hoare triple {111669#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,033 INFO L290 TraceCheckUtils]: 98: Hoare triple {111669#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {111669#(< ~counter~0 48)} is VALID [2022-04-15 09:09:45,034 INFO L290 TraceCheckUtils]: 97: Hoare triple {111694#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111669#(< ~counter~0 48)} is VALID [2022-04-15 09:09:45,035 INFO L290 TraceCheckUtils]: 96: Hoare triple {111694#(< ~counter~0 47)} assume !(~r~0 < 0); {111694#(< ~counter~0 47)} is VALID [2022-04-15 09:09:45,035 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {111181#true} {111694#(< ~counter~0 47)} #98#return; {111694#(< ~counter~0 47)} is VALID [2022-04-15 09:09:45,035 INFO L290 TraceCheckUtils]: 94: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,035 INFO L290 TraceCheckUtils]: 92: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,035 INFO L272 TraceCheckUtils]: 91: Hoare triple {111694#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,035 INFO L290 TraceCheckUtils]: 90: Hoare triple {111694#(< ~counter~0 47)} assume !!(#t~post8 < 50);havoc #t~post8; {111694#(< ~counter~0 47)} is VALID [2022-04-15 09:09:45,036 INFO L290 TraceCheckUtils]: 89: Hoare triple {111719#(< ~counter~0 46)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111694#(< ~counter~0 47)} is VALID [2022-04-15 09:09:45,036 INFO L290 TraceCheckUtils]: 88: Hoare triple {111719#(< ~counter~0 46)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111719#(< ~counter~0 46)} is VALID [2022-04-15 09:09:45,037 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {111181#true} {111719#(< ~counter~0 46)} #98#return; {111719#(< ~counter~0 46)} is VALID [2022-04-15 09:09:45,037 INFO L290 TraceCheckUtils]: 86: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,037 INFO L290 TraceCheckUtils]: 85: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,037 INFO L272 TraceCheckUtils]: 83: Hoare triple {111719#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {111719#(< ~counter~0 46)} assume !!(#t~post8 < 50);havoc #t~post8; {111719#(< ~counter~0 46)} is VALID [2022-04-15 09:09:45,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {111744#(< ~counter~0 45)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111719#(< ~counter~0 46)} is VALID [2022-04-15 09:09:45,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {111744#(< ~counter~0 45)} assume !(~r~0 > 0); {111744#(< ~counter~0 45)} is VALID [2022-04-15 09:09:45,039 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111181#true} {111744#(< ~counter~0 45)} #96#return; {111744#(< ~counter~0 45)} is VALID [2022-04-15 09:09:45,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,039 INFO L272 TraceCheckUtils]: 75: Hoare triple {111744#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {111744#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {111744#(< ~counter~0 45)} is VALID [2022-04-15 09:09:45,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {111769#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111744#(< ~counter~0 45)} is VALID [2022-04-15 09:09:45,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {111769#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111769#(< ~counter~0 44)} is VALID [2022-04-15 09:09:45,041 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {111181#true} {111769#(< ~counter~0 44)} #96#return; {111769#(< ~counter~0 44)} is VALID [2022-04-15 09:09:45,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,041 INFO L272 TraceCheckUtils]: 67: Hoare triple {111769#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {111769#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {111769#(< ~counter~0 44)} is VALID [2022-04-15 09:09:45,042 INFO L290 TraceCheckUtils]: 65: Hoare triple {111794#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111769#(< ~counter~0 44)} is VALID [2022-04-15 09:09:45,042 INFO L290 TraceCheckUtils]: 64: Hoare triple {111794#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111794#(< ~counter~0 43)} is VALID [2022-04-15 09:09:45,043 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {111181#true} {111794#(< ~counter~0 43)} #96#return; {111794#(< ~counter~0 43)} is VALID [2022-04-15 09:09:45,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,043 INFO L272 TraceCheckUtils]: 59: Hoare triple {111794#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {111794#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {111794#(< ~counter~0 43)} is VALID [2022-04-15 09:09:45,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {111819#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111794#(< ~counter~0 43)} is VALID [2022-04-15 09:09:45,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {111819#(< ~counter~0 42)} assume !!(0 != ~r~0); {111819#(< ~counter~0 42)} is VALID [2022-04-15 09:09:45,044 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {111181#true} {111819#(< ~counter~0 42)} #94#return; {111819#(< ~counter~0 42)} is VALID [2022-04-15 09:09:45,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,045 INFO L272 TraceCheckUtils]: 51: Hoare triple {111819#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {111819#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {111819#(< ~counter~0 42)} is VALID [2022-04-15 09:09:45,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {111844#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111819#(< ~counter~0 42)} is VALID [2022-04-15 09:09:45,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {111844#(< ~counter~0 41)} assume !(~r~0 < 0); {111844#(< ~counter~0 41)} is VALID [2022-04-15 09:09:45,046 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {111181#true} {111844#(< ~counter~0 41)} #98#return; {111844#(< ~counter~0 41)} is VALID [2022-04-15 09:09:45,046 INFO L290 TraceCheckUtils]: 46: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,047 INFO L272 TraceCheckUtils]: 43: Hoare triple {111844#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,047 INFO L290 TraceCheckUtils]: 42: Hoare triple {111844#(< ~counter~0 41)} assume !!(#t~post8 < 50);havoc #t~post8; {111844#(< ~counter~0 41)} is VALID [2022-04-15 09:09:45,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {111869#(< ~counter~0 40)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111844#(< ~counter~0 41)} is VALID [2022-04-15 09:09:45,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {111869#(< ~counter~0 40)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111869#(< ~counter~0 40)} is VALID [2022-04-15 09:09:45,048 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {111181#true} {111869#(< ~counter~0 40)} #98#return; {111869#(< ~counter~0 40)} is VALID [2022-04-15 09:09:45,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,048 INFO L290 TraceCheckUtils]: 37: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,048 INFO L272 TraceCheckUtils]: 35: Hoare triple {111869#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {111869#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {111869#(< ~counter~0 40)} is VALID [2022-04-15 09:09:45,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {111894#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111869#(< ~counter~0 40)} is VALID [2022-04-15 09:09:45,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {111894#(< ~counter~0 39)} assume !(~r~0 > 0); {111894#(< ~counter~0 39)} is VALID [2022-04-15 09:09:45,050 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {111181#true} {111894#(< ~counter~0 39)} #96#return; {111894#(< ~counter~0 39)} is VALID [2022-04-15 09:09:45,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,050 INFO L272 TraceCheckUtils]: 27: Hoare triple {111894#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {111894#(< ~counter~0 39)} assume !!(#t~post7 < 50);havoc #t~post7; {111894#(< ~counter~0 39)} is VALID [2022-04-15 09:09:45,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {111919#(< ~counter~0 38)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111894#(< ~counter~0 39)} is VALID [2022-04-15 09:09:45,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {111919#(< ~counter~0 38)} assume !!(0 != ~r~0); {111919#(< ~counter~0 38)} is VALID [2022-04-15 09:09:45,052 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111181#true} {111919#(< ~counter~0 38)} #94#return; {111919#(< ~counter~0 38)} is VALID [2022-04-15 09:09:45,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,052 INFO L272 TraceCheckUtils]: 19: Hoare triple {111919#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {111919#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {111919#(< ~counter~0 38)} is VALID [2022-04-15 09:09:45,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {111944#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111919#(< ~counter~0 38)} is VALID [2022-04-15 09:09:45,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {111944#(< ~counter~0 37)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,054 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {111181#true} {111944#(< ~counter~0 37)} #92#return; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {111944#(< ~counter~0 37)} 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)); {111181#true} is VALID [2022-04-15 09:09:45,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {111181#true} {111944#(< ~counter~0 37)} #90#return; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {111181#true} assume true; {111181#true} is VALID [2022-04-15 09:09:45,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {111181#true} assume !(0 == ~cond); {111181#true} is VALID [2022-04-15 09:09:45,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {111181#true} ~cond := #in~cond; {111181#true} is VALID [2022-04-15 09:09:45,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {111944#(< ~counter~0 37)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {111181#true} is VALID [2022-04-15 09:09:45,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {111944#(< ~counter~0 37)} 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; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {111944#(< ~counter~0 37)} call #t~ret9 := main(); {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111944#(< ~counter~0 37)} {111181#true} #102#return; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {111944#(< ~counter~0 37)} assume true; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {111181#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; {111944#(< ~counter~0 37)} is VALID [2022-04-15 09:09:45,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {111181#true} call ULTIMATE.init(); {111181#true} is VALID [2022-04-15 09:09:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 09:09:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511349751] [2022-04-15 09:09:45,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:09:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086615487] [2022-04-15 09:09:45,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086615487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:09:45,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:09:45,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 09:09:45,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [356392333] [2022-04-15 09:09:45,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [356392333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:45,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:45,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 09:09:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897425414] [2022-04-15 09:09:45,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:45,058 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-15 09:09:45,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:45,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:45,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:45,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 09:09:45,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 09:09:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 09:09:45,147 INFO L87 Difference]: Start difference. First operand 738 states and 972 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:47,449 INFO L93 Difference]: Finished difference Result 955 states and 1299 transitions. [2022-04-15 09:09:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 09:09:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 131 [2022-04-15 09:09:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 09:09:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 09:09:47,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-15 09:09:47,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:47,751 INFO L225 Difference]: With dead ends: 955 [2022-04-15 09:09:47,752 INFO L226 Difference]: Without dead ends: 754 [2022-04-15 09:09:47,753 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=800, Invalid=1092, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 09:09:47,753 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 170 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:09:47,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 332 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:09:47,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-04-15 09:09:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-04-15 09:09:50,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:50,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 754 states. Second operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:50,107 INFO L74 IsIncluded]: Start isIncluded. First operand 754 states. Second operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:50,107 INFO L87 Difference]: Start difference. First operand 754 states. Second operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:50,125 INFO L93 Difference]: Finished difference Result 754 states and 988 transitions. [2022-04-15 09:09:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 988 transitions. [2022-04-15 09:09:50,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:50,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:50,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 754 states. [2022-04-15 09:09:50,127 INFO L87 Difference]: Start difference. First operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 754 states. [2022-04-15 09:09:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:50,157 INFO L93 Difference]: Finished difference Result 754 states and 988 transitions. [2022-04-15 09:09:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 988 transitions. [2022-04-15 09:09:50,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:50,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:50,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:50,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 572 states have (on average 1.1958041958041958) internal successors, (684), 572 states have internal predecessors, (684), 153 states have call successors, (153), 30 states have call predecessors, (153), 28 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 09:09:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 988 transitions. [2022-04-15 09:09:50,183 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 988 transitions. Word has length 131 [2022-04-15 09:09:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:50,183 INFO L478 AbstractCegarLoop]: Abstraction has 754 states and 988 transitions. [2022-04-15 09:09:50,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 16 states have call successors, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-15 09:09:50,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 754 states and 988 transitions. [2022-04-15 09:10:07,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 988 edges. 985 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 988 transitions. [2022-04-15 09:10:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 09:10:07,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:07,958 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:07,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 09:10:08,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:08,159 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:08,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-15 09:10:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:08,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [970386377] [2022-04-15 09:10:08,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:10:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-15 09:10:08,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:08,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16005735] [2022-04-15 09:10:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:08,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:08,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:08,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775854079] [2022-04-15 09:10:08,172 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:10:08,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:08,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:08,175 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:10:08,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 09:10:08,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 09:10:08,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:08,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 09:10:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:08,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:08,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {116948#true} call ULTIMATE.init(); {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {116948#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; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116948#true} {116948#true} #102#return; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {116948#true} call #t~ret9 := main(); {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {116948#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; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {116948#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {116948#true} {116948#true} #90#return; {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L272 TraceCheckUtils]: 11: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {116948#true} {116948#true} #92#return; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {116948#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {116948#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {116948#true} assume !!(#t~post6 < 50);havoc #t~post6; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {116948#true} {116948#true} #94#return; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {116948#true} assume !!(0 != ~r~0); {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {116948#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {116948#true} assume !!(#t~post7 < 50);havoc #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L272 TraceCheckUtils]: 27: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {116948#true} {116948#true} #96#return; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {116948#true} assume !(~r~0 > 0); {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {116948#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {116948#true} assume !!(#t~post8 < 50);havoc #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L272 TraceCheckUtils]: 35: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {116948#true} {116948#true} #98#return; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {116948#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 41: Hoare triple {116948#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L290 TraceCheckUtils]: 42: Hoare triple {116948#true} assume !!(#t~post8 < 50);havoc #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,834 INFO L272 TraceCheckUtils]: 43: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 44: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 45: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {116948#true} {116948#true} #98#return; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {116948#true} assume !(~r~0 < 0); {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {116948#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {116948#true} assume !!(#t~post6 < 50);havoc #t~post6; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L272 TraceCheckUtils]: 51: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {116948#true} {116948#true} #94#return; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {116948#true} assume !!(0 != ~r~0); {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {116948#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {116948#true} assume !!(#t~post7 < 50);havoc #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L272 TraceCheckUtils]: 59: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {116948#true} {116948#true} #96#return; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {116948#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 65: Hoare triple {116948#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 66: Hoare triple {116948#true} assume !!(#t~post7 < 50);havoc #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L272 TraceCheckUtils]: 67: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {116948#true} {116948#true} #96#return; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 72: Hoare triple {116948#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116948#true} is VALID [2022-04-15 09:10:08,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {116948#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 74: Hoare triple {116948#true} assume !!(#t~post7 < 50);havoc #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L272 TraceCheckUtils]: 75: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 76: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 78: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {116948#true} {116948#true} #96#return; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 80: Hoare triple {116948#true} assume !(~r~0 > 0); {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 81: Hoare triple {116948#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 82: Hoare triple {116948#true} assume !!(#t~post8 < 50);havoc #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L272 TraceCheckUtils]: 83: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {116948#true} {116948#true} #98#return; {116948#true} is VALID [2022-04-15 09:10:08,837 INFO L290 TraceCheckUtils]: 88: Hoare triple {116948#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {116948#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 90: Hoare triple {116948#true} assume !!(#t~post8 < 50);havoc #t~post8; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L272 TraceCheckUtils]: 91: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 93: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 94: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {116948#true} {116948#true} #98#return; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 96: Hoare triple {116948#true} assume !(~r~0 < 0); {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 97: Hoare triple {116948#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 98: Hoare triple {116948#true} assume !!(#t~post6 < 50);havoc #t~post6; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L272 TraceCheckUtils]: 99: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 100: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 101: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L290 TraceCheckUtils]: 102: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,838 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {116948#true} {116948#true} #94#return; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 104: Hoare triple {116948#true} assume !!(0 != ~r~0); {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 105: Hoare triple {116948#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 106: Hoare triple {116948#true} assume !!(#t~post7 < 50);havoc #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L272 TraceCheckUtils]: 107: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 108: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 109: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 110: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {116948#true} {116948#true} #96#return; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 112: Hoare triple {116948#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 113: Hoare triple {116948#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 114: Hoare triple {116948#true} assume !!(#t~post7 < 50);havoc #t~post7; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L272 TraceCheckUtils]: 115: Hoare triple {116948#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)); {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 116: Hoare triple {116948#true} ~cond := #in~cond; {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 117: Hoare triple {116948#true} assume !(0 == ~cond); {116948#true} is VALID [2022-04-15 09:10:08,839 INFO L290 TraceCheckUtils]: 118: Hoare triple {116948#true} assume true; {116948#true} is VALID [2022-04-15 09:10:08,840 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {116948#true} {116948#true} #96#return; {116948#true} is VALID [2022-04-15 09:10:08,840 INFO L290 TraceCheckUtils]: 120: Hoare triple {116948#true} assume !(~r~0 > 0); {117313#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:10:08,840 INFO L290 TraceCheckUtils]: 121: Hoare triple {117313#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {117313#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:10:08,840 INFO L290 TraceCheckUtils]: 122: Hoare triple {117313#(not (< 0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {117313#(not (< 0 main_~r~0))} is VALID [2022-04-15 09:10:08,840 INFO L272 TraceCheckUtils]: 123: Hoare triple {117313#(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)); {116948#true} is VALID [2022-04-15 09:10:08,841 INFO L290 TraceCheckUtils]: 124: Hoare triple {116948#true} ~cond := #in~cond; {117326#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:08,841 INFO L290 TraceCheckUtils]: 125: Hoare triple {117326#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {117330#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:08,841 INFO L290 TraceCheckUtils]: 126: Hoare triple {117330#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {117330#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:08,842 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {117330#(not (= |__VERIFIER_assert_#in~cond| 0))} {117313#(not (< 0 main_~r~0))} #98#return; {117337#(and (= (+ (* 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))) (not (< 0 main_~r~0)))} is VALID [2022-04-15 09:10:08,844 INFO L290 TraceCheckUtils]: 128: Hoare triple {117337#(and (= (+ (* 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))) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {117341#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 09:10:08,845 INFO L290 TraceCheckUtils]: 129: Hoare triple {117341#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {117341#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 09:10:08,845 INFO L290 TraceCheckUtils]: 130: Hoare triple {117341#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} assume !(#t~post6 < 50);havoc #t~post6; {117341#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 09:10:08,846 INFO L272 TraceCheckUtils]: 131: Hoare triple {117341#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 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)); {117351#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:10:08,846 INFO L290 TraceCheckUtils]: 132: Hoare triple {117351#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {117355#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:08,847 INFO L290 TraceCheckUtils]: 133: Hoare triple {117355#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {116949#false} is VALID [2022-04-15 09:10:08,847 INFO L290 TraceCheckUtils]: 134: Hoare triple {116949#false} assume !false; {116949#false} is VALID [2022-04-15 09:10:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 09:10:08,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:10:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:11,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16005735] [2022-04-15 09:10:11,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:11,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775854079] [2022-04-15 09:10:11,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775854079] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 09:10:11,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:10:11,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 09:10:11,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:11,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [970386377] [2022-04-15 09:10:11,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [970386377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:11,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:11,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:10:11,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897087601] [2022-04-15 09:10:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:11,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-15 09:10:11,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:11,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 09:10:11,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:11,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:10:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:10:11,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-15 09:10:11,383 INFO L87 Difference]: Start difference. First operand 754 states and 988 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 09:10:13,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 09:10:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:16,035 INFO L93 Difference]: Finished difference Result 810 states and 1067 transitions. [2022-04-15 09:10:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:10:16,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-15 09:10:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 09:10:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 09:10:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 09:10:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 09:10:16,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-15 09:10:16,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:16,138 INFO L225 Difference]: With dead ends: 810 [2022-04-15 09:10:16,138 INFO L226 Difference]: Without dead ends: 798 [2022-04-15 09:10:16,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-15 09:10:16,139 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:16,139 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 09:10:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-04-15 09:10:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 735. [2022-04-15 09:10:17,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:17,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 798 states. Second operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 09:10:17,663 INFO L74 IsIncluded]: Start isIncluded. First operand 798 states. Second operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 09:10:17,664 INFO L87 Difference]: Start difference. First operand 798 states. Second operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 09:10:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,686 INFO L93 Difference]: Finished difference Result 798 states and 1049 transitions. [2022-04-15 09:10:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1049 transitions. [2022-04-15 09:10:17,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:17,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:17,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 798 states. [2022-04-15 09:10:17,688 INFO L87 Difference]: Start difference. First operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 798 states. [2022-04-15 09:10:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,711 INFO L93 Difference]: Finished difference Result 798 states and 1049 transitions. [2022-04-15 09:10:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1049 transitions. [2022-04-15 09:10:17,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:17,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:17,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:17,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 554 states have (on average 1.1787003610108304) internal successors, (653), 561 states have internal predecessors, (653), 150 states have call successors, (150), 32 states have call predecessors, (150), 30 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 09:10:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 951 transitions. [2022-04-15 09:10:17,736 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 951 transitions. Word has length 135 [2022-04-15 09:10:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:17,736 INFO L478 AbstractCegarLoop]: Abstraction has 735 states and 951 transitions. [2022-04-15 09:10:17,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 09:10:17,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 735 states and 951 transitions. [2022-04-15 09:10:37,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 947 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 951 transitions. [2022-04-15 09:10:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 09:10:37,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:37,341 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 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] [2022-04-15 09:10:37,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-15 09:10:37,541 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 09:10:37,541 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-15 09:10:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:37,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338234373] [2022-04-15 09:10:37,542 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:10:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-15 09:10:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:37,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493232050] [2022-04-15 09:10:37,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:37,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:37,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:37,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547690530] [2022-04-15 09:10:37,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:10:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:37,559 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:10:37,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 09:10:37,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:10:37,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:37,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 09:10:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:37,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:38,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {122080#true} call ULTIMATE.init(); {122080#true} is VALID [2022-04-15 09:10:38,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {122080#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; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {122088#(<= ~counter~0 0)} assume true; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122088#(<= ~counter~0 0)} {122080#true} #102#return; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {122088#(<= ~counter~0 0)} call #t~ret9 := main(); {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {122088#(<= ~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; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {122088#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {122088#(<= ~counter~0 0)} ~cond := #in~cond; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {122088#(<= ~counter~0 0)} assume !(0 == ~cond); {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {122088#(<= ~counter~0 0)} assume true; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {122088#(<= ~counter~0 0)} {122088#(<= ~counter~0 0)} #90#return; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,359 INFO L272 TraceCheckUtils]: 11: Hoare triple {122088#(<= ~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)); {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {122088#(<= ~counter~0 0)} ~cond := #in~cond; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {122088#(<= ~counter~0 0)} assume !(0 == ~cond); {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {122088#(<= ~counter~0 0)} assume true; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,361 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {122088#(<= ~counter~0 0)} {122088#(<= ~counter~0 0)} #92#return; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {122088#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122088#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:38,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {122088#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {122137#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {122137#(<= ~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)); {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {122137#(<= ~counter~0 1)} ~cond := #in~cond; {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {122137#(<= ~counter~0 1)} assume !(0 == ~cond); {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {122137#(<= ~counter~0 1)} assume true; {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,365 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {122137#(<= ~counter~0 1)} {122137#(<= ~counter~0 1)} #94#return; {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {122137#(<= ~counter~0 1)} assume !!(0 != ~r~0); {122137#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:38,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {122137#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {122162#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,367 INFO L272 TraceCheckUtils]: 27: Hoare triple {122162#(<= ~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)); {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {122162#(<= ~counter~0 2)} ~cond := #in~cond; {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {122162#(<= ~counter~0 2)} assume !(0 == ~cond); {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {122162#(<= ~counter~0 2)} assume true; {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,368 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {122162#(<= ~counter~0 2)} {122162#(<= ~counter~0 2)} #96#return; {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {122162#(<= ~counter~0 2)} assume !(~r~0 > 0); {122162#(<= ~counter~0 2)} is VALID [2022-04-15 09:10:38,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {122162#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {122187#(<= ~counter~0 3)} assume !!(#t~post8 < 50);havoc #t~post8; {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,370 INFO L272 TraceCheckUtils]: 35: Hoare triple {122187#(<= ~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)); {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {122187#(<= ~counter~0 3)} ~cond := #in~cond; {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {122187#(<= ~counter~0 3)} assume !(0 == ~cond); {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {122187#(<= ~counter~0 3)} assume true; {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,372 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {122187#(<= ~counter~0 3)} {122187#(<= ~counter~0 3)} #98#return; {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {122187#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122187#(<= ~counter~0 3)} is VALID [2022-04-15 09:10:38,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {122187#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {122212#(<= ~counter~0 4)} assume !!(#t~post8 < 50);havoc #t~post8; {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,374 INFO L272 TraceCheckUtils]: 43: Hoare triple {122212#(<= ~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)); {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {122212#(<= ~counter~0 4)} ~cond := #in~cond; {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {122212#(<= ~counter~0 4)} assume !(0 == ~cond); {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {122212#(<= ~counter~0 4)} assume true; {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,375 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {122212#(<= ~counter~0 4)} {122212#(<= ~counter~0 4)} #98#return; {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {122212#(<= ~counter~0 4)} assume !(~r~0 < 0); {122212#(<= ~counter~0 4)} is VALID [2022-04-15 09:10:38,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {122212#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {122237#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,377 INFO L272 TraceCheckUtils]: 51: Hoare triple {122237#(<= ~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)); {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {122237#(<= ~counter~0 5)} ~cond := #in~cond; {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {122237#(<= ~counter~0 5)} assume !(0 == ~cond); {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {122237#(<= ~counter~0 5)} assume true; {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,378 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {122237#(<= ~counter~0 5)} {122237#(<= ~counter~0 5)} #94#return; {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {122237#(<= ~counter~0 5)} assume !!(0 != ~r~0); {122237#(<= ~counter~0 5)} is VALID [2022-04-15 09:10:38,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {122237#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {122262#(<= ~counter~0 6)} assume !!(#t~post7 < 50);havoc #t~post7; {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,380 INFO L272 TraceCheckUtils]: 59: Hoare triple {122262#(<= ~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)); {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {122262#(<= ~counter~0 6)} ~cond := #in~cond; {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {122262#(<= ~counter~0 6)} assume !(0 == ~cond); {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {122262#(<= ~counter~0 6)} assume true; {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,382 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {122262#(<= ~counter~0 6)} {122262#(<= ~counter~0 6)} #96#return; {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {122262#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122262#(<= ~counter~0 6)} is VALID [2022-04-15 09:10:38,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {122262#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {122287#(<= ~counter~0 7)} assume !!(#t~post7 < 50);havoc #t~post7; {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,384 INFO L272 TraceCheckUtils]: 67: Hoare triple {122287#(<= ~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)); {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {122287#(<= ~counter~0 7)} ~cond := #in~cond; {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {122287#(<= ~counter~0 7)} assume !(0 == ~cond); {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {122287#(<= ~counter~0 7)} assume true; {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,385 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {122287#(<= ~counter~0 7)} {122287#(<= ~counter~0 7)} #96#return; {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {122287#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122287#(<= ~counter~0 7)} is VALID [2022-04-15 09:10:38,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {122287#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {122312#(<= ~counter~0 8)} assume !!(#t~post7 < 50);havoc #t~post7; {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,387 INFO L272 TraceCheckUtils]: 75: Hoare triple {122312#(<= ~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)); {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {122312#(<= ~counter~0 8)} ~cond := #in~cond; {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {122312#(<= ~counter~0 8)} assume !(0 == ~cond); {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {122312#(<= ~counter~0 8)} assume true; {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,388 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {122312#(<= ~counter~0 8)} {122312#(<= ~counter~0 8)} #96#return; {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {122312#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122312#(<= ~counter~0 8)} is VALID [2022-04-15 09:10:38,390 INFO L290 TraceCheckUtils]: 81: Hoare triple {122312#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,390 INFO L290 TraceCheckUtils]: 82: Hoare triple {122337#(<= ~counter~0 9)} assume !!(#t~post7 < 50);havoc #t~post7; {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,390 INFO L272 TraceCheckUtils]: 83: Hoare triple {122337#(<= ~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)); {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,391 INFO L290 TraceCheckUtils]: 84: Hoare triple {122337#(<= ~counter~0 9)} ~cond := #in~cond; {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,391 INFO L290 TraceCheckUtils]: 85: Hoare triple {122337#(<= ~counter~0 9)} assume !(0 == ~cond); {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,391 INFO L290 TraceCheckUtils]: 86: Hoare triple {122337#(<= ~counter~0 9)} assume true; {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,392 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {122337#(<= ~counter~0 9)} {122337#(<= ~counter~0 9)} #96#return; {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {122337#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122337#(<= ~counter~0 9)} is VALID [2022-04-15 09:10:38,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {122337#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,393 INFO L290 TraceCheckUtils]: 90: Hoare triple {122362#(<= ~counter~0 10)} assume !!(#t~post7 < 50);havoc #t~post7; {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,394 INFO L272 TraceCheckUtils]: 91: Hoare triple {122362#(<= ~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)); {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,394 INFO L290 TraceCheckUtils]: 92: Hoare triple {122362#(<= ~counter~0 10)} ~cond := #in~cond; {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,394 INFO L290 TraceCheckUtils]: 93: Hoare triple {122362#(<= ~counter~0 10)} assume !(0 == ~cond); {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,395 INFO L290 TraceCheckUtils]: 94: Hoare triple {122362#(<= ~counter~0 10)} assume true; {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,395 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {122362#(<= ~counter~0 10)} {122362#(<= ~counter~0 10)} #96#return; {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,395 INFO L290 TraceCheckUtils]: 96: Hoare triple {122362#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122362#(<= ~counter~0 10)} is VALID [2022-04-15 09:10:38,396 INFO L290 TraceCheckUtils]: 97: Hoare triple {122362#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,397 INFO L290 TraceCheckUtils]: 98: Hoare triple {122387#(<= ~counter~0 11)} assume !!(#t~post7 < 50);havoc #t~post7; {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,397 INFO L272 TraceCheckUtils]: 99: Hoare triple {122387#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,397 INFO L290 TraceCheckUtils]: 100: Hoare triple {122387#(<= ~counter~0 11)} ~cond := #in~cond; {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,398 INFO L290 TraceCheckUtils]: 101: Hoare triple {122387#(<= ~counter~0 11)} assume !(0 == ~cond); {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,398 INFO L290 TraceCheckUtils]: 102: Hoare triple {122387#(<= ~counter~0 11)} assume true; {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,398 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {122387#(<= ~counter~0 11)} {122387#(<= ~counter~0 11)} #96#return; {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,399 INFO L290 TraceCheckUtils]: 104: Hoare triple {122387#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122387#(<= ~counter~0 11)} is VALID [2022-04-15 09:10:38,400 INFO L290 TraceCheckUtils]: 105: Hoare triple {122387#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,400 INFO L290 TraceCheckUtils]: 106: Hoare triple {122412#(<= ~counter~0 12)} assume !!(#t~post7 < 50);havoc #t~post7; {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,400 INFO L272 TraceCheckUtils]: 107: Hoare triple {122412#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,401 INFO L290 TraceCheckUtils]: 108: Hoare triple {122412#(<= ~counter~0 12)} ~cond := #in~cond; {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,401 INFO L290 TraceCheckUtils]: 109: Hoare triple {122412#(<= ~counter~0 12)} assume !(0 == ~cond); {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,401 INFO L290 TraceCheckUtils]: 110: Hoare triple {122412#(<= ~counter~0 12)} assume true; {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,402 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {122412#(<= ~counter~0 12)} {122412#(<= ~counter~0 12)} #96#return; {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,402 INFO L290 TraceCheckUtils]: 112: Hoare triple {122412#(<= ~counter~0 12)} assume !(~r~0 > 0); {122412#(<= ~counter~0 12)} is VALID [2022-04-15 09:10:38,403 INFO L290 TraceCheckUtils]: 113: Hoare triple {122412#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,403 INFO L290 TraceCheckUtils]: 114: Hoare triple {122437#(<= ~counter~0 13)} assume !!(#t~post8 < 50);havoc #t~post8; {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,404 INFO L272 TraceCheckUtils]: 115: Hoare triple {122437#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,404 INFO L290 TraceCheckUtils]: 116: Hoare triple {122437#(<= ~counter~0 13)} ~cond := #in~cond; {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,404 INFO L290 TraceCheckUtils]: 117: Hoare triple {122437#(<= ~counter~0 13)} assume !(0 == ~cond); {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,404 INFO L290 TraceCheckUtils]: 118: Hoare triple {122437#(<= ~counter~0 13)} assume true; {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,405 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {122437#(<= ~counter~0 13)} {122437#(<= ~counter~0 13)} #98#return; {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,405 INFO L290 TraceCheckUtils]: 120: Hoare triple {122437#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122437#(<= ~counter~0 13)} is VALID [2022-04-15 09:10:38,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {122437#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,406 INFO L290 TraceCheckUtils]: 122: Hoare triple {122462#(<= ~counter~0 14)} assume !!(#t~post8 < 50);havoc #t~post8; {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,407 INFO L272 TraceCheckUtils]: 123: Hoare triple {122462#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,407 INFO L290 TraceCheckUtils]: 124: Hoare triple {122462#(<= ~counter~0 14)} ~cond := #in~cond; {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,408 INFO L290 TraceCheckUtils]: 125: Hoare triple {122462#(<= ~counter~0 14)} assume !(0 == ~cond); {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,408 INFO L290 TraceCheckUtils]: 126: Hoare triple {122462#(<= ~counter~0 14)} assume true; {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,408 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {122462#(<= ~counter~0 14)} {122462#(<= ~counter~0 14)} #98#return; {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {122462#(<= ~counter~0 14)} assume !(~r~0 < 0); {122462#(<= ~counter~0 14)} is VALID [2022-04-15 09:10:38,409 INFO L290 TraceCheckUtils]: 129: Hoare triple {122462#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122487#(<= |main_#t~post6| 14)} is VALID [2022-04-15 09:10:38,409 INFO L290 TraceCheckUtils]: 130: Hoare triple {122487#(<= |main_#t~post6| 14)} assume !(#t~post6 < 50);havoc #t~post6; {122081#false} is VALID [2022-04-15 09:10:38,409 INFO L272 TraceCheckUtils]: 131: Hoare triple {122081#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)); {122081#false} is VALID [2022-04-15 09:10:38,409 INFO L290 TraceCheckUtils]: 132: Hoare triple {122081#false} ~cond := #in~cond; {122081#false} is VALID [2022-04-15 09:10:38,409 INFO L290 TraceCheckUtils]: 133: Hoare triple {122081#false} assume 0 == ~cond; {122081#false} is VALID [2022-04-15 09:10:38,409 INFO L290 TraceCheckUtils]: 134: Hoare triple {122081#false} assume !false; {122081#false} is VALID [2022-04-15 09:10:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:10:38,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:10:39,148 INFO L290 TraceCheckUtils]: 134: Hoare triple {122081#false} assume !false; {122081#false} is VALID [2022-04-15 09:10:39,148 INFO L290 TraceCheckUtils]: 133: Hoare triple {122081#false} assume 0 == ~cond; {122081#false} is VALID [2022-04-15 09:10:39,148 INFO L290 TraceCheckUtils]: 132: Hoare triple {122081#false} ~cond := #in~cond; {122081#false} is VALID [2022-04-15 09:10:39,148 INFO L272 TraceCheckUtils]: 131: Hoare triple {122081#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)); {122081#false} is VALID [2022-04-15 09:10:39,148 INFO L290 TraceCheckUtils]: 130: Hoare triple {122515#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {122081#false} is VALID [2022-04-15 09:10:39,148 INFO L290 TraceCheckUtils]: 129: Hoare triple {122519#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122515#(< |main_#t~post6| 50)} is VALID [2022-04-15 09:10:39,149 INFO L290 TraceCheckUtils]: 128: Hoare triple {122519#(< ~counter~0 50)} assume !(~r~0 < 0); {122519#(< ~counter~0 50)} is VALID [2022-04-15 09:10:39,149 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {122080#true} {122519#(< ~counter~0 50)} #98#return; {122519#(< ~counter~0 50)} is VALID [2022-04-15 09:10:39,149 INFO L290 TraceCheckUtils]: 126: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,149 INFO L290 TraceCheckUtils]: 125: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,149 INFO L290 TraceCheckUtils]: 124: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,149 INFO L272 TraceCheckUtils]: 123: Hoare triple {122519#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,150 INFO L290 TraceCheckUtils]: 122: Hoare triple {122519#(< ~counter~0 50)} assume !!(#t~post8 < 50);havoc #t~post8; {122519#(< ~counter~0 50)} is VALID [2022-04-15 09:10:39,152 INFO L290 TraceCheckUtils]: 121: Hoare triple {122544#(< ~counter~0 49)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122519#(< ~counter~0 50)} is VALID [2022-04-15 09:10:39,152 INFO L290 TraceCheckUtils]: 120: Hoare triple {122544#(< ~counter~0 49)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122544#(< ~counter~0 49)} is VALID [2022-04-15 09:10:39,152 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {122080#true} {122544#(< ~counter~0 49)} #98#return; {122544#(< ~counter~0 49)} is VALID [2022-04-15 09:10:39,153 INFO L290 TraceCheckUtils]: 118: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,153 INFO L290 TraceCheckUtils]: 117: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,153 INFO L290 TraceCheckUtils]: 116: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,153 INFO L272 TraceCheckUtils]: 115: Hoare triple {122544#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,153 INFO L290 TraceCheckUtils]: 114: Hoare triple {122544#(< ~counter~0 49)} assume !!(#t~post8 < 50);havoc #t~post8; {122544#(< ~counter~0 49)} is VALID [2022-04-15 09:10:39,154 INFO L290 TraceCheckUtils]: 113: Hoare triple {122569#(< ~counter~0 48)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122544#(< ~counter~0 49)} is VALID [2022-04-15 09:10:39,154 INFO L290 TraceCheckUtils]: 112: Hoare triple {122569#(< ~counter~0 48)} assume !(~r~0 > 0); {122569#(< ~counter~0 48)} is VALID [2022-04-15 09:10:39,155 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {122080#true} {122569#(< ~counter~0 48)} #96#return; {122569#(< ~counter~0 48)} is VALID [2022-04-15 09:10:39,155 INFO L290 TraceCheckUtils]: 110: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,155 INFO L290 TraceCheckUtils]: 109: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,155 INFO L290 TraceCheckUtils]: 108: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,155 INFO L272 TraceCheckUtils]: 107: Hoare triple {122569#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,155 INFO L290 TraceCheckUtils]: 106: Hoare triple {122569#(< ~counter~0 48)} assume !!(#t~post7 < 50);havoc #t~post7; {122569#(< ~counter~0 48)} is VALID [2022-04-15 09:10:39,156 INFO L290 TraceCheckUtils]: 105: Hoare triple {122594#(< ~counter~0 47)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122569#(< ~counter~0 48)} is VALID [2022-04-15 09:10:39,156 INFO L290 TraceCheckUtils]: 104: Hoare triple {122594#(< ~counter~0 47)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122594#(< ~counter~0 47)} is VALID [2022-04-15 09:10:39,157 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {122080#true} {122594#(< ~counter~0 47)} #96#return; {122594#(< ~counter~0 47)} is VALID [2022-04-15 09:10:39,157 INFO L290 TraceCheckUtils]: 102: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,157 INFO L290 TraceCheckUtils]: 101: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,157 INFO L290 TraceCheckUtils]: 100: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,157 INFO L272 TraceCheckUtils]: 99: Hoare triple {122594#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,157 INFO L290 TraceCheckUtils]: 98: Hoare triple {122594#(< ~counter~0 47)} assume !!(#t~post7 < 50);havoc #t~post7; {122594#(< ~counter~0 47)} is VALID [2022-04-15 09:10:39,158 INFO L290 TraceCheckUtils]: 97: Hoare triple {122619#(< ~counter~0 46)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122594#(< ~counter~0 47)} is VALID [2022-04-15 09:10:39,158 INFO L290 TraceCheckUtils]: 96: Hoare triple {122619#(< ~counter~0 46)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122619#(< ~counter~0 46)} is VALID [2022-04-15 09:10:39,159 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {122080#true} {122619#(< ~counter~0 46)} #96#return; {122619#(< ~counter~0 46)} is VALID [2022-04-15 09:10:39,159 INFO L290 TraceCheckUtils]: 94: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,159 INFO L290 TraceCheckUtils]: 92: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,159 INFO L272 TraceCheckUtils]: 91: Hoare triple {122619#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,159 INFO L290 TraceCheckUtils]: 90: Hoare triple {122619#(< ~counter~0 46)} assume !!(#t~post7 < 50);havoc #t~post7; {122619#(< ~counter~0 46)} is VALID [2022-04-15 09:10:39,160 INFO L290 TraceCheckUtils]: 89: Hoare triple {122644#(< ~counter~0 45)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122619#(< ~counter~0 46)} is VALID [2022-04-15 09:10:39,161 INFO L290 TraceCheckUtils]: 88: Hoare triple {122644#(< ~counter~0 45)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122644#(< ~counter~0 45)} is VALID [2022-04-15 09:10:39,161 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {122080#true} {122644#(< ~counter~0 45)} #96#return; {122644#(< ~counter~0 45)} is VALID [2022-04-15 09:10:39,161 INFO L290 TraceCheckUtils]: 86: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,161 INFO L290 TraceCheckUtils]: 85: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,161 INFO L290 TraceCheckUtils]: 84: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,161 INFO L272 TraceCheckUtils]: 83: Hoare triple {122644#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,161 INFO L290 TraceCheckUtils]: 82: Hoare triple {122644#(< ~counter~0 45)} assume !!(#t~post7 < 50);havoc #t~post7; {122644#(< ~counter~0 45)} is VALID [2022-04-15 09:10:39,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {122669#(< ~counter~0 44)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122644#(< ~counter~0 45)} is VALID [2022-04-15 09:10:39,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {122669#(< ~counter~0 44)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122669#(< ~counter~0 44)} is VALID [2022-04-15 09:10:39,163 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {122080#true} {122669#(< ~counter~0 44)} #96#return; {122669#(< ~counter~0 44)} is VALID [2022-04-15 09:10:39,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,163 INFO L272 TraceCheckUtils]: 75: Hoare triple {122669#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {122669#(< ~counter~0 44)} assume !!(#t~post7 < 50);havoc #t~post7; {122669#(< ~counter~0 44)} is VALID [2022-04-15 09:10:39,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {122694#(< ~counter~0 43)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122669#(< ~counter~0 44)} is VALID [2022-04-15 09:10:39,165 INFO L290 TraceCheckUtils]: 72: Hoare triple {122694#(< ~counter~0 43)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122694#(< ~counter~0 43)} is VALID [2022-04-15 09:10:39,165 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {122080#true} {122694#(< ~counter~0 43)} #96#return; {122694#(< ~counter~0 43)} is VALID [2022-04-15 09:10:39,165 INFO L290 TraceCheckUtils]: 70: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,165 INFO L290 TraceCheckUtils]: 69: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,165 INFO L290 TraceCheckUtils]: 68: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,165 INFO L272 TraceCheckUtils]: 67: Hoare triple {122694#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {122694#(< ~counter~0 43)} assume !!(#t~post7 < 50);havoc #t~post7; {122694#(< ~counter~0 43)} is VALID [2022-04-15 09:10:39,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {122719#(< ~counter~0 42)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122694#(< ~counter~0 43)} is VALID [2022-04-15 09:10:39,167 INFO L290 TraceCheckUtils]: 64: Hoare triple {122719#(< ~counter~0 42)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122719#(< ~counter~0 42)} is VALID [2022-04-15 09:10:39,167 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {122080#true} {122719#(< ~counter~0 42)} #96#return; {122719#(< ~counter~0 42)} is VALID [2022-04-15 09:10:39,167 INFO L290 TraceCheckUtils]: 62: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,168 INFO L272 TraceCheckUtils]: 59: Hoare triple {122719#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,168 INFO L290 TraceCheckUtils]: 58: Hoare triple {122719#(< ~counter~0 42)} assume !!(#t~post7 < 50);havoc #t~post7; {122719#(< ~counter~0 42)} is VALID [2022-04-15 09:10:39,169 INFO L290 TraceCheckUtils]: 57: Hoare triple {122744#(< ~counter~0 41)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122719#(< ~counter~0 42)} is VALID [2022-04-15 09:10:39,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {122744#(< ~counter~0 41)} assume !!(0 != ~r~0); {122744#(< ~counter~0 41)} is VALID [2022-04-15 09:10:39,169 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {122080#true} {122744#(< ~counter~0 41)} #94#return; {122744#(< ~counter~0 41)} is VALID [2022-04-15 09:10:39,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,170 INFO L290 TraceCheckUtils]: 52: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,170 INFO L272 TraceCheckUtils]: 51: Hoare triple {122744#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,170 INFO L290 TraceCheckUtils]: 50: Hoare triple {122744#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {122744#(< ~counter~0 41)} is VALID [2022-04-15 09:10:39,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {122769#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122744#(< ~counter~0 41)} is VALID [2022-04-15 09:10:39,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {122769#(< ~counter~0 40)} assume !(~r~0 < 0); {122769#(< ~counter~0 40)} is VALID [2022-04-15 09:10:39,171 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {122080#true} {122769#(< ~counter~0 40)} #98#return; {122769#(< ~counter~0 40)} is VALID [2022-04-15 09:10:39,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,172 INFO L272 TraceCheckUtils]: 43: Hoare triple {122769#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {122769#(< ~counter~0 40)} assume !!(#t~post8 < 50);havoc #t~post8; {122769#(< ~counter~0 40)} is VALID [2022-04-15 09:10:39,173 INFO L290 TraceCheckUtils]: 41: Hoare triple {122794#(< ~counter~0 39)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122769#(< ~counter~0 40)} is VALID [2022-04-15 09:10:39,173 INFO L290 TraceCheckUtils]: 40: Hoare triple {122794#(< ~counter~0 39)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122794#(< ~counter~0 39)} is VALID [2022-04-15 09:10:39,174 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {122080#true} {122794#(< ~counter~0 39)} #98#return; {122794#(< ~counter~0 39)} is VALID [2022-04-15 09:10:39,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,174 INFO L272 TraceCheckUtils]: 35: Hoare triple {122794#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {122794#(< ~counter~0 39)} assume !!(#t~post8 < 50);havoc #t~post8; {122794#(< ~counter~0 39)} is VALID [2022-04-15 09:10:39,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {122819#(< ~counter~0 38)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122794#(< ~counter~0 39)} is VALID [2022-04-15 09:10:39,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {122819#(< ~counter~0 38)} assume !(~r~0 > 0); {122819#(< ~counter~0 38)} is VALID [2022-04-15 09:10:39,176 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {122080#true} {122819#(< ~counter~0 38)} #96#return; {122819#(< ~counter~0 38)} is VALID [2022-04-15 09:10:39,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,176 INFO L272 TraceCheckUtils]: 27: Hoare triple {122819#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {122819#(< ~counter~0 38)} assume !!(#t~post7 < 50);havoc #t~post7; {122819#(< ~counter~0 38)} is VALID [2022-04-15 09:10:39,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {122844#(< ~counter~0 37)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122819#(< ~counter~0 38)} is VALID [2022-04-15 09:10:39,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {122844#(< ~counter~0 37)} assume !!(0 != ~r~0); {122844#(< ~counter~0 37)} is VALID [2022-04-15 09:10:39,178 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {122080#true} {122844#(< ~counter~0 37)} #94#return; {122844#(< ~counter~0 37)} is VALID [2022-04-15 09:10:39,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,178 INFO L272 TraceCheckUtils]: 19: Hoare triple {122844#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {122844#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {122844#(< ~counter~0 37)} is VALID [2022-04-15 09:10:39,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {122869#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122844#(< ~counter~0 37)} is VALID [2022-04-15 09:10:39,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {122869#(< ~counter~0 36)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,180 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {122080#true} {122869#(< ~counter~0 36)} #92#return; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,180 INFO L272 TraceCheckUtils]: 11: Hoare triple {122869#(< ~counter~0 36)} 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)); {122080#true} is VALID [2022-04-15 09:10:39,181 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {122080#true} {122869#(< ~counter~0 36)} #90#return; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {122080#true} assume true; {122080#true} is VALID [2022-04-15 09:10:39,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {122080#true} assume !(0 == ~cond); {122080#true} is VALID [2022-04-15 09:10:39,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {122080#true} ~cond := #in~cond; {122080#true} is VALID [2022-04-15 09:10:39,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {122869#(< ~counter~0 36)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {122080#true} is VALID [2022-04-15 09:10:39,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {122869#(< ~counter~0 36)} 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; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {122869#(< ~counter~0 36)} call #t~ret9 := main(); {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122869#(< ~counter~0 36)} {122080#true} #102#return; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {122869#(< ~counter~0 36)} assume true; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {122080#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; {122869#(< ~counter~0 36)} is VALID [2022-04-15 09:10:39,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {122080#true} call ULTIMATE.init(); {122080#true} is VALID [2022-04-15 09:10:39,183 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-15 09:10:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493232050] [2022-04-15 09:10:39,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547690530] [2022-04-15 09:10:39,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547690530] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:10:39,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:10:39,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-15 09:10:39,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:39,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338234373] [2022-04-15 09:10:39,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338234373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:39,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:39,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 09:10:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651215252] [2022-04-15 09:10:39,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:39,184 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-15 09:10:39,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:39,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 09:10:39,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:39,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 09:10:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:39,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 09:10:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 09:10:39,290 INFO L87 Difference]: Start difference. First operand 735 states and 951 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 09:10:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:42,179 INFO L93 Difference]: Finished difference Result 790 states and 1024 transitions. [2022-04-15 09:10:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 09:10:42,179 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 135 [2022-04-15 09:10:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 09:10:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 09:10:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 09:10:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 09:10:42,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-15 09:10:42,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:42,492 INFO L225 Difference]: With dead ends: 790 [2022-04-15 09:10:42,492 INFO L226 Difference]: Without dead ends: 785 [2022-04-15 09:10:42,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=834, Invalid=1146, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 09:10:42,493 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 233 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:42,493 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 298 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 09:10:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-04-15 09:10:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 763. [2022-04-15 09:10:45,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:45,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 785 states. Second operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 09:10:45,205 INFO L74 IsIncluded]: Start isIncluded. First operand 785 states. Second operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 09:10:45,205 INFO L87 Difference]: Start difference. First operand 785 states. Second operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 09:10:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:45,225 INFO L93 Difference]: Finished difference Result 785 states and 1018 transitions. [2022-04-15 09:10:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1018 transitions. [2022-04-15 09:10:45,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:45,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:45,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 785 states. [2022-04-15 09:10:45,227 INFO L87 Difference]: Start difference. First operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 785 states. [2022-04-15 09:10:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:45,249 INFO L93 Difference]: Finished difference Result 785 states and 1018 transitions. [2022-04-15 09:10:45,249 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1018 transitions. [2022-04-15 09:10:45,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:45,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:45,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:45,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 567 states have (on average 1.1781305114638447) internal successors, (668), 584 states have internal predecessors, (668), 163 states have call successors, (163), 34 states have call predecessors, (163), 32 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 09:10:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 992 transitions. [2022-04-15 09:10:45,275 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 992 transitions. Word has length 135 [2022-04-15 09:10:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:45,275 INFO L478 AbstractCegarLoop]: Abstraction has 763 states and 992 transitions. [2022-04-15 09:10:45,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 17 states have call successors, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-15 09:10:45,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 763 states and 992 transitions. [2022-04-15 09:11:09,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 992 edges. 987 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 09:11:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 992 transitions. [2022-04-15 09:11:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 09:11:09,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:11:09,575 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:11:09,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 09:11:09,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:11:09,776 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:11:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:11:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-15 09:11:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:11:09,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1977933941] [2022-04-15 09:11:09,776 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:11:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-15 09:11:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:11:09,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457846040] [2022-04-15 09:11:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:11:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:11:09,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:11:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148560769] [2022-04-15 09:11:09,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:11:09,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:11:09,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:11:09,790 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:11:09,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 09:11:09,849 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:11:09,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:11:09,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 09:11:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:11:09,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:13:15,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {127621#true} call ULTIMATE.init(); {127621#true} is VALID [2022-04-15 09:13:15,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {127621#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; {127621#true} is VALID [2022-04-15 09:13:15,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127621#true} {127621#true} #102#return; {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {127621#true} call #t~ret9 := main(); {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {127621#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; {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {127621#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127621#true} {127621#true} #90#return; {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L272 TraceCheckUtils]: 11: Hoare triple {127621#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)); {127621#true} is VALID [2022-04-15 09:13:15,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {127621#true} ~cond := #in~cond; {127662#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:13:15,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {127662#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {127666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:13:15,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {127666#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {127666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:13:15,827 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127666#(not (= |assume_abort_if_not_#in~cond| 0))} {127621#true} #92#return; {127673#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-15 09:13:17,836 WARN L290 TraceCheckUtils]: 16: Hoare triple {127673#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is UNKNOWN [2022-04-15 09:13:17,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post6 < 50);havoc #t~post6; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 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)); {127621#true} is VALID [2022-04-15 09:13:17,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:17,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:17,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:17,838 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127621#true} {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #94#return; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(0 != ~r~0); {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post7 < 50);havoc #t~post7; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,839 INFO L272 TraceCheckUtils]: 27: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 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)); {127621#true} is VALID [2022-04-15 09:13:17,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:17,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:17,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:17,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127621#true} {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #96#return; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !(~r~0 > 0); {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post8 < 50);havoc #t~post8; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:17,841 INFO L272 TraceCheckUtils]: 35: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 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)); {127621#true} is VALID [2022-04-15 09:13:17,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:17,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:17,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:17,842 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127621#true} {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #98#return; {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 09:13:18,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {127677#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post8 < 50);havoc #t~post8; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,739 INFO L272 TraceCheckUtils]: 43: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127621#true} is VALID [2022-04-15 09:13:18,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:18,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:18,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:18,740 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127621#true} {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #98#return; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !(~r~0 < 0); {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,743 INFO L290 TraceCheckUtils]: 50: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post6 < 50);havoc #t~post6; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,743 INFO L272 TraceCheckUtils]: 51: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127621#true} is VALID [2022-04-15 09:13:18,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:18,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:18,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:18,744 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127621#true} {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #94#return; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,745 INFO L290 TraceCheckUtils]: 56: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(0 != ~r~0); {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post7 < 50);havoc #t~post7; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,749 INFO L272 TraceCheckUtils]: 59: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127621#true} is VALID [2022-04-15 09:13:18,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:18,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:18,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:18,749 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127621#true} {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #96#return; {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 09:13:18,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {127750#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 09:13:18,763 INFO L290 TraceCheckUtils]: 65: Hoare triple {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 09:13:20,764 WARN L290 TraceCheckUtils]: 66: Hoare triple {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(#t~post7 < 50);havoc #t~post7; {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is UNKNOWN [2022-04-15 09:13:20,765 INFO L272 TraceCheckUtils]: 67: Hoare triple {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:20,765 INFO L290 TraceCheckUtils]: 68: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,765 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127621#true} {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #96#return; {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 09:13:20,768 INFO L290 TraceCheckUtils]: 72: Hoare triple {127823#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,768 INFO L290 TraceCheckUtils]: 73: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,795 INFO L290 TraceCheckUtils]: 74: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 50);havoc #t~post7; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,795 INFO L272 TraceCheckUtils]: 75: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:20,795 INFO L290 TraceCheckUtils]: 76: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,795 INFO L290 TraceCheckUtils]: 77: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,795 INFO L290 TraceCheckUtils]: 78: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,796 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127621#true} {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,797 INFO L290 TraceCheckUtils]: 80: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,797 INFO L290 TraceCheckUtils]: 81: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,797 INFO L290 TraceCheckUtils]: 82: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 50);havoc #t~post8; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,798 INFO L272 TraceCheckUtils]: 83: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:20,798 INFO L290 TraceCheckUtils]: 84: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,798 INFO L290 TraceCheckUtils]: 85: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,798 INFO L290 TraceCheckUtils]: 86: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,798 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127621#true} {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 09:13:20,804 INFO L290 TraceCheckUtils]: 88: Hoare triple {127848#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,806 INFO L290 TraceCheckUtils]: 89: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post8 < 50);havoc #t~post8; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,807 INFO L272 TraceCheckUtils]: 91: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~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)); {127621#true} is VALID [2022-04-15 09:13:20,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,807 INFO L290 TraceCheckUtils]: 93: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,807 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127621#true} {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #98#return; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,855 INFO L290 TraceCheckUtils]: 96: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !(~r~0 < 0); {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post6 < 50);havoc #t~post6; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,862 INFO L272 TraceCheckUtils]: 99: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~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)); {127621#true} is VALID [2022-04-15 09:13:20,862 INFO L290 TraceCheckUtils]: 100: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,863 INFO L290 TraceCheckUtils]: 102: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,863 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127621#true} {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #94#return; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,864 INFO L290 TraceCheckUtils]: 104: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(0 != ~r~0); {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,878 INFO L290 TraceCheckUtils]: 106: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post7 < 50);havoc #t~post7; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,878 INFO L272 TraceCheckUtils]: 107: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~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)); {127621#true} is VALID [2022-04-15 09:13:20,879 INFO L290 TraceCheckUtils]: 108: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,879 INFO L290 TraceCheckUtils]: 109: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,879 INFO L290 TraceCheckUtils]: 110: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,879 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127621#true} {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #96#return; {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 09:13:20,880 INFO L290 TraceCheckUtils]: 112: Hoare triple {127897#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,881 INFO L290 TraceCheckUtils]: 113: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,882 INFO L290 TraceCheckUtils]: 114: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post7 < 50);havoc #t~post7; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,882 INFO L272 TraceCheckUtils]: 115: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 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)); {127621#true} is VALID [2022-04-15 09:13:20,882 INFO L290 TraceCheckUtils]: 116: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,882 INFO L290 TraceCheckUtils]: 117: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,882 INFO L290 TraceCheckUtils]: 118: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,883 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127621#true} {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #96#return; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,884 INFO L290 TraceCheckUtils]: 120: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !(~r~0 > 0); {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,885 INFO L290 TraceCheckUtils]: 121: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,886 INFO L290 TraceCheckUtils]: 122: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post8 < 50);havoc #t~post8; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,886 INFO L272 TraceCheckUtils]: 123: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 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)); {127621#true} is VALID [2022-04-15 09:13:20,886 INFO L290 TraceCheckUtils]: 124: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:20,886 INFO L290 TraceCheckUtils]: 125: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:20,886 INFO L290 TraceCheckUtils]: 126: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:20,886 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127621#true} {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #98#return; {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 128: Hoare triple {127970#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 129: Hoare triple {127622#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 130: Hoare triple {127622#false} assume !(#t~post8 < 50);havoc #t~post8; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 131: Hoare triple {127622#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 132: Hoare triple {127622#false} assume !(#t~post6 < 50);havoc #t~post6; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L272 TraceCheckUtils]: 133: Hoare triple {127622#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)); {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 134: Hoare triple {127622#false} ~cond := #in~cond; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 135: Hoare triple {127622#false} assume 0 == ~cond; {127622#false} is VALID [2022-04-15 09:13:20,890 INFO L290 TraceCheckUtils]: 136: Hoare triple {127622#false} assume !false; {127622#false} is VALID [2022-04-15 09:13:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 47 proven. 112 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-15 09:13:20,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:13:23,434 INFO L290 TraceCheckUtils]: 136: Hoare triple {127622#false} assume !false; {127622#false} is VALID [2022-04-15 09:13:23,434 INFO L290 TraceCheckUtils]: 135: Hoare triple {127622#false} assume 0 == ~cond; {127622#false} is VALID [2022-04-15 09:13:23,434 INFO L290 TraceCheckUtils]: 134: Hoare triple {127622#false} ~cond := #in~cond; {127622#false} is VALID [2022-04-15 09:13:23,434 INFO L272 TraceCheckUtils]: 133: Hoare triple {127622#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)); {127622#false} is VALID [2022-04-15 09:13:23,435 INFO L290 TraceCheckUtils]: 132: Hoare triple {127622#false} assume !(#t~post6 < 50);havoc #t~post6; {127622#false} is VALID [2022-04-15 09:13:23,435 INFO L290 TraceCheckUtils]: 131: Hoare triple {127622#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127622#false} is VALID [2022-04-15 09:13:23,435 INFO L290 TraceCheckUtils]: 130: Hoare triple {127622#false} assume !(#t~post8 < 50);havoc #t~post8; {127622#false} is VALID [2022-04-15 09:13:23,435 INFO L290 TraceCheckUtils]: 129: Hoare triple {127622#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127622#false} is VALID [2022-04-15 09:13:23,435 INFO L290 TraceCheckUtils]: 128: Hoare triple {128067#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {127622#false} is VALID [2022-04-15 09:13:23,435 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127621#true} {128067#(not (< main_~r~0 0))} #98#return; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,436 INFO L290 TraceCheckUtils]: 126: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,436 INFO L290 TraceCheckUtils]: 125: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,436 INFO L290 TraceCheckUtils]: 124: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,436 INFO L272 TraceCheckUtils]: 123: Hoare triple {128067#(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)); {127621#true} is VALID [2022-04-15 09:13:23,436 INFO L290 TraceCheckUtils]: 122: Hoare triple {128067#(not (< main_~r~0 0))} assume !!(#t~post8 < 50);havoc #t~post8; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,436 INFO L290 TraceCheckUtils]: 121: Hoare triple {128067#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,437 INFO L290 TraceCheckUtils]: 120: Hoare triple {128067#(not (< main_~r~0 0))} assume !(~r~0 > 0); {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,437 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127621#true} {128067#(not (< main_~r~0 0))} #96#return; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,437 INFO L290 TraceCheckUtils]: 118: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,437 INFO L290 TraceCheckUtils]: 117: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,437 INFO L290 TraceCheckUtils]: 116: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,437 INFO L272 TraceCheckUtils]: 115: Hoare triple {128067#(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)); {127621#true} is VALID [2022-04-15 09:13:23,438 INFO L290 TraceCheckUtils]: 114: Hoare triple {128067#(not (< main_~r~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,438 INFO L290 TraceCheckUtils]: 113: Hoare triple {128067#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,439 INFO L290 TraceCheckUtils]: 112: Hoare triple {128116#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128067#(not (< main_~r~0 0))} is VALID [2022-04-15 09:13:23,440 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127621#true} {128116#(<= main_~v~0 main_~r~0)} #96#return; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,440 INFO L290 TraceCheckUtils]: 110: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,440 INFO L290 TraceCheckUtils]: 109: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,440 INFO L290 TraceCheckUtils]: 108: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,440 INFO L272 TraceCheckUtils]: 107: Hoare triple {128116#(<= main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:23,440 INFO L290 TraceCheckUtils]: 106: Hoare triple {128116#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 50);havoc #t~post7; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,441 INFO L290 TraceCheckUtils]: 105: Hoare triple {128116#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,441 INFO L290 TraceCheckUtils]: 104: Hoare triple {128116#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,441 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127621#true} {128116#(<= main_~v~0 main_~r~0)} #94#return; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,441 INFO L290 TraceCheckUtils]: 102: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,441 INFO L290 TraceCheckUtils]: 101: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,442 INFO L290 TraceCheckUtils]: 100: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,442 INFO L272 TraceCheckUtils]: 99: Hoare triple {128116#(<= main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:23,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {128116#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 50);havoc #t~post6; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {128116#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {128116#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,443 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127621#true} {128116#(<= main_~v~0 main_~r~0)} #98#return; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,443 INFO L290 TraceCheckUtils]: 94: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,443 INFO L290 TraceCheckUtils]: 93: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,443 INFO L290 TraceCheckUtils]: 92: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,443 INFO L272 TraceCheckUtils]: 91: Hoare triple {128116#(<= main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:23,443 INFO L290 TraceCheckUtils]: 90: Hoare triple {128116#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 50);havoc #t~post8; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,444 INFO L290 TraceCheckUtils]: 89: Hoare triple {128116#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,446 INFO L290 TraceCheckUtils]: 88: Hoare triple {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128116#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 09:13:23,446 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127621#true} {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,446 INFO L272 TraceCheckUtils]: 83: Hoare triple {128189#(<= main_~v~0 (+ main_~u~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)); {127621#true} is VALID [2022-04-15 09:13:23,447 INFO L290 TraceCheckUtils]: 82: Hoare triple {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 50);havoc #t~post8; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,447 INFO L290 TraceCheckUtils]: 81: Hoare triple {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,447 INFO L290 TraceCheckUtils]: 80: Hoare triple {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,448 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127621#true} {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,448 INFO L290 TraceCheckUtils]: 78: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,448 INFO L272 TraceCheckUtils]: 75: Hoare triple {128189#(<= main_~v~0 (+ main_~u~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)); {127621#true} is VALID [2022-04-15 09:13:23,448 INFO L290 TraceCheckUtils]: 74: Hoare triple {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 50);havoc #t~post7; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,448 INFO L290 TraceCheckUtils]: 73: Hoare triple {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128189#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 09:13:23,450 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127621#true} {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 09:13:23,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,450 INFO L272 TraceCheckUtils]: 67: Hoare triple {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~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)); {127621#true} is VALID [2022-04-15 09:13:23,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 50);havoc #t~post7; {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 09:13:23,451 INFO L290 TraceCheckUtils]: 65: Hoare triple {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 09:13:23,452 INFO L290 TraceCheckUtils]: 64: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128238#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 09:13:23,452 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127621#true} {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,452 INFO L290 TraceCheckUtils]: 62: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,453 INFO L272 TraceCheckUtils]: 59: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~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)); {127621#true} is VALID [2022-04-15 09:13:23,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 50);havoc #t~post7; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,454 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127621#true} {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,455 INFO L272 TraceCheckUtils]: 51: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~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)); {127621#true} is VALID [2022-04-15 09:13:23,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 50);havoc #t~post6; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,456 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127621#true} {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,456 INFO L290 TraceCheckUtils]: 45: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,456 INFO L290 TraceCheckUtils]: 44: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,456 INFO L272 TraceCheckUtils]: 43: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~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)); {127621#true} is VALID [2022-04-15 09:13:23,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 50);havoc #t~post8; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128263#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 09:13:23,460 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127621#true} {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #98#return; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,460 INFO L272 TraceCheckUtils]: 35: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:23,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post8 < 50);havoc #t~post8; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !(~r~0 > 0); {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,461 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127621#true} {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #96#return; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,462 INFO L272 TraceCheckUtils]: 27: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:23,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post7 < 50);havoc #t~post7; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(0 != ~r~0); {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127621#true} {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #94#return; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,464 INFO L272 TraceCheckUtils]: 19: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~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)); {127621#true} is VALID [2022-04-15 09:13:23,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post6 < 50);havoc #t~post6; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {128409#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {128336#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 09:13:23,467 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127666#(not (= |assume_abort_if_not_#in~cond| 0))} {127621#true} #92#return; {128409#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} is VALID [2022-04-15 09:13:23,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {127666#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {127666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:13:23,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {128422#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {127666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:13:23,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {127621#true} ~cond := #in~cond; {128422#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 09:13:23,468 INFO L272 TraceCheckUtils]: 11: Hoare triple {127621#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)); {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127621#true} {127621#true} #90#return; {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {127621#true} assume !(0 == ~cond); {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {127621#true} ~cond := #in~cond; {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {127621#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {127621#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; {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {127621#true} call #t~ret9 := main(); {127621#true} is VALID [2022-04-15 09:13:23,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127621#true} {127621#true} #102#return; {127621#true} is VALID [2022-04-15 09:13:23,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {127621#true} assume true; {127621#true} is VALID [2022-04-15 09:13:23,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {127621#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; {127621#true} is VALID [2022-04-15 09:13:23,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {127621#true} call ULTIMATE.init(); {127621#true} is VALID [2022-04-15 09:13:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-15 09:13:23,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:13:23,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457846040] [2022-04-15 09:13:23,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:13:23,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148560769] [2022-04-15 09:13:23,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148560769] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:13:23,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:13:23,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-15 09:13:23,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:13:23,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1977933941] [2022-04-15 09:13:23,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1977933941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:13:23,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:13:23,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:13:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281178526] [2022-04-15 09:13:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:13:23,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-15 09:13:23,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:13:23,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:13:29,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 96 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:13:29,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:13:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:13:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:13:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-15 09:13:29,261 INFO L87 Difference]: Start difference. First operand 763 states and 992 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:13:36,554 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-15 09:13:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:13:46,285 INFO L93 Difference]: Finished difference Result 1020 states and 1378 transitions. [2022-04-15 09:13:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:13:46,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-15 09:13:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:13:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:13:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-15 09:13:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:13:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-15 09:13:46,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-15 09:13:57,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 158 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 09:13:57,515 INFO L225 Difference]: With dead ends: 1020 [2022-04-15 09:13:57,515 INFO L226 Difference]: Without dead ends: 907 [2022-04-15 09:13:57,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:13:57,515 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 09:13:57,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 487 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 1 Unknown, 242 Unchecked, 2.8s Time] [2022-04-15 09:13:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-15 09:13:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 766. [2022-04-15 09:13:59,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:13:59,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 766 states, 569 states have (on average 1.1775043936731107) internal successors, (670), 587 states have internal predecessors, (670), 164 states have call successors, (164), 34 states have call predecessors, (164), 32 states have return successors, (162), 144 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-15 09:13:59,795 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 766 states, 569 states have (on average 1.1775043936731107) internal successors, (670), 587 states have internal predecessors, (670), 164 states have call successors, (164), 34 states have call predecessors, (164), 32 states have return successors, (162), 144 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-15 09:13:59,795 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 766 states, 569 states have (on average 1.1775043936731107) internal successors, (670), 587 states have internal predecessors, (670), 164 states have call successors, (164), 34 states have call predecessors, (164), 32 states have return successors, (162), 144 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-15 09:13:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:13:59,821 INFO L93 Difference]: Finished difference Result 907 states and 1210 transitions. [2022-04-15 09:13:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1210 transitions. [2022-04-15 09:13:59,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:13:59,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:13:59,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 766 states, 569 states have (on average 1.1775043936731107) internal successors, (670), 587 states have internal predecessors, (670), 164 states have call successors, (164), 34 states have call predecessors, (164), 32 states have return successors, (162), 144 states have call predecessors, (162), 162 states have call successors, (162) Second operand 907 states. [2022-04-15 09:13:59,823 INFO L87 Difference]: Start difference. First operand has 766 states, 569 states have (on average 1.1775043936731107) internal successors, (670), 587 states have internal predecessors, (670), 164 states have call successors, (164), 34 states have call predecessors, (164), 32 states have return successors, (162), 144 states have call predecessors, (162), 162 states have call successors, (162) Second operand 907 states. [2022-04-15 09:13:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:13:59,851 INFO L93 Difference]: Finished difference Result 907 states and 1210 transitions. [2022-04-15 09:13:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1210 transitions. [2022-04-15 09:13:59,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:13:59,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:13:59,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:13:59,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:13:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 569 states have (on average 1.1775043936731107) internal successors, (670), 587 states have internal predecessors, (670), 164 states have call successors, (164), 34 states have call predecessors, (164), 32 states have return successors, (162), 144 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-15 09:13:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 996 transitions. [2022-04-15 09:13:59,876 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 996 transitions. Word has length 137 [2022-04-15 09:13:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:13:59,876 INFO L478 AbstractCegarLoop]: Abstraction has 766 states and 996 transitions. [2022-04-15 09:13:59,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:13:59,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 766 states and 996 transitions.